On the Complexity of Equilibria Problems in Angel-Daemon Games

  • Joaquim Gabarro
  • Alina García
  • Maria Serna
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5092)

Abstract

We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or grid orchestration on a faulty environment with bounded amount of failures [6]. It turns out that Angel-Daemon games are, at the best of our knowledge, the first natural example of zero-sum succinct games in the sense of [1],[9]. We show that deciding the existence of a pure Nash equilibrium or a dominant strategy for a given player is \(\mathsf{\Sigma}^p_2\)-complete. Furthermore, computing the value of an Angel-Daemon game is EXP-complete. Thus, matching the already known complexity results of the corresponding problems for the generic families of succinctly represented games with exponential number of actions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Àlvarez, C., Gabarro, J., Serna, M.: Pure Nash Equilibria in Games with a Large Number of Actions. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 95–106. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Àlvarez, C., Gabarro, J., Serna, M.: Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 634–643. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Balcazar, J.L., Díaz, J., Gabarro, J.: Structural Complexity I. 2nd edn. Springer, Heidelberg (1995)Google Scholar
  4. 4.
    Bougé, L.: Le mòdele de programmation à parallélisme de donés: une perspective sémantique. Techniques et science informatiques 12(5), 541–562 (1993)MATHGoogle Scholar
  5. 5.
    Eliaz, K.: Fault Tolerant Implementation. Review of Economic Studies 69(3), 589–610 (2002)CrossRefMathSciNetMATHGoogle Scholar
  6. 6.
    Gabarro, J., García, A., Clint, M., Kilpatrick, P., Stewart, A.: Bounded Site Failures: an Approach to Unreliable Grid Environments. In: Danelutto, M., Frangopoulou, P., Getov, V. (eds.) Making Grids Work. Springer, Heidelberg (to appear, 2008)Google Scholar
  7. 7.
    Gabarro, J., García, A., Serna, M., Stewart, A., Kilpatrick, P.: Analysing Orchestrations with Risk Profiles and Angel-Daemon Games. In: CoreGRID Integration Workshop (April 2–4, 2008)Google Scholar
  8. 8.
    Feigenbaum, J., Koller, D., Shor, P.: A Game-Theoretic Classification of Interactive Complexity Classes. In: Proc. of the 10th Annual IEEE Conference on Structure in Complexity Theory, pp. 227–237 (1995)Google Scholar
  9. 9.
    Fortnow, L., Impagliazzo, R., Kabanets, V., Umans, C.: On the Complexity of Succinct Zero-Sum Games. In: Proc. of the 20th Annual IEEE Conference on Computational Complexity, pp. 323–332 (2005)Google Scholar
  10. 10.
    Gottlob, G., Greco, G., Scarcello, F.: Pure Nash Equilibria: Hard and Easy Games. J. Artif. Intell. Res. 24, 357–406 (2005)MathSciNetMATHGoogle Scholar
  11. 11.
    Greenlaw, R., Hoover, J., Ruzzo, W.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, Oxford (1995)MATHGoogle Scholar
  12. 12.
    Ladner, R.: The Circuit Value Problem is Log Space Complete for P. ACM SIGACT News 7(1), 18–20 (1975)CrossRefMathSciNetGoogle Scholar
  13. 13.
    von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton (1944)Google Scholar
  14. 14.
    Misra, J., Cook, W.: Computation Orchestration: A Basis for Wide-Area Computing. Software & Systems Modeling (2006) doi:10.1007/s10270-006-0012-1Google Scholar
  15. 15.
    Misra, J.: A Programming Model for the Orchestration of Web Services. In: Proc. of SEFM 2004, pp. 28–30 (2004)Google Scholar
  16. 16.
    Moscibroda, T., Schmid, S., Wattenhofer, R.: When Selfish Meets Evil: Byzantine Players in a Virus Inoculation Game. In: Proc. of PODC 2006, pp. 35–44 (2006)Google Scholar
  17. 17.
    Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)MATHGoogle Scholar
  18. 18.
    Osborne, M., Rubinstein, A.: A Course on Game Theory. MIT Press, Cambridge (1994)Google Scholar
  19. 19.
    Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)MATHGoogle Scholar
  20. 20.
    Schoenebeck, G., Vadhan, S.: The Computational Complexity of Nash Equilibria in Concisely Represented Games. In: Proc. of the 7th ACM conference on Electronic commerce, pp. 270–279 (2006)Google Scholar
  21. 21.
    Stewart, A., Gabarro, J., Clint, M., Harmer, T., Kilpatrick, P., Perrott, R.: Managing Grid Computations: An ORC-Based Approach. In: Guo, M., Yang, L.T., Di Martino, B., Zima, H.P., Dongarra, J., Tang, F. (eds.) ISPA 2006. LNCS, vol. 4330, pp. 278–291. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  22. 22.
    Watson, J.: Strategy: An Introduction to Game Theory. W. W. Norton (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Joaquim Gabarro
    • 1
  • Alina García
    • 1
  • Maria Serna
    • 1
  1. 1.ALBCOM Research GroupUniversitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations