We adopt the notion of von Neumann-Morgenstern (vNM) farsightedly stable sets to determine which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of vNM farsightedly stable sets: a set of matchings is a vNM farsightedly...

We adopt the notion of von Neumann-Morgenstern (vNM) farsightedly stable sets to determine which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of vNM farsightedly stable sets: a set of matchings is a vNM farsightedly...

We adopt the notion of von Neumann-Morgenstern (vNM) farsightedly stable sets to determine which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of vNM farsightedly stable sets: a set of matchings is a vNM farsightedly...

In two-sided matching problems, we consider "natural" changes in prefer- ences of agents in which only the rankings of current partners are enhanced. We introduce two desirable properties of matching rules under such rank- enhancements of partners. One property requires that an agent who be-...

In two-sided matching problems, we consider “natural” changes in preferences of agents in which only the rankings of current partners are enhanced. We introduce two desirable properties of matching rules under such rankenhancements of partners. One property requires that an agent who becomes...

In two-sided matching problems, we consider “natural” changes in preferences of agents in which only the rankings of current partners are enhanced. We introduce two desirable properties of matching rules under such rankenhancements of partners. One property requires that an agent who becomes...

This paper considers a resource allocation mechanism that utilizes a profit-maximizing auctioneer/matchmaker in the Kelso-Crawford (1982) (many-to-one) assignment problem. We consider general and simple (individualized price) message spaces for firms' reports following Milgrom (2010). We show...

We adopt the notion of von Neumann-Morgenstern farsightedly stable sets to predict which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann-Morgenstern farsightedly stable sets: a set of matchings is a von...

We adopt the notion of von Neumann-Morgenstern farsightedly stable sets to predict with matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of von Neumann-Morgenstern farsightedly stable sets : a set of matchings is a von...