Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Cooperative Equilibrium beyond Social Dilemmas: Pareto Solvable Games (1509.07599v1)

Published 25 Sep 2015 in cs.GT, physics.soc-ph, and q-bio.PE

Abstract: A recently introduced concept of "cooperative equilibrium", based on the assumption that players have a natural attitude to cooperation, has been proven a powerful tool in predicting human behaviour in social dilemmas. In this paper, we extend this idea to more general game models, termed "Pareto solvable" games, which in particular include the Nash Bargaining Problem and the Ultimatum Game. We show that games in this class possess a unique pure cooperative equilibrium. Furthermore, for the Ultimatum Game, this notion appears to be strongly correlated with a suitably defined variant of the Dictator Game. We support this observation with the results of a behavioural experiment conducted using Amazon Mechanical Turk, which demonstrates that our approach allows for making statistically precise predictions of average behaviour in such settings.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Valerio Capraro (65 papers)
  2. Maria Polukarov (12 papers)
  3. Matteo Venanzi (4 papers)
  4. Nicholas R. Jennings (47 papers)
Citations (8)

Summary

We haven't generated a summary for this paper yet.