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

We show that the Copeland solution is equivalent to the minisum principle which requires to choose the candidate(s) who beat all remaining contenders in the smallest total number of steps.

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