Distributed search for pure nash equilibria in graphical games

Omer Litov, Amnon Meisels

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

1 Scopus citations

Abstract

Graphical games introduce a compact representation, where agents' outcomes depend only on their neighbors. A distributed search algorithm for pure Nash equilibria of graphical games is presented. The algorithm uses the analogy of graphical games with asymmetric distributed constraints optimization problems (ADCOPs). The proposed algorithm includes three components - an admissible pruning heuristic; a back-checking mechanism; and a pseudo tree representation of the game. An experimental evaluation of the components of the proposed search algorithm is presented for randomly generated networks of multiple agents. The major speedup over a naive search algorithm is shown to arise from the use of a pseudo tree representation. A simple assessment method of the privacy loss due to back-checking is presented and is shown to result in a tradeoff between the performance of the complete algorithm and its privacy loss.

Original languageEnglish
Title of host publicationAAMAS 2016 - Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages1279-1280
Number of pages2
ISBN (Electronic)9781450342391
StatePublished - 2016
Externally publishedYes
Event15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016 - Singapore, Singapore
Duration: 9 May 201613 May 2016

Publication series

NameProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
ISSN (Print)1548-8403
ISSN (Electronic)1558-2914

Conference

Conference15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016
Country/TerritorySingapore
CitySingapore
Period9/05/1613/05/16

Bibliographical note

Publisher Copyright:
Copyright © 2016, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.

Keywords

  • DCOP
  • Distributed problem solving
  • Nash equilibrium
  • Privacy

Fingerprint

Dive into the research topics of 'Distributed search for pure nash equilibria in graphical games'. Together they form a unique fingerprint.

Cite this