<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0511152</ARLID> <utime>20240103222930.1</utime><mtime>20191118235959.9</mtime>   <SCOPUS>85066154003</SCOPUS> <WOS>000496600500006</WOS>  <DOI>10.1007/s00186-019-00672-y</DOI>           <title language="eng" primary="1">Facets of the cone of totally balanced games</title>  <specification> <page_count>29 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0254275</ARLID><ISSN>1432-2994</ISSN><title>Mathematical Methods of Operations Research</title><part_num/><part_title/><volume_id>90</volume_id><volume>2 (2019)</volume><page_num>271-300</page_num><publisher><place/><name>Springer</name><year/></publisher></serial>    <keyword>coalitional game</keyword>   <keyword>totally balanced game</keyword>   <keyword>balanced system</keyword>   <keyword>polyhedral cone</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101141</ARLID> <name1>Kroupa</name1> <name2>Tomáš</name2> <institution>UTIA-B</institution> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept language="eng">Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department language="eng">MTR</department> <full_dept>Department of Decision Making Theory</full_dept> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0101202</ARLID> <name1>Studený</name1> <name2>Milan</name2> <institution>UTIA-B</institution> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept>Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department>MTR</department> <full_dept>Department of Decision Making Theory</full_dept> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2019/MTR/kroupa-0511152.pdf</url> </source> <source> <url>https://link.springer.com/article/10.1007%2Fs00186-019-00672-y</url>  </source>        <cas_special> <project> <ARLID>cav_un_auth*0332303</ARLID> <project_id>GA16-12010S</project_id> <agency>GA ČR</agency> <country>CZ</country> </project>  <abstract language="eng" primary="1">The class of totally balanced games is a class of transferable-utility coalitional games providing important models of cooperative behavior used in mathematical economics. They coincide with market games of Shapley and Shubik and every totally balanced game is also representable as the minimum of a finite set of additive games. In this paper we characterize the polyhedral cone of totally balanced games by describing its facets. Our main result is that there is a correspondence between facet-defining inequalities for the cone and the class of special balanced systems of coalitions, the so-called irreducible min-balanced systems. Our method is based on refining the notion of balancedness introduced by Shapley. We also formulate a conjecture about what are the facets of the cone of exact games, which addresses an open problem appearing in the literature.</abstract>     <result_subspec>WOS</result_subspec> <RIV>BA</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10101</FORD2>    <reportyear>2020</reportyear>      <num_of_auth>2</num_of_auth>  <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0302521</permalink>   <confidential>S</confidential>  <unknown tag="mrcbC86"> 3+4 Review Biochemistry Molecular Biology|Chemistry Multidisciplinary </unknown> <unknown tag="mrcbC91"> C </unknown>         <unknown tag="mrcbT16-e">OPERATIONSRESEARCH&amp;MANAGEMENTSCIENCE|MATHEMATICS.APPLIED</unknown> <unknown tag="mrcbT16-f">1.163</unknown> <unknown tag="mrcbT16-g">0.171</unknown> <unknown tag="mrcbT16-h">12.5</unknown> <unknown tag="mrcbT16-i">0.00155</unknown> <unknown tag="mrcbT16-j">0.668</unknown> <unknown tag="mrcbT16-k">1048</unknown> <unknown tag="mrcbT16-q">56</unknown> <unknown tag="mrcbT16-s">0.769</unknown> <unknown tag="mrcbT16-y">32.77</unknown> <unknown tag="mrcbT16-x">1.16</unknown> <unknown tag="mrcbT16-3">190</unknown> <unknown tag="mrcbT16-4">Q2</unknown> <unknown tag="mrcbT16-5">0.963</unknown> <unknown tag="mrcbT16-6">35</unknown> <unknown tag="mrcbT16-7">Q3</unknown> <unknown tag="mrcbT16-B">47.434</unknown> <unknown tag="mrcbT16-C">29.5</unknown> <unknown tag="mrcbT16-D">Q3</unknown> <unknown tag="mrcbT16-E">Q4</unknown> <unknown tag="mrcbT16-M">0.53</unknown> <unknown tag="mrcbT16-N">Q3</unknown> <unknown tag="mrcbT16-P">40.421</unknown> <arlyear>2019</arlyear>       <unknown tag="mrcbU14"> 85066154003 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000496600500006 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0254275 Mathematical Methods of Operations Research 1432-2994 1432-5217 Roč. 90 č. 2 2019 271 300 Springer </unknown> </cas_special> </bibitem>