@inbook{260c2de327e540a2a8c0a074c573dd34,
title = "A Distributed asynchronous solver for Nash Equilibria in hypergraphical games",
abstract = "Hypergraphical games provides a compact model of a network of self-interested agents, each involved in simultaneous subgames with its neighbors. The overall aim is for the agents in the network to reach a Nash Equilibrium, in which no agent has an incentive to change their response, but without revealing all their private information. Asymmetric Distributed constraint satisfaction (ADisCSP) has been proposed as a solution to this search problem. In this paper, we propose a new model of hypergraphical games as an ADisCSP based on a new global constraint, and a new asynchronous algorithm for solving ADisCSP that is able to find a Nash Equilibrium. We show empirically that we significantly reduce both message passing and computation time, achieving an order of magnitude improvement in messaging and in non-concurrent computation time on dense problems compared to state-of-the art algorithms.",
author = "Mohamed Wahbi and Brown, \{Kenneth N.\}",
note = "Publisher Copyright: {\textcopyright} 2016 The Authors and IOS Press.; 22nd European Conference on Artificial Intelligence, ECAI 2016 ; Conference date: 29-08-2016 Through 02-09-2016",
year = "2016",
doi = "10.3233/978-1-61499-672-9-1291",
language = "English",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press BV",
pages = "1291--1299",
editor = "Kaminka, \{Gal A.\} and Maria Fox and Paolo Bouquet and Eyke Hullermeier and Virginia Dignum and Frank Dignum and \{van Harmelen\}, Frank",
booktitle = "Frontiers in Artificial Intelligence and Applications",
address = "Netherlands",
}