Sparse Games Are Hard

  • Xi Chen
  • Xiaotie Deng
  • Shang-Hua Teng
Conference paper

DOI: 10.1007/11944874_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4286)
Cite this paper as:
Chen X., Deng X., Teng SH. (2006) Sparse Games Are Hard. In: Spirakis P., Mavronicolas M., Kontogiannis S. (eds) Internet and Network Economics. WINE 2006. Lecture Notes in Computer Science, vol 4286. Springer, Berlin, Heidelberg

Abstract

A two-player game is sparse if most of its payoff entries are zeros. We show that the problem of computing a Nash equilibrium remains PPAD-hard to approximate in fully polynomial time for sparse games. On the algorithmic side, we give a simple and polynomial-time algorithm for finding exact Nash equilibria in a class of sparse win-lose games.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xi Chen
    • 1
  • Xiaotie Deng
    • 2
  • Shang-Hua Teng
    • 3
  1. 1.Department of Computer ScienceTsinghua UniversityBeijing
  2. 2.Department of Computer ScienceCity University of Hong KongHong Kong
  3. 3.Department of Computer ScienceBoston UniversityBoston

Personalised recommendations