The proposed game is a natural extension of the Shapley and Shubik Assignment Game to the case where each seller owns a set of different objets instead of only one indivisible object. We propose definitions of pairwise stability and group stability that are adapted to our framework. Existence of...

The Lorenz-Pareto Optimal Frontier of a collective choice problem indentifies a (usually quite large) subset of all Pareto optimal outcomes which are not inegalitarian according to the Lorenz criterion. We study the basic properties of Lorenz-Pareto optimal choice functions and in particular...

Based on the simple model of the deposit the methodology of finding the optimal solution for bilateral monopoly (BM) of lignite mine and power plant is shown taking into account pit optimisation. It is proposed to treat lignite price negotiation as a kind of game. In the first stage...

Different structures of lignite mines and power stations, which have appeared on the Polish market as a result of its transformation and the privatisation, were discussed. The attention is focused on the fact that the practice is overtaking the theory because there is lack of models of...

For methods of the profit division in the bilateral monopoly of the mine and the power station sug-gested in the first part of this paper the formulae for lignite price and shares in the joint profit of the mine and the power station are calculated. The proposed profit division contain: the...

In this paper, we introduce interdependent preferences to a classical one-to-one matching problem that allows for the prospect of being single, and study the existence and properties of stable matchings. We obtain the relationship between the stable set, the core, and the Pareto set, and give a...

This paper investigates an allocation rule that fairly assigns at most one indivisible object and a monetary compensation to each agent, under the restriction that the monetary compensations do not exceed some exogenously given upper bound. A few properties of this allocation rule are stated and...

Many real-life applications of house allocation problems are dynamic. For example, in the case of on-campus housing for college students, each year freshmen apply to move in and graduating seniors leave. Each student stays on campus for a few years only. A student is a "newcomer" in the...

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.

This paper studies an allocation procedure for coalitional games with veto players. The procedure is similar to the one presented by Dagan et al. (1997) for bankruptcy problems. According to it, a player, the proposer, makes a proposal that the remaining players must accept or reject, and con...