research-article

Constraint satisfaction algorithms for graphical games

Authors:

Vishal Soni,

Satinder Singh,

Michael P. WellmanAuthors Info & Claims

AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems

Article No.: 67, Pages 1 - 8

https://doi.org/10.1145/1329125.1329206

Published: 14 May 2007 Publication History

Get Access

Abstract

We formulate the problem of computing equilibria in multi-player games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. The first is PureProp: an algorithm for computing approximate Nash equilibria in complete information one-shot games and approximate Bayes-Nash equilibria in one-shot games of incomplete information. PureProp unifies existing message-passing based algorithms for solving these classes of games. We also address repeated graphical games, and present a second algorithm, PureProp-R, for computing approximate Nash equilibria in these games.

References

[1]

S. Athey. Single crossing properties and the existence of pure strategy equilibria in games of incomplete information. Econometrica, 69:861--869, 2001.

Crossref

Google Scholar

[2]

R. Dechter and J. Pearl. Tree clustering schemes for constraint processing. In Seventh National Conference on Artificial Intelligence (AAAI-88), pages 37--42, 1988.

Google Scholar

[3]

M. Kearns, M. Littman, and S. Singh. Graphical models for game theory. In Proceedings of the 17th Annual Conference on Uncertainty in Artificial Intelligence (UAI-01), pages 253--260, San Francisco, CA, 2001. Morgan Kaufmann Publishers.

Digital Library

Google Scholar

[4]

M. L. Littman and P. Stone. A polynomial-time Nash equilibrium algorithm for repeated games. Decision Support Systems, 39:55--66, 2005.

Digital Library

Google Scholar

[5]

P. Milgrom and C. Shannon. Monotone comparative statics. Econometrica, 62:157--180, 1994.

Crossref

Google Scholar

[6]

L. E. Ortiz and M. Kearns. Nash propagation for loopy graphical games. In S. T. S. Becker and K. Obermayer, editors, Advances in Neural Information Processing Systems 15, pages 793--800. MIT Press, Cambridge, MA, 2003.

Google Scholar

[7]

S. Russel and P. Norvig. Artificial Intelligence - A Modern Approach. Prentice Hall, 2003.

Digital Library

Google Scholar

[8]

S. Singh, V. Soni, and M. Wellman. Computing approximate bayes nash equilibria in tree-games of incomplete information. In ACM Conference on Electronic Commerce, 2004.

Digital Library

Google Scholar

[9]

D. Topkis. Supermodularity and Complementarity. Princeton University Press, 2002.

Google Scholar

[10]

D. Vickrey and D. Koller. Multi-agent algorithms for solving graphical games. In Eighteenth national conference on Artificial intelligence, pages 345--351. American Association for Artificial Intelligence, 2002.

Digital Library

Google Scholar

Cited By

View all

Roch CLondono Castillo SLinnhoff-Popien C(2022)A Grover based Quantum Algorithm for Finding Pure Nash Equilibria in Graphical Games2022 IEEE 19th International Conference on Software Architecture Companion (ICSA-C)10.1109/ICSA-C54293.2022.00036(147-151)Online publication date: Mar-2022
https://doi.org/10.1109/ICSA-C54293.2022.00036
Roch CPhan TFeld SMüller RGabor THahn CLinnhoff-Popien C(2020)A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical GamesComputational Science – ICCS 202010.1007/978-3-030-50433-5_38(488-501)Online publication date: 15-Jun-2020
https://doi.org/10.1007/978-3-030-50433-5_38
Chandrasekaran MChen YDoshi PSingh SMarkovitch S(2017)On Markov games played by bayesian and boundedly-rational playersProceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3298239.3298305(437-443)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3298239.3298305
Show More Cited By

Index Terms

Constraint satisfaction algorithms for graphical games
1. Computing methodologies
  1. Artificial intelligence
    1. Philosophical/theoretical foundations of artificial intelligence
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Nash equilibria in graphical games on trees revisited
EC '06: Proceedings of the 7th ACM conference on Electronic commerce

Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying graph has low degree, they provide a concise way to represent the players'...
On the complexity of constrained Nash equilibria in graphical games

A widely accepted rational behavior for non-cooperative players is based on the notion of Nash equilibrium. Although the existence of a Nash equilibrium is guaranteed in the mixed framework (i.e., when players select their actions in a randomized manner)...
The complexity of constraint satisfaction games and QCSP

