Nash Equilibria in Symmetric Games with Partial Observation
| Autor: | Nicolas Markey, Steen Vester, Patricia Bouyer |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
TheoryofComputation_MISCELLANEOUS
FOS: Computer and information sciences Computer Science - Logic in Computer Science Computer Science::Computer Science and Game Theory Computer science Computation 0102 computer and information sciences 02 engineering and technology D2.4 01 natural sciences lcsh:QA75.5-76.95 symbols.namesake Computer Science - Computer Science and Game Theory 0202 electrical engineering electronic engineering information engineering lcsh:Mathematics ComputingMilieux_PERSONALCOMPUTING TheoryofComputation_GENERAL lcsh:QA1-939 Logic in Computer Science (cs.LO) 010201 computation theory & mathematics Nash equilibrium symbols 020201 artificial intelligence & image processing lcsh:Electronic computers. Computer science Symmetry (geometry) Mathematical economics Computer Science and Game Theory (cs.GT) |
| Zdroj: | Electronic Proceedings in Theoretical Computer Science Electronic Proceedings in Theoretical Computer Science, Vol 146, Iss Proc. SR 2014, Pp 49-55 (2014) SR |
| DOI: | 10.48550/arxiv.1404.0839 |
| Popis: | We investigate a model for representing large multiplayer games, which satisfy strong symmetry properties. This model is made of multiple copies of an arena; each player plays in his own arena, and can partially observe what the other players do. Therefore, this game has partial information and symmetry constraints, which make the computation of Nash equilibria difficult. We show several undecidability results, and for bounded-memory strategies, we precisely characterize the complexity of computing pure Nash equilibria (for qualitative objectives) in this game model. Comment: In Proceedings SR 2014, arXiv:1404.0414 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|