Arrow Research search
Back to TCS

TCS 2023

Project games

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

We consider a strategic game, called project game, where each agent has to choose a project among her own list of available projects. The model includes positive weights expressing the capacity of a given agent to contribute to a given project. The realization of a project produces some reward that has to be allocated to the agents. The reward of a realized project is fully allocated to its contributors according to a simple proportional rule. Existence and computational complexity of pure Nash equilibria is addressed and their efficiency is investigated according to both the utilitarian and the egalitarian social function.

Authors

Keywords

  • Pure Nash equilibria
  • Price of anarchy
  • Price of stability

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
872211981300611807