This note showed by means of Knuth's example that some stable matchings may not be obtained by the random order mechanism.

Both rematching proof and strong equilibrium outcomes are stable with respect to the true preferences in the marriage problem. We show that not all rematching proof or strong equilibrium outcomes are stable in the college admissions problem. But we show that both rematching proof and strong...

Consider a society with a finite number of players. Each player has personal preferences over coalitions in which he joints. A social outcome is a coalition structure that is defined by a partition of the set of players. We study the strategy proof core and von Neumann and Morgenstern (vN&M)...

We show that, in markets with indivisibilties (typified by the Shapley-Scarf housing market), the strict core mechanism is categorically determined by three assumptions: individual rationality, Pareto optimality and strategy-proofness.

This paper studies the English (progressive) auction for an exchange economy with multiple objects. The English auction is a tatonnement process and lasts multiple rounds. It is modeled as a sequence of round games. Each round game is a normal form game in which an agent's strategies are his...

Consider a society with a finite number of individuals. A coalition structure is a partition of the set of individuals. Each individual has personal preferences over the set of all coalition structures. We study the strategy proof core and von Neumann and Morgenstern (vN&M) solutions. A roommate...

Roth and Vande Vate (1991) studied the marriage problem and introduced the notion of truncation strategies and showed in an example that the unstable matchings can arise at Nash equilibria in truncations. This paper studies the college admissions problem and shows that all rematching proof or...