A class of voting procedures based on repeated ballots and elimination of one candidate in each round is shown to always induce an outcome in the top cycle and is thus Condorcet consistent, when voters behave strategically. This is an important class as it covers multi-stage, sequential...

We consider a multi-awards generalization of King Solomon's problem: $k$ identical and indivisible awards should be distributed among $n$ agents, $k<n$, with the top $k$ valuation agents receiving the awards. Agents have complete information about each others' valuations. Glazer and Ma (1989) analyzed the single-prize (i.e., $k=1$) version of this problem. We show that in the `more than two agents' problem the mechanism of Glazer and Ma admits inefficient equilibria and thus fails to solve Solomon's problem. So, first we modify their mechanism to rule out inefficient equilibria and implement efficient prize allocation in subgame perfect equilibrium when there are at least three agents. Then it is shown that a simple repeated application of our modified mechanism will distribute $k\;(>1)$ prizes efficiently in subgame perfect equilibria without any monetary transfers in equilibrium. Finally, in the multi-awards case we relax the...</n$,>

Rubinstein and Wolinsky (1990b) consider a simple decentralized market in which agents either meet randomly or choose their partners volunatarily and bargain over the terms on which they are willing to trade. Intuition suggests that if there are no transaction costs, the outcome of this matching...

We investigate the effect of introducing costs of complexity in the a justification for stationary equilibrium strategies in the class of games where complexity costs matter. As is well-known, in this game every individually rational allocation is sustainable as a Nash equilibrium (also as a...

Even with complete information, two-person bargaining can generate a large number of equilibria, involving disagreements and inefficiencies, in (i) negotiation games where disagreement payoffs are endogenously determined (Busch and Wen, 1995) and (ii) costly bargaining games where there are...

This paper consider the dynamic evolution of algorithmic (recursive) learning rules in a normal form game. It is shown that the system - the population frequencies - is globally stable for any arbitrary N-player normal form game, if the evolutionary process is algorithmic and the `birth process'...