We introduce the notion of group robust stability which requires robustness against a combined manipulation, first misreporting preferences and then rematching, by any group of students in the school choice type of matching markets. Our first result shows that there is no group robustly stable...

Gale and Shapley (1962) proposed the deferred-acceptance algorithm for matching (i) college applicants and colleges and (ii) men and women. In the case of the latter, it produces either one or two stable matches whereby no man and woman would prefer to be matched with each other rather than with...

We introduce a new matching model to mimic two-sided exchange programs such as tuition and worker exchange, in which each firm has to avoid being a net-exporter of workers. These exchanges use decentralized markets, making it difficult to achieve a balance between exports and imports. We show...

This paper explores situations where tenants in public houses, in a specific neighborhood, are given the legislated right to buy the houses they live in or can choose to remain in their houses and pay the regulated rent. This type of legislation has been passed in many European countries in the...

This paper explores situations where tenants in public houses, in a specific neighborhood, are given the legislated right to buy the houses they live in or can choose to remain in their houses and pay the regulated rent. This type of legislation has been passed in many European countries in the...

In this paper we are interested in efficient and individually rational exchange rules for markets with heterogeneous indivisible goods that exclude the possibility that an agent benefits by regrouping goods in her initial endowment. We present a suitable environment in which the existence of...

In this paper we are interested in efficient and individually rational exchange rules for markets with heterogeneous indivisible goods that exclude the possibility that an agent benefits by regrouping goods in her initial endowment. We present a suitable environment in which the existence of...

We extends the single-crossing property of preferences to tree graphs, and show that it is equivalent to intermediate preferences and order restriction, also extended to tree graphs. Moreover, to facilitate the use of single-crossing in network games, we develop algorithms to answer the...

Some of the basic results and insights of the literature on mechanism design are presented. In that literature game theoretic reasoning is used to model social institutions as varied as voting systems, auctions, bargaining protocols, and methods for deciding on public projects. A theme that...

This paper introduces information aggregation into the standard spatial committee game. We assume that committee members must agree on a decision rule to aggregate their private information on a policy-relevant state of the world. We derive sufficient conditions for the ex ante incentive...