2006
DOI: 10.1016/j.na.2005.06.043
|View full text |Cite
|
Sign up to set email alerts
|

Fixed point theorems and their applications to theory of Nash equilibria

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0
2

Year Published

2007
2007
2017
2017

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 26 publications
(17 citation statements)
references
References 12 publications
0
15
0
2
Order By: Relevance
“…In fact, the set is a σ -complete lattice, which means that only countable subsets of F (see Example 2.1 in Heikkilä and Reffett 2006). Therefore, the set is a countable chain complete.…”
Section: Remarkmentioning
confidence: 99%
“…In fact, the set is a σ -complete lattice, which means that only countable subsets of F (see Example 2.1 in Heikkilä and Reffett 2006). Therefore, the set is a countable chain complete.…”
Section: Remarkmentioning
confidence: 99%
“…In Smithson (1971), Heikkilä and Reffett (2006), and Veinott (1992), various set relations for ascending correspondences have been proposed. For example, for Y * = 2 Y \∅, and A, B ∈ 2 Y \∅, we say B ↑ A in the weak upward set relation (respectively, weak downward set relation denoted by ↓ ) if for all x 1 ∈ A, there exists x 2 ∈ B such that x 1 ≤ x 2 (respectively, if for all x 2 ∈ B, there exists x 1 ∈ A such that x 1 ≤ x 2 ).…”
Section: Useful Mathematical Terminologymentioning
confidence: 99%
“…In [9] existence and comparison results are derived for games Γ with arbitrary nonempty set I of players, and when the strategy set of player i depends on the strategy vector s −i of other players and the utility functions are vector-valued.…”
Section: Special Casesmentioning
confidence: 99%