host ::
| Hlavní stránka > Konferenční materiály > Příspěvky z konference > On attempts to characterize facet-defining inequalities of the cone of exact games |
Název:
On attempts to characterize facet-defining inequalities of the cone of exact games
Autoři: Studený, Milan ; Kroupa, Tomáš ; Kratochvíl, Václav
Typ dokumentu: Příspěvky z konference
Konference/Akce: Workshop on Uncertainty Processing (WUPES’18), Třeboň (CZ), 20180606
Rok: 2018
Jazyk: eng
Abstrakt: The sets of balanced, totally balanced, exact and supermodular games play an important role in cooperative game theory. These sets of games are known to be polyhedral cones. The (unique) non-redundant description of these cones by means of the so-called facet-defining inequalities is known in cases of balanced games and supermodular games, respectively. The facet description of the cones of exact games and totally balanced games are not known and we present conjectures about what are the facet-defining inequalities for these cones. We introduce the concept of an irreducible min-balanced set system and conjecture that the facet-defining inequalities for the cone of totally balanced games correspond to these set systems. The conjecture concerning exact games is that the facet-defining inequalities for this cone are those which correspond to irreducible min-balanced systems on strict subsets of the set of players and their conjugate inequalities. A consequence of the validity of the conjectures would be a novel result saying that a game m is exact if and only if m and its reflection are totally balanced.
Klíčová slova: balanced; exact game; extremity; irreducible
Číslo projektu: GA16-12010S (CEP)
Poskytovatel projektu: GA ČR
Zdrojový dokument: Proceedings of the 11th Workshop on Uncertainty Processing (WUPES’18), ISBN 978-80-7378-361-7
Instituce: Ústav teorie informace a automatizace AV ČR (web)
Informace o dostupnosti dokumentu: Dokument je dostupný na externích webových stránkách.
Externí umístění souboru: http://library.utia.cas.cz/separaty/2018/MTR/studeny-0490915.pdf
Původní záznam: http://hdl.handle.net/11104/0285278
Trvalý odkaz NUŠL: http://www.nusl.cz/ntk/nusl-383516
Záznam je zařazen do těchto sbírek:
Věda a výzkum > AV ČR > Ústav teorie informace a automatizace
Konferenční materiály > Příspěvky z konference
Autoři: Studený, Milan ; Kroupa, Tomáš ; Kratochvíl, Václav
Typ dokumentu: Příspěvky z konference
Konference/Akce: Workshop on Uncertainty Processing (WUPES’18), Třeboň (CZ), 20180606
Rok: 2018
Jazyk: eng
Abstrakt: The sets of balanced, totally balanced, exact and supermodular games play an important role in cooperative game theory. These sets of games are known to be polyhedral cones. The (unique) non-redundant description of these cones by means of the so-called facet-defining inequalities is known in cases of balanced games and supermodular games, respectively. The facet description of the cones of exact games and totally balanced games are not known and we present conjectures about what are the facet-defining inequalities for these cones. We introduce the concept of an irreducible min-balanced set system and conjecture that the facet-defining inequalities for the cone of totally balanced games correspond to these set systems. The conjecture concerning exact games is that the facet-defining inequalities for this cone are those which correspond to irreducible min-balanced systems on strict subsets of the set of players and their conjugate inequalities. A consequence of the validity of the conjectures would be a novel result saying that a game m is exact if and only if m and its reflection are totally balanced.
Klíčová slova: balanced; exact game; extremity; irreducible
Číslo projektu: GA16-12010S (CEP)
Poskytovatel projektu: GA ČR
Zdrojový dokument: Proceedings of the 11th Workshop on Uncertainty Processing (WUPES’18), ISBN 978-80-7378-361-7
Instituce: Ústav teorie informace a automatizace AV ČR (web)
Informace o dostupnosti dokumentu: Dokument je dostupný na externích webových stránkách.
Externí umístění souboru: http://library.utia.cas.cz/separaty/2018/MTR/studeny-0490915.pdf
Původní záznam: http://hdl.handle.net/11104/0285278
Trvalý odkaz NUŠL: http://www.nusl.cz/ntk/nusl-383516
Záznam je zařazen do těchto sbírek:
Věda a výzkum > AV ČR > Ústav teorie informace a automatizace
Konferenční materiály > Příspěvky z konference
Záznam vytvořen dne 2018-07-30, naposledy upraven 2021-11-24.