Reciprocation Effort Games

Open Access
Authors
Publication date 2018
Host editors
  • B. Verheij
  • M. Wiering
Book title Artificial Intelligence
Book subtitle 29th Benelux Conference, BNAIC 2017, Groningen, The Netherlands, November 8–9, 2017 : revised selected papers
ISBN
  • 9783319768915
ISBN (electronic)
  • 9783319768922
Series Communications in Computer and Information Science
Event The 29th Benelux Conference on Artificial Intelligence
Pages (from-to) 46-60
Number of pages 15
Publisher Cham: Springer
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
Abstract
Consider people dividing their time and effort between friends, interest clubs, and reading seminars. These are all reciprocal interactions, and the reciprocal processes determine the utilities of the agents from these interactions. To advise on efficient effort division, we determine the existence and efficiency of the Nash equilibria of the game of allocating effort to such projects. When no minimum effort is required to receive reciprocation, an equilibrium always exists, and if acting is either easy to everyone, or hard to everyone, then every equilibrium is socially optimal. If a minimal effort is needed to participate, we prove that not contributing at all is an equilibrium, and for two agents, also a socially optimal equilibrium can be found. Next, we extend the model, assuming that the need to react requires more than the agents can contribute to acting, rendering the reciprocation imperfect. We prove that even then, each interaction converges and the corresponding game has an equilibrium.
Document type Conference contribution
Language English
Published at https://doi.org/10.1007/978-3-319-76892-2_4
Downloads
seg_recip (Submitted manuscript)
Permalink to this page
Back