We introduce a compromise value for non-transferable utility games: the Chi-compromise value. It is closely related to the Compromise value introduced by Borm, Keiding, McLean, Oortwijn, and Tijs (1992), to the MC-value introduced by Otten, Borm, Peleg, and Tijs (1998), and to the -value introduced by Berganti~ nos, CasasM endez, and V azquez-Brage (2000). The main di erence being that the maxi...

A t-spanner of a graph G = (V,E), is a sub-graph SG = (V,E′), such that E′ ⊆ E and for every edge (u, v) ∈ E, there is a path from u to v in SG of length at most t. A minimum-edge t-spanner of a graph G, S′ G, is the t-spanner of G with the fewest edges. For general graphs and for t=2, the problem of determining for a given integer s, whether |E(S′ G)| ≤ s is NP-Complete [2]. Peleg and Ullman [...

Peleg (1986) and Tadenuma (1992) provide two well-known axiomatic characterizations of the core on the domain of balanced TU games. Peleg’s characterization says that the core is the only solution that satisfies non-emptiness, individual rationality, super-additivity, and a reduced game property introduced by Davis and Maschler (1965). Tadenuma’s characterization says that the core is the only ...

We study the consequences of positive correlation of beliefs in the design of voting rules in a model with an arbitrary number of voters. We propose a notion of positive correlation, based on the likelihood of agreement of the k best alternatives (for any k) of two orders called TS correlation. We characterize the set of Ordinally Bayesian Incentive-Compatible (OBIC) (d’Aspremont and Peleg (198...

In this paper, we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n− 2 edges and an additive 3-spanner with at most O(n log n) edges. This significantly improves results of Peleg and Schäffer from [Graph Spanners, J. Graph Theory 13 (1989) 99–116]. Our spanners are additive and easier to construct.An additive 4-spanner can be constructed in l...

Visual Learning of Arithmetic Operations Yedid Hoshen and Shmuel Peleg ­ HUJI A simple Neural Network model is presented for end­to­end visual learning of arithmetic operations from pictures of numbers. The input consists of two pictures, each showing a 7­digit number. The output, also a picture, displays the number showing the result of an arithmetic operation (e.g., addition or subtracti...

Solvable theories of 2D dilaton gravity can be obtained from a Liouville theory by suitable field redefinitions. In this paper we propose a new framework to generate 2D dilaton gravity models which can also be exactly solved in the semiclassical approximation. Our approach is based on the recently introduced scheme to quantize massless scalar fields coupled to 2D gravity maintaining invariance ...

A model of certain aspects of the cortex related to reading is developed corresponding to ongoing exploration of psychophysical and computational experiments on how the two hemispheres work in humans. The connectivity arrangements between modelled areas of orthography, phonology and semantics are according to the theories of Eviatar and Peleg, in particular with distinctions between the connect...

We study the communication primitive of broadcasting (one-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmissions is precomputed based on full knowledge about the size and the topology of the network. We show that radio broadcasting can be completed in D +O(log n) time units in planar graphs of size n, and with diameter D. This improv...

The purpose of this paper was to estimate and to evaluate the hydration curves of three kinds of dry bean varieties (Phaseolus vulgaris L.), besides adjusting the Peleg’s model to the experimental values under several soaking temperatures. Bean seeds of pinto, black and red kidney varieties were soaked in distilled water in the temperatures of 20, 30, 40 and 50 °C. The constant C1 (Peleg rate c...