bibtype J - Journal Article
ARLID 0556097
utime 20230418204736.9
mtime 20220329235959.9
SCOPUS 85124749808
WOS 000757714500001
DOI 10.1007/s00186-022-00770-4
title (primary) (eng) Facets of the cone of exact games
specification
page_count 46 s.
media_type P
serial
ARLID cav_un_epca*0254275
ISSN 1432-2994
title Mathematical Methods of Operations Research
volume_id 95
volume 1 (2022)
page_num 35-80
publisher
name Springer
keyword coalitional game
keyword exact game
keyword totally balanced game
keyword anti-dual of a game
keyword semi-balanced set system
keyword indecomposable min-semi-balanced system
author (primary)
ARLID cav_un_auth*0101202
name1 Studený
name2 Milan
institution UTIA-B
full_dept (cz) Matematická teorie rozhodování
full_dept (eng) Department of Decision Making Theory
department (cz) MTR
department (eng) MTR
full_dept Department of Decision Making Theory
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0216188
name1 Kratochvíl
name2 Václav
institution UTIA-B
full_dept (cz) Matematická teorie rozhodování
full_dept Department of Decision Making Theory
department (cz) MTR
department MTR
full_dept Department of Decision Making Theory
country CZ
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
source
url http://library.utia.cas.cz/separaty/2022/MTR/studeny-0556097.pdf
source
url https://link.springer.com/article/10.1007/s00186-022-00770-4
cas_special
project
project_id GA19-04579S
agency GA ČR
country CZ
ARLID cav_un_auth*0380558
abstract (eng) 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.\n\nMore 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 second 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 cone of exact games and for the cone of totally balanced games.
result_subspec WOS
RIV BA
FORD0 10000
FORD1 10100
FORD2 10101
reportyear 2023
num_of_auth 2
inst_support RVO:67985556
permalink http://hdl.handle.net/11104/0330491
confidential S
mrcbC86 n.a. Article Operations Research Management Science|Mathematics Applied
mrcbC91 C
mrcbT16-e MATHEMATICSAPPLIED|OPERATIONSRESEARCHMANAGEMENTSCIENCE
mrcbT16-j 0.508
mrcbT16-s 0.554
mrcbT16-D Q3
mrcbT16-E Q3
arlyear 2022
mrcbU14 85124749808 SCOPUS
mrcbU24 PUBMED
mrcbU34 000757714500001 WOS
mrcbU63 cav_un_epca*0254275 Mathematical Methods of Operations Research 1432-2994 1432-5217 Roč. 95 č. 1 2022 35 80 Springer