Peleg M. Horowitz,1 Kristina R. Patterson,1 Angela L. Guillozet-Bongaarts,1 Matthew R. Reynolds,1 Christopher A. Carroll,4 Susan T. Weintraub,4 David A. Bennett,5 Vincent L. Cryns,1,2 Robert W. Berry,1,3 and Lester I. Binder1,3 1Department of Cell and Molecular Biology, 2Cell Death Regulation Laboratory, Division of Endocrinology, Metabolism, and Molecular Medicine, Department of Medicine, and ...

We show that feasible elimination procedures (Peleg, 1978) can be used to select k from m alternatives. An important advantage of this method is the core property: no coalition can guarantee an outcome that is preferred by all its members. We also provide an axiomatic characterization for the case k = 1, using the conditions of anonymity, Maskin monotonicity, and independent blocking. Finally, ...

A new process logic is deened, called computation paths logic (CPL), which treats formulas and programs essentially alike. CPL is a pathwise extension of PDL, following the basic process logic of Harel, Kozen and Parikh, and is close in spirit to the logic R of Harel and Peleg. It enjoys most of the advantages of previous process logics, yet is decidable in elementary time. We also ooer extensi...

In this note we prove an extension of a remarkable result due to B. Peleg. Peleg’s result concerning with the simultaneous validity of a set of inequalities for families of functions defined on a finite product of standard simplices in finite dimensional spaces. The main result we prove here provides an extension of that result to the case of functions defined on a rather general product of sim...

This paper deals with a polling game on a graph. Initially, each vertex is colored white or black. At each round, each vertex is colored by the color shared by the majority of vertices in its neighborhood. (All recolorings are done simultaneously). We say that a set W0 of vertices is a dynamic monopoly or dynamo if starting the game with the vertices ofW0 colored white, the entire system is whi...

A distance labeling scheme is an assignments of labels, that is binary strings, to all nodes of a graph, so that the distance between any two nodes can be computed from their labels and the labels are as short as possible. A major open problem is to determine the complexity of distance labeling in unweighted and undirected planar graphs. It is known that, in such a graph on n nodes, some labels...

Nash equilibria for strategic games were characterized by Peleg and Tijs (1996) as those solutions satisfying the properties of consistency, converse consistency and one-person rationality. There are other solutions, like the e-Nash equilibria, which enjoy nice properties and appear to be interesting substitutes for Nash equilibria when their existence cannot be guaranteed. They can be characte...

In the MINIMUM STRICTLY FUNDAMENTAL CYCLE BASIS (MSFCB) problem one is looking for a spanning tree such that the sum of the lengths of its induced fundamental circuits is minimum. We identify square planar grid graphs as being very challenging testbeds for the MSFCB. The best lower and upper bounds for this problem are due to Alon, Karp, Peleg, and West (1995) and to Amaldi et al. (2004). We im...

Raz Avni, Moran Nave, Omer Barad, Kobi Baruch, Sven O. Twardziok, Heidrun Gundlach, Iago Hale, Martin Mascher, Manuel Spannagl, Krystalee Wiebe, Katherine W. Jordan, Guy Golan, Jasline Deek, Batsheva Ben-Zvi, Gil Ben-Zvi, Axel Himmelbach, Ron P. MacLachlan, Andrew G. Sharpe, Allan Fritz, Roi Ben-David, Hikmet Budak, Tzion Fahima, Abraham Korol, Justin D. Faris, Alvaro Hernandez, Mark A. Mikel, ...