A number of heterogeneous items are to be sold to several bidders. Each bidder demands at most one item. The price of each item is not completely flexible but restricted to some admissible interval. Due to price rigidities, a Walrasian equilibrium usually fails to exist. To facilitate the...

We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called fair distribution of the surplus.

We examine a housing market with price controls and show how the allocation problem can be solved through a price system. We demonstrate that the auction of Talman and Yang (2008) always generates a core allocation, thus resulting in a Pareto efficient and stable outcome.

We study cooperative games with transferable utility and limited cooperation possibilities. The focus is on communication structures where the set of players forms a circle, so that the possibilities of cooperation are represented by the connected sets of nodes of an undirected circular graph....