Cores of Games via Total Dual Integrality, with Applications to Perfect Graphs and Polymatroids

09/11/2022
by   Vijay V. Vazirani, et al.
0

LP-duality theory has played a central role in the study of cores of games, right from the early days of this notion to the present time. The classic paper of Shapley and Shubik <cit.> introduced the "right" way of exploiting the power of this theory, namely picking problems whose LP-relaxations support polyhedra having integral vertices. So far, the latter fact was established by showing that the constraint matrix of the underlying linear system is totally unimodular. We attempt to take this methodology to its logical next step – using total dual integrality – thereby addressing new classes of games which have their origins in two major theories within combinatorial optimization, namely perfect graphs and polymatroids. In the former, we address the stable set and clique games and in the latter, we address the matroid independent set game. For each of these games, we prove that the set of core imputations is precisely the set of optimal solutions to the dual LPs. Another novelty is the way the worth of the game is allocated among sub-coalitions. Previous works follow the bottom-up process of allocating to individual agents; the allocation to a sub-coalition is simply the sum of the allocations to its agents. The natural process for our games is top-down. The optimal dual allocates to "objects" in the grand coalition; a sub-coalition inherits the allocation of each object with which it has non-empty intersection.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2023

LP-Duality Theory and the Cores of Games

LP-duality theory has played a central role in the study of the core, ri...
research
01/19/2021

The General Graph Matching Game: Approximate Core

The classic paper of Shapley and Shubik <cit.> characterized the core of...
research
02/01/2023

The Investment Management Game: Extending the Scope of the Notion of Core

The core is a dominant solution concept in economics and game theory. In...
research
02/01/2022

Insights into the Core of the Assignment Game via Complementarity

The assignment game forms a paradigmatic setting for studying the core –...
research
02/07/2020

Population Monotonic Allocation Schemes for Vertex Cover Games

For the class of vertex cover games (introduced by Deng et al., Math. Op...
research
03/31/2022

On the Population Monotonicity of Independent Set Games

An independent set game is a cooperative game defined on graphs and deal...
research
12/07/2020

Galloping in natural merge sorts

We study the algorithm TimSort and the sub-routine it uses to merge mono...

Please sign up or login with your details

Forgot password? Click here to reset