This paper considers a matchmaker game in the Shapley-Shubik(1971) (one-to-one) assignment problem. Each …rm proposes how muchit is willing to pay each worker if they are matched. Each worker alsoproposes which salary she is willing to accept from each …rm if they arematched. The matchmaker...

This article provides an exact non-cooperative foundation of the sequential Raiffa solution for two person bargaining games. Based on an approximate foundation due to Myerson (1997) for any two-person bargaining game (S,d) an extensive form game G(S,d) is defined that has an infinity of weakly...

We consider the problem where agents bargain over their shares of a perfectly divisible commodity. The aim of this paper is to identify the class of bargaining solutions induced by dominant strategy implementable allocation rules. To this end, we characterize the class of dominant strategy...

We consider a standard coalitional bargaining game where once a coalition forms it exits as in Okada (2011), however, instead of alternating offers, we have simultaneous payoff demands. We focus in the producer game he studies. Each player is chosen with equal probability. If that is the case,...

We provide a new interpretation of the Nash solution, using fictitious play. We show that the Nash demand game has the fictitious play property almost everywhere, and present two initial demand games which exactly and approximately implement the Nash solution. Thanks to the exact implementation...

This article provides an exact non-cooperative foundation of the sequential Raiffa solution for two person bargaining games. Based on an approximate foundation due to Myerson (1997) for any two-person bargaining game (S,d) an extensive form game G^S^d is defined that has an infinity of weakly...

We consider a standard coalitional bargaining game where once a coalition forms it exits as in Okada (2011), however, instead of alternating offers, we have simultaneous payoff demands. We focus in the producer game he studies. Each player is chosen with equal probability. If that is the case,...

This paper is a survey of the work in the Nash program for coalitional games, a research agenda proposed by Nash (1953) to bridge the gap between the non-cooperative and cooperative approaches to game theory

The Nash program is an important research agenda initiated in Nash (1953) in order to bridge the gap between the noncooperative and cooperative counterparts of game theory. The program is thus turning sixty-seven years old, but I will argue it is not ready for retirement, as it is full of energy...

The Nash program is an important research agenda initiated in Nash (Econometrica 21:128-140, 1953) in order to bridge the gap between the noncooperative and cooperative counterparts of game theory. The program is thus turning sixty-seven years old, but I will argue it is not ready for...