A classification of weakly acyclic games
| Authors |
|
|---|---|
| Publication date | 2012 |
| Host editors |
|
| Book title | Algorithmic Game Theory |
| Book subtitle | 5th international symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012: proceedings |
| ISBN |
|
| ISBN (electronic) |
|
| Series | Lecture Notes in Computer Science |
| Event | Algorithmic game theory: 5th international symposium, SAGT 2012 |
| Pages (from-to) | 1-12 |
| Publisher | Heidelberg: Springer |
| Organisations |
|
| Abstract | Weakly acyclic games form a natural generalization of the class of games that have the finite improvement property (FIP). In such games one stipulates that from any initial joint strategy some finite improvement path exists. We classify weakly acyclic games using the concept of a scheduler recently introduced in [1]. |
| Document type | Conference contribution |
| Language | English |
| Published at |
https://doi.org/10.1007/978-3-642-33996-7_1
(Final published version)
|
| Permalink to this page | |