Zobrazeno 1 - 10
of 6 123
pro vyhledávání: '"Extensive form games"'
Autor:
Pahl, Lucas, Pimienta, Carlos
We prove the 2-player, generic extensive-form case of the conjecture of Govindan and Wilson (1997a,b) and Hauk and Hurkens (2002) stating that an equilibrium component is essential in every equivalent game if and only if the index of the component is
Externí odkaz:
http://arxiv.org/abs/2412.18449
Autor:
Berker, Ratip Emin, Tewolde, Emanuel, Anagnostides, Ioannis, Sandholm, Tuomas, Conitzer, Vincent
Imperfect-recall games, in which players may forget previously acquired information, have found many practical applications, ranging from game abstractions to team games and testing AI agents. In this paper, we quantify the utility gain by endowing a
Externí odkaz:
http://arxiv.org/abs/2412.19659
Autor:
Tang, Xiaohang, Wang, Chiyuan, Ma, Chengdong, Bogunovic, Ilija, McAleer, Stephen, Yang, Yaodong
Extensive-Form Game (EFG) represents a fundamental model for analyzing sequential interactions among multiple agents and the primary challenge to solve it lies in mitigating sample complexity. Existing research indicated that Double Oracle (DO) can r
Externí odkaz:
http://arxiv.org/abs/2411.00954
First-order methods (FOMs) are arguably the most scalable algorithms for equilibrium computation in large extensive-form games. To operationalize these methods, a distance-generating function, acting as a regularizer for the strategy space, must be c
Externí odkaz:
http://arxiv.org/abs/2410.23398
Autor:
Li, Shuxin, Yang, Chang, Zhang, Youzhi, Li, Pengdeng, Wang, Xinrun, Huang, Xiao, Chan, Hau, An, Bo
Nash equilibrium (NE) is a widely adopted solution concept in game theory due to its stability property. However, we observe that the NE strategy might not always yield the best results, especially against opponents who do not adhere to NE strategies
Externí odkaz:
http://arxiv.org/abs/2408.05575
LiteEFG is an efficient library with easy-to-use Python bindings, which can solve multiplayer extensive-form games (EFGs). LiteEFG enables the user to express computation graphs in Python to define updates on the game tree structure. The graph is the
Externí odkaz:
http://arxiv.org/abs/2407.20351
Autor:
Daskalakis, Constantinos, Farina, Gabriele, Golowich, Noah, Sandholm, Tuomas, Zhang, Brian Hu
Recent simultaneous works by Peng and Rubinstein [2024] and Dagan et al. [2024] have demonstrated the existence of a no-swap-regret learning algorithm that can reach $\epsilon$ average swap regret against an adversary in any extensive-form game withi
Externí odkaz:
http://arxiv.org/abs/2406.13116
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.