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 - Jan 1 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
CountryFrance
CityMontpellier
Period8/27/128/31/12

Fingerprint

Set theory

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Hines, G., Rahwan, T., & Jennings, N. R. (2012). An anytime algorithm for finding the e-core in nontransferable utility coalitional games. In ECAI 2012 - 20th European Conference on Artificial Intelligence, 27-31 August 2012, Montpellier, France - Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstration (pp. 414-419). (Frontiers in Artificial Intelligence and Applications; Vol. 242). IOS Press. https://doi.org/10.3233/978-1-61499-098-7-414

An anytime algorithm for finding the e-core in nontransferable utility coalitional games. / Hines, Greg; Rahwan, Talal; Jennings, Nicholas R.

ECAI 2012 - 20th European Conference on Artificial Intelligence, 27-31 August 2012, Montpellier, France - Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstration. IOS Press, 2012. p. 414-419 (Frontiers in Artificial Intelligence and Applications; Vol. 242).

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

Hines, G, Rahwan, T & Jennings, NR 2012, An anytime algorithm for finding the e-core in nontransferable utility coalitional games. in ECAI 2012 - 20th European Conference on Artificial Intelligence, 27-31 August 2012, Montpellier, France - Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstration. Frontiers in Artificial Intelligence and Applications, vol. 242, IOS Press, pp. 414-419, 20th European Conference on Artificial Intelligence, ECAI 2012, Montpellier, France, 8/27/12. https://doi.org/10.3233/978-1-61499-098-7-414
Hines G, Rahwan T, Jennings NR. An anytime algorithm for finding the e-core in nontransferable utility coalitional games. In ECAI 2012 - 20th European Conference on Artificial Intelligence, 27-31 August 2012, Montpellier, France - Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstration. IOS Press. 2012. p. 414-419. (Frontiers in Artificial Intelligence and Applications). https://doi.org/10.3233/978-1-61499-098-7-414
Hines, Greg ; Rahwan, Talal ; Jennings, Nicholas R. / An anytime algorithm for finding the e-core in nontransferable utility coalitional games. ECAI 2012 - 20th European Conference on Artificial Intelligence, 27-31 August 2012, Montpellier, France - Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstration. IOS Press, 2012. pp. 414-419 (Frontiers in Artificial Intelligence and Applications).
@inproceedings{97b823d69c2245a7a8fe6d21b6adf65c,
title = "An anytime algorithm for finding the e-core in nontransferable utility coalitional games",
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.",
author = "Greg Hines and Talal Rahwan and Jennings, {Nicholas R.}",
year = "2012",
month = "1",
day = "1",
doi = "10.3233/978-1-61499-098-7-414",
language = "English (US)",
isbn = "9781614990970",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press",
pages = "414--419",
booktitle = "ECAI 2012 - 20th European Conference on Artificial Intelligence, 27-31 August 2012, Montpellier, France - Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstration",

}

TY - GEN

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

AU - Hines, Greg

AU - Rahwan, Talal

AU - Jennings, Nicholas R.

PY - 2012/1/1

Y1 - 2012/1/1

N2 - 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.

AB - 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.

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

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

U2 - 10.3233/978-1-61499-098-7-414

DO - 10.3233/978-1-61499-098-7-414

M3 - Conference contribution

AN - SCOPUS:84878772487

SN - 9781614990970

T3 - Frontiers in Artificial Intelligence and Applications

SP - 414

EP - 419

BT - ECAI 2012 - 20th European Conference on Artificial Intelligence, 27-31 August 2012, Montpellier, France - Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstration

PB - IOS Press

ER -