Finding a nash equilibrium by asynchronous backtracking

Alon Grubshtein; Amnon Meisels

doi:10.1007/978-3-642-33558-7_66

Finding a nash equilibrium by asynchronous backtracking

Alon Grubshtein, Amnon Meisels

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

Graphical Games are a succinct representation of multi agent interactions in which each participant interacts with a limited number of other agents. The model resembles Distributed Constraint Optimization Problems (DCOPs) including agents, variables, and values (strategies). However, unlike distributed constraints, local interactions of Graphical Games take the form of small strategic games and the agents are expected to seek a Nash Equilibrium rather than a cooperative minimal cost joint assignment. The present paper models graphical games as a Distributed Constraint Satisfaction Problem with unique k-ary constraints in which each agent is only aware of its part in the constraint. A proof that a satisfying solution to the resulting problem is an ε-Nash equilibrium is provided and an Asynchronous Backtracking algorithm is proposed for solving this distributed problem. The algorithm's completeness is proved and its performance is evaluated.

Original language	English
Title of host publication	Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Proceedings
Pages	925-940
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-33558-7_66
State	Published - 2012
Externally published	Yes
Event	18th International Conference on Principles and Practice of Constraint Programming, CP 2012 - Quebec City, QC, Canada Duration: 8 Oct 2012 → 12 Oct 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7514 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th International Conference on Principles and Practice of Constraint Programming, CP 2012
Country/Territory	Canada
City	Quebec City, QC
Period	8/10/12 → 12/10/12

Bibliographical note

Funding Information:
The research was supported by the Lynn and William Frankel Center for Computer Sciences at Ben-Gurion University and by the Paul Ivanier Center for Robotics Research and Production Management.

Funding

The research was supported by the Lynn and William Frankel Center for Computer Sciences at Ben-Gurion University and by the Paul Ivanier Center for Robotics Research and Production Management.

Funders	Funder number
Lynn and William Frankel Center for Computer Sciences at Ben-Gurion University

Access to Document

10.1007/978-3-642-33558-7_66

Cite this

Grubshtein, A., & Meisels, A. (2012). Finding a nash equilibrium by asynchronous backtracking. In Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Proceedings (pp. 925-940). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7514 LNCS). https://doi.org/10.1007/978-3-642-33558-7_66

@inproceedings{db22c9193e8f4f5c950e189903a8cd75,

title = "Finding a nash equilibrium by asynchronous backtracking",

abstract = "Graphical Games are a succinct representation of multi agent interactions in which each participant interacts with a limited number of other agents. The model resembles Distributed Constraint Optimization Problems (DCOPs) including agents, variables, and values (strategies). However, unlike distributed constraints, local interactions of Graphical Games take the form of small strategic games and the agents are expected to seek a Nash Equilibrium rather than a cooperative minimal cost joint assignment. The present paper models graphical games as a Distributed Constraint Satisfaction Problem with unique k-ary constraints in which each agent is only aware of its part in the constraint. A proof that a satisfying solution to the resulting problem is an ε-Nash equilibrium is provided and an Asynchronous Backtracking algorithm is proposed for solving this distributed problem. The algorithm's completeness is proved and its performance is evaluated.",

author = "Alon Grubshtein and Amnon Meisels",

note = "Funding Information: The research was supported by the Lynn and William Frankel Center for Computer Sciences at Ben-Gurion University and by the Paul Ivanier Center for Robotics Research and Production Management.; 18th International Conference on Principles and Practice of Constraint Programming, CP 2012 ; Conference date: 08-10-2012 Through 12-10-2012",

year = "2012",

doi = "10.1007/978-3-642-33558-7_66",

language = "אנגלית",

isbn = "9783642335570",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "925--940",

booktitle = "Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Proceedings",

}

Grubshtein, A & Meisels, A 2012, Finding a nash equilibrium by asynchronous backtracking. in Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7514 LNCS, pp. 925-940, 18th International Conference on Principles and Practice of Constraint Programming, CP 2012, Quebec City, QC, Canada, 8/10/12. https://doi.org/10.1007/978-3-642-33558-7_66

Finding a nash equilibrium by asynchronous backtracking. / Grubshtein, Alon; Meisels, Amnon.
Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Proceedings. 2012. p. 925-940 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7514 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Finding a nash equilibrium by asynchronous backtracking

AU - Grubshtein, Alon

AU - Meisels, Amnon

N1 - Funding Information: The research was supported by the Lynn and William Frankel Center for Computer Sciences at Ben-Gurion University and by the Paul Ivanier Center for Robotics Research and Production Management.

PY - 2012

Y1 - 2012

N2 - Graphical Games are a succinct representation of multi agent interactions in which each participant interacts with a limited number of other agents. The model resembles Distributed Constraint Optimization Problems (DCOPs) including agents, variables, and values (strategies). However, unlike distributed constraints, local interactions of Graphical Games take the form of small strategic games and the agents are expected to seek a Nash Equilibrium rather than a cooperative minimal cost joint assignment. The present paper models graphical games as a Distributed Constraint Satisfaction Problem with unique k-ary constraints in which each agent is only aware of its part in the constraint. A proof that a satisfying solution to the resulting problem is an ε-Nash equilibrium is provided and an Asynchronous Backtracking algorithm is proposed for solving this distributed problem. The algorithm's completeness is proved and its performance is evaluated.

AB - Graphical Games are a succinct representation of multi agent interactions in which each participant interacts with a limited number of other agents. The model resembles Distributed Constraint Optimization Problems (DCOPs) including agents, variables, and values (strategies). However, unlike distributed constraints, local interactions of Graphical Games take the form of small strategic games and the agents are expected to seek a Nash Equilibrium rather than a cooperative minimal cost joint assignment. The present paper models graphical games as a Distributed Constraint Satisfaction Problem with unique k-ary constraints in which each agent is only aware of its part in the constraint. A proof that a satisfying solution to the resulting problem is an ε-Nash equilibrium is provided and an Asynchronous Backtracking algorithm is proposed for solving this distributed problem. The algorithm's completeness is proved and its performance is evaluated.

UR - http://www.scopus.com/inward/record.url?scp=84868280091&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-33558-7_66

DO - 10.1007/978-3-642-33558-7_66

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84868280091

SN - 9783642335570

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 925

EP - 940

BT - Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Proceedings

T2 - 18th International Conference on Principles and Practice of Constraint Programming, CP 2012

Y2 - 8 October 2012 through 12 October 2012

ER -

Grubshtein A, Meisels A. Finding a nash equilibrium by asynchronous backtracking. In Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Proceedings. 2012. p. 925-940. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-33558-7_66

Finding a nash equilibrium by asynchronous backtracking

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this