skip to main content
10.1145/1807406.1807486acmotherconferencesArticle/Chapter ViewAbstractPublication PagesbqgtConference Proceedingsconference-collections
research-article

Revealed altruism without independence of irrelevant alternatives

Published:14 May 2010Publication History

ABSTRACT

Revealed altruism theory (Cox, Friedman, and Sadiraj, 2008) is a theory of reciprocity that is grounded in neoclassical preference theory. The unconditional preferences included in revealed altruism (RA) theory are neoclassical; they satisfy the generalized axiom of revealed preference (GARP) and are independent of irrelevant alternatives. The reciprocal preferences included in RA theory do not satisfy GARP and they can be dependent on choices not made by another. This paper introduces an inconsistency with independence of irrelevant alternatives (IIA) into the non-reciprocal preference component of RA theory. This dependence is inspired by the axiom of monotonicity (Kalai and Smorodinsky, 1975) introduced into bargaining theory as an alternative to Nash's IIA axiom. The extended RA theory can rationalize patterns of giving and taking in dictator games (List, 2007; Bardsley, 2008) previously thought to be anomalous. It also rationalizes effects of earned vs. unearned endowments on dictators' choices (Cherry, et al., 2002). And the theory continues to rationalize data from many games involving reciprocity.

Index Terms

  1. Revealed altruism without independence of irrelevant alternatives

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      BQGT '10: Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions
      May 2010
      155 pages
      ISBN:9781605589190
      DOI:10.1145/1807406

      Copyright © 2010 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 14 May 2010

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article