The University of Southampton
×
Filter your search:
University of Southampton Institutional Repository

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

An anytime algorithm for finding the ε-core in nontransferable utility coalitional games
An anytime algorithm for finding the ε-core in nontransferable utility coalitional games
We provide the first anytime algorithm for finding the ε-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.
414-419
Hines, Greg
8b1370c3-38d4-4087-85fd-01fff20eee0b
Rahwan, Talal
476029f3-5484-4747-9f44-f63f3687083c
Jennings, Nicholas R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Hines, Greg
8b1370c3-38d4-4087-85fd-01fff20eee0b
Rahwan, Talal
476029f3-5484-4747-9f44-f63f3687083c
Jennings, Nicholas R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30

Hines, Greg, Rahwan, Talal and Jennings, Nicholas R. (2012) An anytime algorithm for finding the ε-core in nontransferable utility coalitional games. 20th European Conference on Artificial Intelligence (ECAI 2012), Montpellier, France. 27 - 31 Aug 2012. pp. 414-419 . (doi:10.3233/978-1-61499-098-7-414).

Record type: Conference or Workshop Item (Paper)

Abstract

We provide the first anytime algorithm for finding the ε-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.

Text
NTUcore.pdf - Accepted Manuscript
Download (284kB)

More information

e-pub ahead of print date: June 2012
Published date: August 2012
Venue - Dates: 20th European Conference on Artificial Intelligence (ECAI 2012), Montpellier, France, 2012-08-27 - 2012-08-31
Related URLs:
Organisations: Agents, Interactions & Complexity
Learn more about Agents, Interactions & Complexity research

Identifiers

Local EPrints ID: 340058
URI: http://eprints.soton.ac.uk/id/eprint/340058
DOI: doi:10.3233/978-1-61499-098-7-414
PURE UUID: 0cb177d3-57c3-4426-a626-3c0863ca74b9

Catalogue record

Date deposited: 11 Jun 2012 16:00
Last modified: 14 Mar 2024 11:18

Export record

Altmetrics

Contributors

Author: Greg Hines
Author: Talal Rahwan
Author: Nicholas R. Jennings

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Library staff additional information
Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×