Farsighted Rationality in Hedonic Games
G.-Herman Demeze-Jouatsa () and
Dominik Karos ()
Additional contact information
G.-Herman Demeze-Jouatsa: Bielefeld University
Dominik Karos: Bielefeld University
Dynamic Games and Applications, 2023, vol. 13, issue 2, No 3, 462-479
Abstract:
Abstract 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.
Keywords: Abstract games; Hedonic games; Farsighted stability; Coalition stable equilibrium (search for similar items in EconPapers)
JEL-codes: C71 C72 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s13235-022-00474-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:dyngam:v:13:y:2023:i:2:d:10.1007_s13235-022-00474-8
Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/13235
DOI: 10.1007/s13235-022-00474-8
Access Statistics for this article
Dynamic Games and Applications is currently edited by Georges Zaccour
More articles in Dynamic Games and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().