IDEAS home Printed from https://ideas.repec.org/a/gam/jgames/v9y2018i3p40-d154549.html
   My bibliography  Save this article

Buying Optimal Payoffs in Bi-Matrix Games

Author

Listed:
  • Anshul Gupta

    (Department of Computer Science, University of Liverpool, Liverpool L69 3BX, UK)

  • Sven Schewe

    (Department of Computer Science, University of Liverpool, Liverpool L69 3BX, UK)

Abstract

We consider non-zero sum bi-matrix games where one player presumes the role of a leader in the Stackelberg model, while the other player is her follower. We show that the leader can improve her reward if she can incentivise her follower by paying some of her own utility to the follower for assigning a particular strategy profile. Besides assuming that the follower is rational in that he tries to maximise his own payoff, we assume that he is also friendly towards his leader in that he chooses, ex aequo, the strategy suggested by her—at least as long as it does not affect his expected payoff. Assuming this friendliness is, however, disputable: one could also assume that, ex aequo, the follower acts adversarially towards his leader. We discuss these different follower behavioural models and their implications. We argue that the friendliness leads to an obligation for the leader to choose, ex aequo, an assignment that provides the highest follower return, resulting in ‘friendly incentive equilibria’. For the antagonistic assumption, the stability requirements for a strategy profile should be strengthened, comparable to the secure Nash equilibria. In general, no optimal incentive equilibrium for this condition exists, and therefore we introduce ε -optimal incentive equilibria for this case. We show that the construction of all of these incentive equilibria (and all the related leader equilibria) is tractable.

Suggested Citation

  • Anshul Gupta & Sven Schewe, 2018. "Buying Optimal Payoffs in Bi-Matrix Games," Games, MDPI, vol. 9(3), pages 1-36, June.
  • Handle: RePEc:gam:jgames:v:9:y:2018:i:3:p:40-:d:154549
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2073-4336/9/3/40/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2073-4336/9/3/40/
    Download Restriction: no
    ---><---

    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:gam:jgames:v:9:y:2018:i:3:p:40-:d:154549. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.