We consider a hedonic coalition formation game in which a coalition chooses for each partition of the player set the probability with which it forms and thereby destroys the current partition. These probabilities are commonly known so that farsighted players know at every partition what future partitions, and hence payoffs, will be reached with what probability. Thus, players can make rational decisions about the moves they support. We show that if coalitions make mistakes with small but positive probability, then there is a behavior profile in which no coalition has a profitable one-shot deviation.
This paper analyzes the set of pure strategy subgame perfect Nash equilibria of any finitely repeated game with complete information and perfect monitoring. The main result is a complete characterization of the limit set, as the time horizon increases, of the set of pure strategy subgame perfect Nash equilibrium payoff vectors of the finitely repeated game. This model includes the special case of observable mixed strategies.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.