The Computational Difficulty of Bribery in Qualitative Coalitional Games

This file is part of IDEAS, which uses RePEc data

The Computational Difficulty of Bribery in Qualitative Coalitional Games

Author Info

Andrew Dowell (University of Liverpool)
Michael Wooldridge (University of Liverpool)
Peter McBurney (University of Liverpool)

Abstract

Qualitative coalitional games (QCG) are representations of coalitional games in which self interested agents, each with their own individual goals, group together in order to achieve a set of goals which satisfy all the agents within that group. In such a representation, it is the strategy of the agents to find the best coalition to join. Previous work into QCGs has investigated the computational complexity of determining which is the best coalition to join. We plan to expand on this work by investigating the computational complexity of computing agent power in QCGs as well as by showing that insincere strategies, particularly bribery, are possible when the envy-freeness assumption is removed but that it is computationally difficult to identify the best agents to bribe.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

Publisher Info
Paper provided by Fondazione Eni Enrico Mattei in its series Working Papers with number 2007.100.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: Nov 2007
Date of revision:
Handle: RePEc:fem:femwpa:2007.100

Contact details of provider:
Postal: Corso Magenta, 63 - 20123 Milan
Phone: 0039-2-52036934
Fax: 0039-2-52036946
Email:
Web page: http://www.feem.it/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (barbara racah).

Other versions of this item:

Find related papers by JEL classification:
C63 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Computational Techniques
C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

This paper has been announced in the following NEP Reports:

NEP-ALL-2008-08-06 (All new papers)
NEP-CMP-2008-08-06 (Computational Economics)
NEP-GTH-2008-08-06 (Game Theory)

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

Klaus Abbink & Bernd Irlenbusch & Elke Renner, 2002. "An Experimental Bribery Game," Journal of Law, Economics and Organization, Oxford University Press, vol. 18(2), pages 428-454, October.
M Sáiz & Eligius Hendrix & Niels Olieman, 2006. "On the Computation of Stability in Multiple Coalition Formation Games," Computational Economics, Springer, vol. 28(3), pages 251-275, October. [Downloadable!] (restricted)
Prasad, K & Kelly, J S, 1990. "NP-Completeness of Some Problems Concerning Voting Games," International Journal of Game Theory, Springer, vol. 19(1), pages 1-9.
Bloch, Francis, 1996. "Sequential Formation of Coalitions in Games with Externalities and Fixed Payoff Division," Games and Economic Behavior, Elsevier, vol. 14(1), pages 90-123, May. [Downloadable!] (restricted)

Full references

Statistics
Access and download statistics

Did you know? IDEAS also indexes book chapters.

This page was last updated on 2009-12-3.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.