2010
DOI: 10.1007/978-3-642-16170-4_5
|View full text |Cite
|
Sign up to set email alerts
|

Partition Equilibrium Always Exists in Resource Selection Games

Abstract: We consider the existence of Partition Equilibrium in Resource Selection Games. Super-strong equilibrium, where no subset of players has an incentive to change their strategies collectively, does not always exist in such games. We show, however, that partition equilibrium (introduced in [4] to model coalitions arising in a social context) always exists in general resource selection games, as well as how to compute it efficiently. In a partition equilibrium, the set of players has a fixed partition into coaliti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
23
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(23 citation statements)
references
References 13 publications
0
23
0
Order By: Relevance
“…Also, in singleton congestion games an outcome that satisfies axiom A1 always exists, since it is a subclass of congestion games, for which the existence of a Nash equilibrium is guaranteed [11]. In RSGs with increasing cost functions, there always exists an outcome that satisfies axioms A1 and A3 [1]. 3 However, as mentioned earlier, there does not always exist an outcome that also satisfies axiom A2 [4].…”
Section: Related Workmentioning
confidence: 94%
“…Also, in singleton congestion games an outcome that satisfies axiom A1 always exists, since it is a subclass of congestion games, for which the existence of a Nash equilibrium is guaranteed [11]. In RSGs with increasing cost functions, there always exists an outcome that satisfies axioms A1 and A3 [1]. 3 However, as mentioned earlier, there does not always exist an outcome that also satisfies axiom A2 [4].…”
Section: Related Workmentioning
confidence: 94%
“…For studies on the computation of a Nash equilibrium, see Caragiannis et al (2011), Chien andSinclair (2011), andHarks andTimmermans (2017). For other studies on congestion games and its special instances, see Feldman and Tennenholtz (2010), Anshelevich et al (2013), and Caskurlu et al (2020a, 2020b, 2021.…”
Section: Related Literaturementioning
confidence: 99%
“…Our results in RSGs and their relation to the results in the literature are as follows: Feldman and Tennenholtz [5] showed that a partition equilibrium always exists in RSGs under the following restrictions: (i) if the size of a viable coalition is bounded by 2; or (ii) if there are only two resources; or (iii) if the resources are identical. Anshelevich et al [1] generalized this result by proving a strategy profile that is both a partition equilibrium and a Nash equilibrium is guaranteed to exist in general RSGs. Our findings are as follows:…”
Section: Introductionmentioning
confidence: 98%
“…First of all, a super strong equilibrium rarely exists in a game. Therefore, restrictions on coalition formation may be helpful to obtain existence results 1 . This is the very same idea behind the well-known Nash equilibrium [16] solution concept where only singletons are viable coalitions.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation