IDEAS home Printed from https://ideas.repec.org/p/fem/femwpa/2007.100.html
   My bibliography  Save this paper

The Computational Difficulty of Bribery in Qualitative Coalitional Games

Author

Listed:
  • 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.

Suggested Citation

  • Andrew Dowell & Michael Wooldridge & Peter McBurney, 2007. "The Computational Difficulty of Bribery in Qualitative Coalitional Games," Working Papers 2007.100, Fondazione Eni Enrico Mattei.
  • Handle: RePEc:fem:femwpa:2007.100
    as

    Download full text from publisher

    File URL: http://www.feem.it/userfiles/attach/Publication/NDL2007/NDL2007-100.pdf
    Download Restriction: no

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. 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.
    4. 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)

    More about this item

    Keywords

    Bribery; Coalition Formation; Computational Complexity;

    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

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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). General contact details of provider: http://edirc.repec.org/data/feemmit.html .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.