We propose and experimentally test a mechanism for a class of principal-agent problems in which agents can observe each others' efforts. In this mechanism each player costlessly assigns a share of the pie to each of the other players, after observing their contributions, and the final...

In this paper, we analyze sequential bankruptcy problems, which generalize bankruptcy problems. They contain the problems of sharing water in a trans-boundary river and of allocating expedition rewards in projects. We provide three mechanisms for generalizing rules for bankruptcy problems to...

Communication has been regarded as one of the most effective devices in promoting team cooperation. But asymmetric communication sometimes breeds collusion and is detrimental to team efficiency. Here, we present experimental evidence showing that excluding one member from team communication...

In the Ultimatum Game (UG) one player, named “proposer”, has to decide how to allocate a certain amount of money between herself and a “responder”. If the offer is greater than or equal to the responder’s minimum acceptable offer (MAO), then the money is split as proposed, otherwise,...

This is the third part of a comprehensive essay on the Rawlsian view of corporate social responsibility (CSR) seen a multi-stakeholder fiduciary model of corporate governance (see part I). A game theoretical model of the interplay between the owner (who controls the firm) and all the remaining...

In the current FIFA penalty shootout mechanism, a coin toss decides which team will kick first. Empirical evidence suggests that the team taking the first kick has a higher probability to win a shootout. We design sequentially fair shootout mechanisms such that in all symmetric Markov-perfect...

We study decentralized task coordination. Tasks are of varying complexity and agents asymmetric: agents capable of completing high-level tasks may also take on tasks originally contracted by lower-level agents, facilitating system-wide cost reductions. We suggest a family of decentralized...

We run laboratory experiments where subjects are matched to colleges, and colleges are not strategic agents. We test the Gale-Shapley Deferred Acceptance (DA) mechanism versus the Iterative Deferred Acceptance Mechanism (IDAM), a matching mechanism based on a new family of procedures being used...

We introduce a new mechanism for matching students to schools or universities, denoted Iterative Deferred Acceptance Mechanism (IDAM), inspired by procedures currently being used to match millions of students to public universities in Brazil and China. Unlike most options available in the...

We show that Ergin & Sönmez's (2006) results which show that for schools it is a dominant strategy to truthfully rank the students under the Boston mechanism, and that the Nash equilibrium outcomes in undominated strategies of the induced game are stable, rely crucially on two assumptions....