SCIENCE@home

Computing Bayes-Nash Equilibria through Support Enumeration Methods in Bayesian Two-Player Strategic-Form Games

S. Ceppi,N. Gatti,Nicola Basilico

Published 2009 in 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology

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.

PUBLICATION RECORD

  • Publication year

    2009

  • Venue

    2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology

  • Publication date

    2009-09-15

  • Fields of study

    Mathematics, Computer Science

  • Identifiers
    DOI 10.1109/WI-IAT.2009.209
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-22 of 22 references · Page 1 of 1

CITED BY

Showing 1-18 of 18 citing papers · Page 1 of 1