The Computational Difficulty of Bribery in Qualitative Coalitional Games
AbstractQualitative 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 InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
Bibliographic InfoPaper provided by Fondazione Eni Enrico Mattei in its series Working Papers with number 2007.100.
Date of creation: Nov 2007
Date of revision:
Bribery; Coalition Formation; Computational Complexity;
Find related papers by JEL classification:
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - 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)
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.:
- 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.
- Klaus Abbink & Bernd Irlenbusch & Elke Renner, 2000.
"An Experimental Bribery Game,"
Econometric Society World Congress 2000 Contributed Papers
1389, Econometric Society.
- M Sáiz & Eligius Hendrix & Niels Olieman, 2006. "On the Computation of Stability in Multiple Coalition Formation Games," Computational Economics, Society for Computational Economics, vol. 28(3), pages 251-275, October.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (barbara racah).
If references are entirely missing, you can add them using this form.