Abstract | ||
---|---|---|
We study restricted improvement cycles (ri-cycles) in finite positional n -person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We obtain criteria of restricted improvement acyclicity (ri-acyclicity) in two cases: for n = 2 and for acyclic digraphs. We provide several examples that outline the limits of these criteria and show that, essentially, there are no other ri-acyclic cases. We also discuss connections between ri-acyclicity and some open problems related to Nash-solvability. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1016/j.dam.2010.02.006 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
finite positional n,nash equilibrium,restricted acyclicity,open problem,nash-solvability,restricted improvement cycle,restricted improvement acyclicity,acyclic digraph,perfect information,positional game,di-cycles form,improvement cycle,finite positional n-person game,game form,person game,acyclic di-graphs,ri-acyclic case | Journal | 158 |
Issue | ISSN | Citations |
10 | 0302-9743 | 9 |
PageRank | References | Authors |
0.96 | 6 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Daniel Andersson | 1 | 9 | 0.96 |
Vladimir Gurvich | 2 | 688 | 68.89 |
Thomas Dueholm Hansen | 3 | 161 | 13.77 |