This article proposes a simple Nash program. Both our axiomatic characterization and our noncooperative procedure consider each distinct asymmetric and symmetric Nash solution. Our noncooperative procedure is a generalization of the simplest known sequential Nash demand game analyzed by...

Most real-life bargaining is resolved gradually. During this process parties reach intermediate agreements. These intermediate agreements serve as disagreement points in subsequent rounds. We identify robustness criteria which are satisfied by three prominent bargaining solutions, the Nash,...

Most real-life bargaining is resolved gradually. During this process parties reach intermediate agreements. These intermediate agreements serve as disagreement points in subsequent rounds. We identify robustness criteria which are satisfied by three prominent bargaining solutions, the Nash,...

This article proposes a simple Nash program. Both our axiomatic characterization and our noncooperative procedure consider each distinct asymmetric and symmetric Nash solution. Our noncooperative procedure is a generalization of the simplest known sequential Nash demand game analyzed by ...

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