IDEAS home Printed from https://ideas.repec.org/a/cup/utilit/v9y1997i03p329-349_00.html
   My bibliography  Save this article

Constraint Games and the Orthodox Theory of Rationality

Author

Listed:
  • Barnes, R. Eric

Abstract

Moral theorists and game theorists are both interested in situations where rational agents are ‘called upon’ to constrain their future actions and co-operate with others instead of being free riders. These theorists have constructed a variety of hypothetical games which illuminate this problem of constraint. In this paper, I draw a distinction between ‘behaviour games’ like the Newcomb paradox and ‘disposition games’ like Kavka's toxin puzzle, a prisoner's dilemma and Parfit's hitchhiker example. I then employ this distinction to argue that agents who subscribe to the orthodox theory of rationality do significantly better in disposition games than those who subscribe to revisionist theories like David Gauthier's, while revisionist agents do marginally better in behaviour games. I argue that because of agents' ability to manipulate their own weakness of will, orthodox agents do better at all of these games than has previously been thought. And, by elucidating the distinction between behaviour games and disposition games, I uncover the virtues that underlie the success of each theory of rationality.

Suggested Citation

  • Barnes, R. Eric, 1997. "Constraint Games and the Orthodox Theory of Rationality," Utilitas, Cambridge University Press, vol. 9(3), pages 329-349, November.
  • Handle: RePEc:cup:utilit:v:9:y:1997:i:03:p:329-349_00
    as

    Download full text from publisher

    File URL: https://www.cambridge.org/core/product/identifier/S0953820800005410/type/journal_article
    File Function: link to article abstract page
    Download Restriction: no
    ---><---

    More about this item

    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:cup:utilit:v:9:y:1997:i:03:p:329-349_00. 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: Kirk Stebbing (email available below). General contact details of provider: https://www.cambridge.org/uti .

    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.