Skip to main content Accessibility help
×
Home

On the hardness of game equivalence under local isomorphism

  • Joaquim Gabarró (a1), Alina García (a1) and Maria Serna (a1)

Abstract

We introduce a type of isomorphism among strategic games that we call local isomorphism. Local isomorphisms is a weaker version of the notions of strong and weak game isomorphism introduced in [J. Gabarro, A. Garcia and M. Serna, Theor. Comput. Sci. 412 (2011) 6675–6695]. In a local isomorphism it is required to preserve, for any player, the player’s preferences on the sets of strategy profiles that differ only in the action selected by this player. We show that the game isomorphism problem for local isomorphism is equivalent to the same problem for strong or weak isomorphism for strategic games given in: general, extensive and formula general form. As a consequence of the results in [J. Gabarro, A. Garcia and M. Serna, Theor. Comput. Sci. 412 (2011) 6675–6695] this implies that local isomorphism problem for strategic games is equivalent to (a) the circuit isomorphism problem for games given in general form, (b) the boolean formula isomorphism problem for formula games in general form, and (c) the graph isomorphism problem for games given in explicit form.

Copyright

References

Hide All
[1] Agrawal, M. and Thierauf, T., The formula isomorphism problem. SIAM J. Comput. 30 (2000) 9901009.
[2] Àlvarez, C., Gabarro, J. and Serna, M., Equilibria problems on games : Complexity versus succinctness. J. Comput. Syst. Sci. 77 (2011) 11721197.
[3] Bergemann, D. and Morris, S., Robust implementation in general mechanisms. Games Econ. Behav. 71 (2011) 261281.
[4] E. Bonzon, M.-C. Lagasquie-Schiex, J. Lang and B. Zanuttini, Boolean games revisited, in ECAI 2006, 17th European Conference on Artificial Intelligence (2006) 265–269.
[5] Borchet, B., Ranjan, D. and Stephan, F., On the computational complexity of some classical equivalence relations on boolean functions. Theory Comput. Syst. 31 (1998) 679693.
[6] Borm, P., A classification of 2 × 2 bimatrix games. Cahiers du C.E.R.O 29 (1987) 6984.
[7] Gabarro, J., Garcia, A. and Serna, M., On the complexity of game isomorphism, in Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007. Lect. Notes Comput. Sci. 4708 (2007) 559571.
[8] Gabarro, J., Garcia, A. and Serna, M., The complexity of game isomorphism. Theor. Comput. Sci. 412 (2011) 66756695.
[9] A. Garcia, The Complexity of Angel-Daemons and Game Isomorphism. Ph.D. thesis, Universitat Politècnica de Catalunya (Barcelona Tech) (2012).
[10] Germano, F., On some geometry and equivalence classes of normal form games. Inter. J. Game Theory 4 (2006) 561581.
[11] Kilgour, D. and Fraser, N., A taxonomy of all ordinal 2 × 2 games. Theory Decis. 24 (1988) 99117.
[12] J. Kobler, U. Schoning and J. Torán, The Graph Isomorphism Problem : Its Structural Complexity. Birkhauser (1993).
[13] Mavronicolas, M., Monien, B. and Wagner, K.W., Weighted boolean formula games, in Internet and Network Economics, Third International Workshop, WINE 2007. Lect. Notes Comput. Sci. 4858 (2007) 469481.
[14] J. Nash, Non-Cooperative Games, in Classics in Game Theory (1997) 14–26.
[15] M.J. Osborne, An Introduction to Game Theory. Oxford University Press (2003).
[16] M.J. Osborne and A. Rubinstein, A Course in Game Theory. MIT Press (1994).
[17] G. Schoenebeck and S.P. Vadhan, The computational complexity of Nash equilibria in concisely represented games, in ACM Conf. Electr. Commer. (2006) 270–279.
[18] Siorpaes, K. and Hepp, M., Ontogame : Weaving the semantic web by online games, in ESWC-2008. Lect. Notes Comput. Sci. 5021 (2008) 751766.
[19] Siorpaes, K. and Hepp, M., Games with purpose for the semantic web. IEEE Intell. Syst. 23 (2008) 5060.
[20] von Ahn, L., Games with a purpose. Comput. 39 (2006) 9294.
[21] Voorneveld, M., Best-response potential games. Econ. Lett. 66 (2000) 289295.
[22] J. Williams, The Complet Strategyst. Dover (1986).

Keywords

Related content

Powered by UNSILO

On the hardness of game equivalence under local isomorphism

  • Joaquim Gabarró (a1), Alina García (a1) and Maria Serna (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.