Synthesis of equilibria in infinite-duration games on graphs
| Autor: | Véronique Bruyère |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
TheoryofComputation_MISCELLANEOUS
Microbiology (medical) Discrete mathematics Computer Science::Computer Science and Game Theory Immunology ComputingMilieux_PERSONALCOMPUTING TheoryofComputation_GENERAL 0102 computer and information sciences 02 engineering and technology 01 natural sciences 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Immunology and Allergy 020201 artificial intelligence & image processing GRAP Duration (project management) Game theory Mathematics |
| Zdroj: | ACM SIGLOG News. 8:4-29 |
| ISSN: | 2372-3491 |
| DOI: | 10.1145/3467001.3467003 |
| Popis: | In this survey, we propose a comprehensive introduction to game theory applied to computer-aided synthesis. We study multi-player turn-based infinite-duration games played on a finite directed graph such that each player aims at maximizing a payoff function. We present the well-known notions of Nash equilibrium and subgame perfect equilibrium, as well as interesting strategy profiles of players as response to the strategy announced by a specific player. We provide classical and recent results about the related threshold synthesis problem. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|