Name
Title | ||
|---|---|---|
Acyclic, or totally tight, two-person game forms: Characterization and main properties |
Abstract | ||
|---|---|---|
It is known that a two-person game form g is Nash-solvable if and only if it is tight. We strengthen the concept of tightness as follows: a game form is called totally tight if each of its 2x2 subforms is tight. (It is easy to show that in this case all, not only 2x2, subforms are tight.) We characterize totally tight game forms, and derive from this characterization that they are tight, Nash-solvable, dominance-solvable, acyclic, and assignable. In particular, total tightness and acyclicity are equivalent properties of two-person game forms. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.disc.2009.11.009 | Discrete Mathematics |
Keywords | Field | DocType |
improvement cycle,dominance-solvable,game form,effectivity function,acyclic,assignable,tight,totally tight,game,nash-solvable | Discrete mathematics,Combinatorics,If and only if,Mathematics | Journal |
Volume | Issue | ISSN |
310 | 6-7 | Discrete Mathematics |
Citations | PageRank | References |
7 | 0.73 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Endre Boros | 1 | 1779 | 155.63 |
| Vladimir Gurvich | 2 | 688 | 68.89 |
| Kazuhisa Makino | 3 | 1088 | 102.74 |
| Dávid Papp | 4 | 53 | 9.21 |