This paper characterizes nonlinear outlay schedules that are based on a cooperative surplus sharing game with transferable utility. First, the pricing game is shown to be convex and, as a consequence, to have a non-empty core. This is followed by a description of the necessary and sufficient...

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...

The paper analyzes nonlinear tax schedules that are identified by maximizing a welfare function represented by a weighted summation of net utilities over a set of n=3 differing individuals. We demonstrate that some of the feasible and Pareto efficient tax schedules that satisfy self-selection...

A group of heterogeneous agents may form partnerships in pairs. All single agents as well as all partnerships generate values. If two agents choose to cooperate, they need to specify how to split their joint value among one another. In equilibrium, which may or may not exist, no agents have...

Kidney transplants across the blood-group barrier are medically feasible even if blood-group compatibility is preferred from a medical point of view. However, these types of transplants are motivated by the fact that they help in increasing the number of kidney transplants with living donors....

In many real-life house allocation problems, rents are bounded from above by price ceilings imposed by a government or a local administration. This is known as rent control. Because some price equilibria may be disqualified given such restrictions, this paper proposes an alternative equilibrium...

Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multiitem auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction is called the Vickrey-English-Dutch auction and it contains the Vickrey-English...

We present a polynomial time method for identifying the maximal set in excess demand at a given payoff vector. This set can be used in "large" partnership formation problems to identify the minimum element in the set of individually rational payoff vectors at which there is no overdemanded set...

We consider envy-free and budget-balanced allocation rules for problems where a number of indivisible objects and a fixed amount of money is allocated among a group of agents. In "small" economies, we identify under classical preferences each agent's maximal gain from manipulation. Using this...

This paper analyzes the problem of selecting a set of items whose prices are to be updated in the next iteration in so called simple ascending auctions with unit-demand bidders. A family of sets called "sets in excess demand" is introduced, and the main results demonstrate that a simple...