Showing 1 - 10 of 98
In this paper we study the number of pure strategy Nash equilibria in large finite n-player games. A distinguishing feature of our study is that we allow general - potentially multivalued - best reply correspondences. Given the number K of pure strategies to each player, we assign to each player...
Persistent link: https://www.econbiz.de/10011147729
We apply the von Neumann-Morgenstern stable set to the n-player cake division problem. Only time-preferences á la Rubinstein (1982) are assumed. The stable set is defined with respect to the following dominance relation: x dominates y if there is a player who prefers x over y even with one...
Persistent link: https://www.econbiz.de/10005579650
Persistent link: https://www.econbiz.de/10005153541
We provide a simple characterization of the stationary subgame perfect equilibrium of an alternating offers bargaining game when the number of players increases without a limit. Core convergence literature is emulated by increasing the number of players by replication. The limit allocation is...
Persistent link: https://www.econbiz.de/10005158961
Persistent link: https://www.econbiz.de/10008673954
Persistent link: https://www.econbiz.de/10007880673
Persistent link: https://www.econbiz.de/10008143048
Persistent link: https://www.econbiz.de/10008897536
Persistent link: https://www.econbiz.de/10008641035
Mechanism design or implementation theory, which studies the design of institutions or mechanisms implementing collective decisions under different circumstances, has been a major research area in the last three decades. hannu Vartiainen's doctoral dissertation analyzes several issues in this...
Persistent link: https://www.econbiz.de/10005474882