Search arXiv⌕ Search

arXiv · 2609.39426

The prospect of a fair outcome triggers prosocial behaviour in the Centipede Game

Abstract

Human decision-making reflects not only material incentives, but also concern for others' gains and the ability to understand others. However, the extent to which sensitivity to fairness interacts with aspects of social cognition and affects sequential social interactions requires further understanding. Here, we address this question through a behavioural experiment on sequential exchanges of resources, represented by the Incremental Centipede Game (ICG). The design comprises a "zero-end" treatment (n=164), where the ICG has a deadline yielding no payoff, and a "fair-end" treatment (n=162), where the last interaction leads to a fair outcome. The ICG, which is repeated twice, is complemented by two individual tasks: the Social Value Orientation task (SVO), to elicit social preferences, and the Cognitive Reflection Test (CRT), to assess participants' deliberation. Our results show that the fair outcome, though uncertain, prompts participants to move beyond self-interest. Indeed, an evolutionary model shows that the fair split shifts play towards a mutually beneficial strategy when players are sufficiently prosocial and use probabilistic strategies. A second game repetition reinforces this pattern, with adaptation towards cooperation. Although CRT scores do not predict behaviour in the ICG, participants who deviate from game-theoretic rationality exhibit stronger prosociality in the SVO. Notably, in the fair-end treatment, some non-rational players are individualists, suggesting that the fair split may function as a nudge. In conclusion, our findings suggest that certain personal traits, such as social preferences, allow individuals to overcome self-interest to better align with their peers and achieve better collective outcomes in mixed-motive games.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Saponara, António M. Fernandes, Elias Fernández Domingos, Ana Paiva, Tom Lenaerts. 2026-09-30. The prospect of a fair outcome triggers prosocial behaviour in the Centipede Game. https://arxiv.org/abs/2609.39426

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Selling to Non-linear Agents: A Demand-Based Auction

Auctions allocate scarce goods, from car licenses to online advertising, to buyers whose utilities are often not linear in money, as with budgets or risk aversion. We ask how a seller should sell to such buyers and what learning their preferences is worth. We propose demand-based auctions, which elicit demand curves and are dominant-strategy incentive compatible for any non-linear utilities. The revenue-maximizing one takes familiar second-price forms and is max-min optimal when the seller observes only demand curves. Under standard assumptions, learning risk attitudes beyond demand curves adds relatively little revenue, as does learning budgets unless they correlate with values.

cs.GT↗

Voting with Partial Orders: The Plurality and Anti-Plurality Classes

In the theory of voting, the Plurality rule for preferences that come in the form of linear orders selects the alternatives most frequently appearing in the first position of those orders, while the Anti-Plurality rule selects the alternatives least often occurring in the final position. We explore extensions of these rules to preferences that are partial orders, offering axiomatic characterisations for them.

cs.GT↗

Fair Division with Indivisible Goods, Chores, and Cake

We study the problem of fairly allocating indivisible items and a desirable heterogeneous divisible good (i.e., cake) to agents with additive utilities. In our paper, each indivisible item can be a good that yields non-negative utilities to some agents and a chore that yields negative utilities to the other agents. Given a fixed set of divisible and indivisible resources, we investigate almost envy-free allocations, captured by the natural fairness concept of envy-freeness for mixed resources (EFM). It requires that an agent $i$ not envy another agent $j$ if agent $j$'s bundle contains any piece of cake yielding positive utility to agent $i$ (i.e., envy-freeness), and that agent $i$ be envy-free up to one item (EF1) towards agent $j$ otherwise. We prove that with indivisible items and a cake, an EFM allocation always exists for any number of agents with additive utilities. We reduce the problem of showing the existence of EFM to the problem of proving the compatibility of EF1 and envy-freeability. An allocation of indivisible items is said to be envy-freeable if the allocation can be made envy-free by allocating a sufficient amount of money to each of the agents. We show that for indivisible items, an EF1 and envy-freeable allocation always exists. Moreover, such an allocation can be found in polynomial time. This result, in and of itself, is of independent interest.

cs.GT↗