Output details
11 - Computer Science and Informatics
University of Birmingham
Article title
A Ramsey Bound on Stable Sets in Jordan Pillage Games
Type
D - Journal article
Title of journal
International Journal of Game Theory
Article number
-
Volume number
40
Issue number
3
First page of article
461
ISSN of journal
0020-7276
Year of publication
2011
URL
-
Number of additional authors
1
Additional information
<13>Jordan defined "pillage games", a class of cooperative games whose dominance operator is represented by a "power function", and proved that stable sets must be finite. We provide a graph theoretical interpretation of the problem which tightens the finite bound to a Ramsey number. We also prove that the Jordan pillage axioms are independent. By this we link theoretical economics with theoretical computer science. This and related works have secured the authors an invitation to the prestigious Initiative for Computational Economics summer school 2012 in Chicago where they gave an overview of research relating reasoning and economics.
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Artificial Intelligence and Intelligent Robotics
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
