Loading...
Please wait, while we are loading the content...
Similar Documents
Computing Bayes-Nash Equilibria through Support Enumeration Methods in Bayesian Two-Player Strategic-form Games
| Content Provider | CiteSeerX |
|---|---|
| Author | Ceppi, Sofia Gatti, Nicola Basilico, Nicola |
| Abstract | The computation of equilibria in games is a challenging task. The literature studies the problem of finding Nash equilibria with complete-information games in depth, but not enough attention is paid to searching for equilibria in Bayesian games. Customarily, these games are reduced to complete-information games and standard algorithms for computing Nash equilibria are employed. However, no work studied how these algorithms perform with Bayesian games. In this paper we focus on two-player strategic-form games. We show that the most efficient algorithm for computing Nash equilibria with GAMUT data (i.e., Porter-Nudelman-Shoham) is inefficient with Bayesian games, we provide an extension, and we experimentally evaluate its performance. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Nash Equilibrium Bayesian Two-player Support Enumeration Method Bayes-nash Equilibrium Bayesian Game Complete-information Game Bayes-nash Equilib-rium Standard Algorithm Efficient Algorithm Literature Study Chal-lenging Task Enumeration Algorithm Enough Attention Index Term Algorithmic Game Theory Gamut Data Two-player Strategic-form Game |
| Content Type | Text |
| Resource Type | Article |
