An anytime algorithm for finding the e-core in nontransferable utility coalitional games

Greg Hines, Talal Rahwan, Nicholas R. Jennings

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We provide the first anytime algorithm for finding the e-core in a nontransferable utility coalitional game. For a given set of possible joint actions, our algorithm calculates ε, the maximum utility any agent could gain by deviating from this set of actions. If ε is too high, our algorithm searches for a subset of the joint actions which leads to a smaller ε. Simulations show our algorithm is more efficient than an exhaustive search by up to 2 orders of magnitude.

Original languageEnglish (US)
Title of host publicationECAI 2012 - 20th European Conference on Artificial Intelligence, 27-31 August 2012, Montpellier, France - Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstration
PublisherIOS Press
Pages414-419
Number of pages6
ISBN (Print)9781614990970
DOIs
StatePublished - 2012
Event20th European Conference on Artificial Intelligence, ECAI 2012 - Montpellier, France
Duration: Aug 27 2012Aug 31 2012

Publication series

NameFrontiers in Artificial Intelligence and Applications
Volume242
ISSN (Print)0922-6389

Other

Other20th European Conference on Artificial Intelligence, ECAI 2012
Country/TerritoryFrance
CityMontpellier
Period8/27/128/31/12

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'An anytime algorithm for finding the e-core in nontransferable utility coalitional games'. Together they form a unique fingerprint.

Cite this