Computing Bayes-Nash equilibria through support enumeration methods in Bayesian two-player strategic-form games

Proceedings - 2009 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2009

Volumn 2, Issue , 2009, Pages 541-548

  Ceppi, Sofia ^a   Gatti, Nicola ^a   Basilico, Nicola ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

Algorithmic game theory; Bayes Nash equilibrium; Enumeration algorithm

Indexed keywords

ALGORITHMIC GAME THEORY; BAYES-NASH EQUILIBRIUM; BAYESIAN GAME; EFFICIENT ALGORITHM; ENUMERATION ALGORITHMS; ENUMERATION METHOD; NASH EQUILIBRIA; STANDARD ALGORITHMS;

GAME THEORY; INTELLIGENT AGENTS;

ALGORITHMS;

EID: 78649841778     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WI-IAT.2009.209     Document Type: Conference Paper

References (22)

1. D. Fudemberg and J. Tirole, Game Theory. The MIT Press, 1991.
2. Y. Shoham and K. Leyton-Brown, Multiagent Systems: Algorithmic, Game Theoretic and Logical Foundations. Cambridge, USA: Cambridge University Press, 2008.
3. J. Harsanyi, "Games with incomplete information played by Bayesian players, parts I, II, and III," Management Science, vol. 14, pp. 159-182, 320-334, 486-502, 1967-1968.
4. F. Di Giunta and N. Gatti, "Alternating-offers bargaining under one-sided uncertainty on deadlines," in Proceedings of the European Conference on Artificial Intelligence (ECAI), Riva del Garda, Italy, August 28 - September 1 2006, pp. 225-229.
5. N. Gatti, F. Di Giunta, and S. Marino, "Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm," Artificial Intelligence, vol. 172, no. 8-9, pp. 1119-1157, 2008.
6. N. Basilico, N. Gatti, and F. Amigoni, "Leader-follower strategies for robotic patrolling in environments with arbitrary topologies," in Proceedings of the International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Budapest, Hungary, May 10-15 2009, pp. 57-64.
7. T. Sandholm, A. Gilpin, and V. Conitzer, "Mixed-integer programming methods for finding Nash equilibria," in Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), Pittsburgh, USA, July 9-13 2005, pp. 495-501.
8. A. MCLennan and J. Berg, "The asymptotic expected number of Nash equilibria of two player normal form games," Games and Economic Behavior, vol. 51, no. 2, pp. 264-295, 2005.
9. C. Lemke and J. Howson, "Equilibrium points of bimatrix games," SIAM Journal of Applied Mathematics, vol. 12, no. 2, pp. 413-423, 1964.
10. R. Porter, E. Nudelman, and Y. Shoham, "Simple search methods for finding a Nash equilibrium," in Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2004, pp. 664-669.
11. ILOG, CPLEX 10.0 user's manual, http://www.ilog.com/products/cplex/.
12. D. Koller, N. Megiddo, and B. von Stengel, "Efficient computation of equilibria for extensive two-person games," Games and Economic Behavior, vol. 14, no. 2, pp. 220-246, 1996.
13. E. Nudelman, J. Wortman, K. Leyton-Brown, and Y. Shoham, "Run the GAMUT: A comprehensive approach to evaluating game-theoretic algorithms," in Proceedings of the International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), New York, USA, July 19-23 2004, pp. 880-887.
14. M. Ferris and T. Munson, "Interfaces to PATH 3.0: Design, implementation and usage," Computational Optimization and Applications, vol. 12, no. 1-3, pp. 207-227, 1999.
15. R. Fourer, D. Gay, and B. Kernighan, "A modeling language for mathematical programming," Management Science, vol. 36, no. 5, pp. 519-554, 1990.
16. N. Gatti, "Game theoretical insights in strategic patrolling: Model and algorithm in normal-form," in Proceedings of the European Conference on Artificial Intelligence (ECAI), Patras, Greece, July 21-25 2008, pp. 403-407.
17. C. Lemke, "Some pivot schemes for the linear complementarity problem," Mathematical Programming Study, vol. 7, pp. 15-35, 1978.
18. N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, Algorithmic Game Theory. Cambridge, USA: Cambridge University Press, 2007.
19. V. Conitzer and T. Sandholm, "Complexity of (iterated) dominance," in Proceedings of the ACM Conference on Electronic Commerce (EC), Vancouver, Canada, June 5-8 2005, pp. 88-97.
20. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations. New York, USA: John Wiley & Sons, 1990.
21. J. Lenstra, Sequencing by Enumerative Methods. The Netherlands: Mathematisch Centrum, Amsterdam, 1977.
22. H. Hoos and T. Stutzle, Stochastic Local Search: Foundations & Applications. San Francisco, USA: Morgan Kaufmann, 2004.