DeepAI AI Chat
Log In Sign Up

Facets of the cone of exact games

by   Milan Studeny, et al.

The class of exact transferable utility coalitional games, introduced in 1972 by Schmeidler, has been studied both in the context of game theory and in the context of imprecise probabilities. We characterize the cone of exact games by describing the minimal set of linear inequalities defining this cone; these facet-defining inequalities for the exact cone appear to correspond to certain set systems (= systems of coalitions). We noticed that non-empty proper coalitions having non-zero coefficients in these facet-defining inequalities form set systems with particular properties. More specifically, we introduce the concept of a semi-balanced system of coalitions, which generalizes the classic concept of a balanced coalitional system in cooperative game theory. The semi-balanced coalitional systems provide valid inequalities for the exact cone and minimal semi-balanced systems (in the sense of inclusion of set systems) characterize this cone. We also introduce basic classification of minimal semi-balanced systems, their pictorial representatives and a substantial concept of an indecomposable (minimal) semi-balanced system of coalitions. The main result of the paper is that indecomposable semi-balanced systems are in one-to-one correspondence with facet-defining inequalities for the exact cone. The secondary relevant result is the rebuttal of a former conjecture claiming that a coalitional game is exact iff it is totally balanced and its anti-dual is also totally balanced. We additionally characterize those inequalities which are facet-defining both for the exact cone and the cone of totally balanced games.


Facets of the Total Matching Polytope for bipartite graphs

The Total Matching Polytope generalizes the Stable Set Polytope and the ...

On the Approximation Resistance of Balanced Linear Threshold Functions

In this paper, we show that there exists a balanced linear threshold fun...

The Circlet Inequalities: A New, Circulant-Based Facet-Defining Inequality for the TSP

Facet-defining inequalities of the symmetric Traveling Salesman Problem ...

On the Complexity of Some Facet-Defining Inequalities of the QAP-polytope

The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem t...

On the Dominant of the Multicut Polytope

Given a graph G=(V,E) and a set S ⊆V2 of terminal pairs, the minimum mul...

Some Results on Digital Segments and Balanced Words

We exhibit combinatorial results on Christoffel words and binary balance...

Balanced and Swap-Robust Trades for Dynamical Distributed Storage

Trades, introduced by Hedayat, are two sets of blocks of elements which ...