A coalitional matching is a two-sided matching problem in which agents on each side of the market may form coalitions such as student groups and research teams who - when matched - form universities. We assume that each researcher has preferences over the research teams he would like to work in...

We analyze cooperative behavior in a prisoner's dilemma game with high stakes, face-to-face communication, and two rounds of pre-play in which the two final contestants are endogenously selected via a voting process. Using data from the British television game show 'Golden Balls', we find a...

We study hedonic games with heterogeneous player types that reflect her nationality, ethnic background, or skill type. Agents' preferences are dictated by status-seeking where status can be either local or global. The two dimensions of status define the two components of a generalized constant...

Decentralized matching markets on the internet allow large numbers of agents to interact anonymously at virtually no cost. Very little information is available to market participants and trade takes place at many different prices simultaneously. We propose a decentralized, completely uncoupled...

We introduce a novel approach to studying behavior in repeated games - one that is based on the psychology of play. Our approach is based on the following six "aspects" of a player's behavior: round-1 cooperation, lenience, forgiveness, loyalty, leadership, and following. Using a laboratory...