An efficient characterization of submodular spanning tree games

Zhuan Khye Koh (Corresponding author), Laura Sanità

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)

Abstract

Cooperative games form an important class of problems in game theory, where a key goal is to distribute a value among a set of players who are allowed to cooperate by forming coalitions. An outcome of the game is given by an allocation vector that assigns a value share to each player. A crucial aspect of such games is submodularity (or convexity). Indeed, convex instances of cooperative games exhibit several nice properties, e.g. regarding the existence and computation of allocations realizing some of the most important solution concepts proposed in the literature. For this reason, a relevant question is whether one can give a polynomial-time characterization of submodular instances, for prominent cooperative games that are in general non-convex. In this paper, we focus on a fundamental and widely studied cooperative game, namely the spanning tree game. An efficient recognition of submodular instances of this game was not known so far, and explicitly mentioned as an open question in the literature. We here settle this open problem by giving a polynomial-time characterization of submodular spanning tree games.

Original languageEnglish
Pages (from-to)359-377
Number of pages19
JournalMathematical Programming
Volume183
Issue number1-2
DOIs
Publication statusPublished - 1 Sep 2020

Keywords

  • 05C05 Trees
  • 05C57 Games on graphs (graph-theoretic aspects)
  • 91A12 Cooperative games

Fingerprint Dive into the research topics of 'An efficient characterization of submodular spanning tree games'. Together they form a unique fingerprint.

Cite this