The paper addresses the following question: how efficient is the market system in allocating resources if trade takes place at some prices $p$ that are not necessarily competitive? Even though there are many partial answers to this question, an answer that stands comparison to the rigor by which...

We report new results for a time-indexed formulation of nonpreemptive single- machine scheduling problems. We give complete characterizations of all facet induc- ing inequalities with integral coecients and right-hand side 1 or 2 for the convex hull of the set of feasible partial schedules,...

In many real life passenger railway networks, the types of stations and lines characterisethe halting stations of the train lines. Common types are Regional, Interregional or Intercity.This paper considers the problem of altering the halts of lines by both upgrading and downgrading stations,...

We consider the problem of (re)allocating the total endowment of an infinitely divisible commodity among agents with single-peaked preferences and initial endowments. We propose an extension of the so-called uniform rule and show that it is the unique rule satisfying strategy-proofness, Pareto...

We consider the problem of reallocating the total initial endowments of an infinitely divisible commodity among agents with single-peaked preferences. With the uniform reallocation rule we propose a solution which satisfies many appealing properties, describing the effect of population and...

In cumulative prospect theory models, different behavior concerning gains and losses is per-mitted. For gains different decision weights are assigned than for losses, and the shape of utility can reveal loss aversion. Decision analyses concentrate on both, the capacities, which determine the...

Technological innovations and growing consumer demand have led to a variety of design and expansion problems in telecommunication networks. In particular, local access net- works have received a lot of attention, since they account for approximately 60% of total investments in communication...

In this paper we prove the following fixed point theorem. Consider a non-empty bounded polyhedron P and a function ƒ : P → P such that for every x є P for which ƒ (x) ≠ x there exists δ 0 such that for all y, z є B (x, δ) ∩ P it holds that (ƒ(y)-y)2 (ƒ(z)-z) ≤ 0, where B (x, δ)...

The goal of this paper is twofold. Firstly a short proof of the unicity of the reduced form of a normal form game is provided, using a technique to reduce a game originally introduced by Mertens. Secondly a direct combinatorial-geometric interpretation of the reduced form is described. This...

By virtue of the Kemeny distance strategy-proofness of preference rules is defined. It is shown that a preference rule, which assigns a complete relation to every profile of complete relations is non-imposed and strategy-proof if and only if it is pairwise voting in committees. So,...