Conference item icon

Conference item

Cooperative games with bounded dependency degree

Abstract:

Cooperative games provide a framework to study cooperation among self-interested agents. They offer a number of solution concepts describing how the outcome of the cooperation should be shared among the players. Unfortunately, computational problems associated with many of these solution concepts tend to be intractable---NP-hard or worse. In this paper, we incorporate complexity measures recently proposed by Feige and Izsak (2013), called dependency degree and supermodular degree, into the co...

Expand abstract
Publication status:
Published
Peer review status:
Reviewed (other)
Version:
Accepted Manuscript

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Oxford college:
St Catherine's College
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Oxford college:
Balliol College
Publisher:
Association for the Advancement of Artificial Intelligence Publications Publisher's website
Pages:
1063-1070
Publication date:
2018-04-25
Acceptance date:
2017-12-01
EISSN:
2374-3468
Pubs id:
pubs:834275
URN:
uri:59ddaabf-4c42-4b8f-b6ed-0bcd1b8b52e8
UUID:
uuid:59ddaabf-4c42-4b8f-b6ed-0bcd1b8b52e8
Local pid:
pubs:834275
ISBN:
9781577358008

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP