The Computational Difficulty of Bribery in Qualitative Coalitional Games
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.
|Date of creation:||Nov 2007|
|Contact details of provider:|| Postal: Corso Magenta, 63 - 20123 Milan|
Web page: http://www.feem.it/
More information through EDIRC
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.
- Abbink, Klaus & Bernd Irlenbusch & Elke Renner, 1999. "An Experimental Bribery Game," Discussion Paper Serie B 459, University of Bonn, Germany.
- Klaus Abbink & Bernd Irlenbusch & Elke Renner, 2000. "An Experimental Bribery Game," Econometric Society World Congress 2000 Contributed Papers 1389, Econometric Society.
- Prasad, K & Kelly, J S, 1990. "NP-Completeness of Some Problems Concerning Voting Games," International Journal of Game Theory, Springer;Game Theory Society, 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.
- M Sáiz & Eligius Hendrix & Niels Olieman, 2006. "On the Computation of Stability in Multiple Coalition Formation Games," Computational Economics, Springer;Society for Computational Economics, vol. 28(3), pages 251-275, October. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:fem:femwpa:2007.100. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (barbara racah)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.