Abstract
AbstractWe 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.
Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Computer Graphics and Computer-Aided Design,Computer Science Applications,Statistics and Probability,Economics and Econometrics
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献