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

This paper takes the idea of coalitional behavior – groups of people occasionally acting together to their mutual benefit – and incorporates it into the framework of evolutionary game theory that underpins the social learning literature. An equilibrium selection criterion is defined which we...

Inspired by the social psychology literature, we study the implications of categorical thinking on decision making in the context of a large normal form game. Every agent has a categorization (partition) of her opponents and can only observe the average behavior in each category. A strategy...

We propose a definition of egalitarian equivalence that extends Pazner and Schmeidlerʼs (1978) concept to environments with incomplete information. If every feasible allocation rule can be implemented by an incentive compatible mechanism (as, for instance, in the case of non-exclusive...

First via a counter example it is shown that Proposition 3 of Anbarci and Sun (2013) is false. Then a gap and a mistake in their proof are identified. Finally, a modified version of their Proposition 3 is stated and proved.

This paper inspires from a real-life assignment problem faced by the Mexican Ministry of Public Education. We introduce a dynamic school choice problem that consists in assigning positions to overlapping generations of teachers. From one period to another, teachers can either retain their...

We analyze absorbing sets as a solution for roommate problems with strict preferences. This solution provides the set of stable matchings when it is non-empty and some matchings with interesting properties otherwise. In particular, all matchings in an absorbing set have the greatest number of...

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

We study a setting in which imitative players are matched into pairs to play a Prisonerʼs Dilemma game. A well-known result in such setting is that under random matching cooperation vanishes for any interior initial condition. The novelty of this paper is that we consider partial rematching:...