Finding a nash equilibrium by asynchronous backtracking

Alon Grubshtein, Amnon Meisels

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations


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 languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - 18th International Conference, CP 2012, Proceedings
Number of pages16
StatePublished - 7 Nov 2012
Event18th International Conference on Principles and Practice of Constraint Programming, CP 2012 - Quebec City, QC, Canada
Duration: 8 Oct 201212 Oct 2012

Publication series

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


Conference18th International Conference on Principles and Practice of Constraint Programming, CP 2012
CityQuebec City, QC

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Finding a nash equilibrium by asynchronous backtracking'. Together they form a unique fingerprint.

Cite this