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
Y1 - 2012
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 BV
T2 - 20th European Conference on Artificial Intelligence, ECAI 2012
Y2 - 27 August 2012 through 31 August 2012
ER -