Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2505.13827 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909910012264448 |
|---|---|
| author | Hou, Yuqing Cao, Yiyin Dang, Chuangyin Wang, Yong |
| author_facet | Hou, Yuqing Cao, Yiyin Dang, Chuangyin Wang, Yong |
| contents | The sequence form, owing to its compact and holistic strategy representation, has demonstrated significant efficiency in computing normal-form perfect equilibria for two-player extensive-form games with perfect recall. Nevertheless, the examination of $n$-player games remains underexplored. To tackle this challenge, we present a sequence-form characterization of normal-form perfect equilibria for $n$-player extensive-form games, achieved through a class of perturbed games formulated in sequence form. Based on this characterization, we develop a differentiable path-following method for computing normal-form perfect equilibria and prove its convergence. This method formulates an artificial logarithmic-barrier game in sequence form, introducing an additional variable to regulate the impact of logarithmic-barrier terms on the payoff functions, as well as the transition of the strategy space. We prove the existence of a smooth equilibrium path defined by the artificial game, starting from an arbitrary positive realization plan and converging to a normal-form perfect equilibrium of the original game as the additional variable approaches zero. Furthermore, we extend Harsanyi's linear and logarithmic tracing procedures to the sequence form and develop two alternative methods for computing normal-form perfect equilibria. Numerical experiments further substantiate the effectiveness and computational efficiency of our methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_13827 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Sequence-Form Characterization and Differentiable Path-Following Method for Computing Normal-Form Perfect Equilibria in Extensive-Form Games Hou, Yuqing Cao, Yiyin Dang, Chuangyin Wang, Yong Computer Science and Game Theory The sequence form, owing to its compact and holistic strategy representation, has demonstrated significant efficiency in computing normal-form perfect equilibria for two-player extensive-form games with perfect recall. Nevertheless, the examination of $n$-player games remains underexplored. To tackle this challenge, we present a sequence-form characterization of normal-form perfect equilibria for $n$-player extensive-form games, achieved through a class of perturbed games formulated in sequence form. Based on this characterization, we develop a differentiable path-following method for computing normal-form perfect equilibria and prove its convergence. This method formulates an artificial logarithmic-barrier game in sequence form, introducing an additional variable to regulate the impact of logarithmic-barrier terms on the payoff functions, as well as the transition of the strategy space. We prove the existence of a smooth equilibrium path defined by the artificial game, starting from an arbitrary positive realization plan and converging to a normal-form perfect equilibrium of the original game as the additional variable approaches zero. Furthermore, we extend Harsanyi's linear and logarithmic tracing procedures to the sequence form and develop two alternative methods for computing normal-form perfect equilibria. Numerical experiments further substantiate the effectiveness and computational efficiency of our methods. |
| title | A Sequence-Form Characterization and Differentiable Path-Following Method for Computing Normal-Form Perfect Equilibria in Extensive-Form Games |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2505.13827 |