Abstract / Description of output
A compact representation for non-transferable utility games founding on answer set programming is proposed. The representation is fully expressive, in that it can capture all games defined over a finite set of alternatives. Moreover, due to the knowledge representation capabilities of answer set programs, it can easily accommodate the definition of games within a wide range of application domains, ranging from scheduling, to routing and planning, just to name a few. The computational complexity of the proposed framework is studied, in particular, by focusing on the core as the prototypical solution concept. A system supporting the basic reasoning tasks arising therein is also made available, and results of experimental activity are discussed.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016 |
| Publisher | IJCAI Inc |
| Pages | 38-45 |
| Number of pages | 8 |
| ISBN (Print) | 978-1-57735-770-4 |
| Publication status | Published - 15 Jul 2016 |
| Event | Twenty-Fifth International Joint Conference on Artificial Intelligence - New York City, United States Duration: 9 Jul 2016 → 15 Jul 2016 http://ijcai-16.org/ |
Conference
| Conference | Twenty-Fifth International Joint Conference on Artificial Intelligence |
|---|---|
| Abbreviated title | IJCAI 2016 |
| Country/Territory | United States |
| City | New York City |
| Period | 9/07/16 → 15/07/16 |
| Internet address |