An efficient characterization of submodular spanning tree games

Koh, Cedric and Sanitàa, Laura (2020) An efficient characterization of submodular spanning tree games. Mathematical Programming, 183 (1-2). 359 - 377. ISSN 0025-5610

Text (Koh_efficient-characterization-of-submodular-spanning-tree-games--published) - Published Version Available under License Creative Commons Attribution. Download (439kB)

• Author

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.

Item Type:	Article
Official URL:	https://www.springer.com/journal/10107
Additional Information:	© 2020 The Authors
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited:	30 Mar 2020 10:06
Last Modified:	17 Oct 2024 16:04
URI:	http://eprints.lse.ac.uk/id/eprint/103867

Actions (login required)

View Item