We study the complexity of two-person constraint satisfaction games. An instance of such a game is given by a collection of constraints on overlapping sets of variables, and the two players alternately make moves assigning values from a finite domain to ...

Comments

Information & Contributors

Information

Published In

AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems

May 2007

1585 pages

ISBN:9788190426275

DOI:10.1145/1329125

Conference Chairs:
Edmund Durfee
University of Michigan
,
Makoto Yokoo
Kyushu University
,
Program Chairs:
Michael Huhns
University of South Carolina
,
Onn Shehory
IBM Haifa Research Lab, Israel

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 May 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

AAMAS07

Sponsor:

AAMAS07: International Conference on Autonomous Agents and Mulitagent Systems

May 14 - 18, 2007

Hawaii, Honolulu

Acceptance Rates

Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
283
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Roch CLondono Castillo SLinnhoff-Popien C(2022)A Grover based Quantum Algorithm for Finding Pure Nash Equilibria in Graphical Games2022 IEEE 19th International Conference on Software Architecture Companion (ICSA-C)10.1109/ICSA-C54293.2022.00036(147-151)Online publication date: Mar-2022
https://doi.org/10.1109/ICSA-C54293.2022.00036
Roch CPhan TFeld SMüller RGabor THahn CLinnhoff-Popien C(2020)A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical GamesComputational Science – ICCS 202010.1007/978-3-030-50433-5_38(488-501)Online publication date: 15-Jun-2020
https://doi.org/10.1007/978-3-030-50433-5_38
Chandrasekaran MChen YDoshi PSingh SMarkovitch S(2017)On Markov games played by bayesian and boundedly-rational playersProceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3298239.3298305(437-443)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3298239.3298305
Goonewardena MAjib W(2016)Existence of Equilibria in Joint Admission and Power Control for Inelastic TrafficIEEE Wireless Communications Letters10.1109/LWC.2016.25165345:2(188-191)Online publication date: Apr-2016
https://doi.org/10.1109/LWC.2016.2516534
Ismaili ABampis EMaudet NPerny PBazzan AHuhns MLomuscio AScerri P(2014)How the number of strategies impacts the likelihood of equilibria in random graphical gamesProceedings of the 2014 international conference on Autonomous agents and multi-agent systems10.5555/2615731.2615779(285-292)Online publication date: 5-May-2014
https://dl.acm.org/doi/10.5555/2615731.2615779
Ismaili ABampis EMaudet NPerny PGini MShehory OIto TJonker C(2013)A study on the stability and efficiency of graphical games with unbounded treewidthProceedings of the 2013 international conference on Autonomous agents and multi-agent systems10.5555/2484920.2484964(263-270)Online publication date: 6-May-2013
https://dl.acm.org/doi/10.5555/2484920.2484964
Oliehoek FWhiteson SSpaan M(2012)Exploiting structure in cooperative Bayesian gamesProceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence10.5555/3020652.3020721(654-663)Online publication date: 14-Aug-2012
https://dl.acm.org/doi/10.5555/3020652.3020721
Grubshtein AMeisels A(2012)Finding a Nash Equilibrium by Asynchronous BacktrackingProceedings of the 18th International Conference on Principles and Practice of Constraint Programming - Volume 751410.5555/2969951.2970024(925-940)Online publication date: 8-Oct-2012
https://dl.acm.org/doi/10.5555/2969951.2970024
Grubshtein AMeisels A(2012)Finding a Nash Equilibrium by Asynchronous BacktrackingPrinciples and Practice of Constraint Programming10.1007/978-3-642-33558-7_66(925-940)Online publication date: 2012
https://doi.org/10.1007/978-3-642-33558-7_66
Oliehoek FSpaan MWhiteson SVlassis NPadgham LParkes D(2008)Exploiting locality of interaction in factored Dec-POMDPsProceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 110.5555/1402383.1402457(517-524)Online publication date: 12-May-2008
https://dl.acm.org/doi/10.5555/1402383.1402457
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Nash equilibria in graphical games on trees revisited

On the complexity of constrained Nash equilibria in graphical games

The complexity of constraint satisfaction games and QCSP

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Funding Sources

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations