<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0508311</ARLID> <utime>20240103222526.7</utime><mtime>20190912235959.9</mtime>   <SCOPUS>85072862282</SCOPUS>  <DOI>10.1007/978-3-030-29765-7_37</DOI>           <title language="eng" primary="1">On irreducible min-balanced set systems</title>  <specification> <page_count>11 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0508310</ARLID><ISBN>978-3-030-29764-0</ISBN><title>Symbolic and Quantitative Approaches to Reasoning with Uncertainty : 15th European Conference, ECSQARU 2019, Belgrade, Serbia, September 18-20, 2019</title><part_num/><part_title/><page_num>444-454</page_num><publisher><place>Cham</place><name>Springer Intenational Publishing</name><year>2019</year></publisher><editor><name1>Kern-Isberner</name1><name2>G.</name2></editor><editor><name1>Ognjanovic</name1><name2>Z.</name2></editor></serial>    <keyword>balanced set system</keyword>   <keyword>irreducible min-balanced system</keyword>   <keyword>totally balanced games</keyword>   <keyword>exact games</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101202</ARLID> <full_dept>Department of Decision Making Theory</full_dept>  <name1>Studený</name1> <name2>Milan</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> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0216188</ARLID> <full_dept>Department of Decision Making Theory</full_dept>  <name1>Kratochvíl</name1> <name2>Václav</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> <country>CZ</country> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0101228</ARLID> <full_dept>Department of Decision Making Theory</full_dept>  <name1>Vomlel</name1> <name2>Jiří</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> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2019/MTR/studeny-0508311.pdf</url> </source>        <cas_special> <project> <ARLID>cav_un_auth*0380558</ARLID> <project_id>GA19-04579S</project_id> <agency>GA ČR</agency> <country>CZ</country> </project>  <abstract language="eng" primary="1">Non-trivial minimal  balanced systems (= collections) of sets are known to characterize through their induced linear inequalities the class of the so-called balanced (coalitional) games. In a recent paper a concept of an irreducible min-balanced (= minimal balanced) system of sets has been introduced and the irreducible systems have been shown to characterize through their induced inequalities the class of totally balanced games. In this paper we recall the relevant concepts and results, relate them to various contexts and offer a catalogue of permutational types of non-trivial min-balanced systems in which the irreducible systems are indicated. The present catalogue involves all types of such systems on sets with at most 5 elements. It has been obtained as a result of an alternative characterization of min-balanced systems.</abstract>    <action target="EUR"> <ARLID>cav_un_auth*0379619</ARLID> <name>European Conference on Symbolic and Quantitative Approaches with Uncertainty (ECSQARU 2019) /15./</name> <dates>20190918</dates> <unknown tag="mrcbC20-s">20190920</unknown> <place>Belgrade</place> <country>RS</country>  </action>  <RIV>BA</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10101</FORD2>    <reportyear>2020</reportyear>      <num_of_auth>3</num_of_auth>  <presentation_type> PR </presentation_type> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0299782</permalink>   <confidential>S</confidential>        <arlyear>2019</arlyear>       <unknown tag="mrcbU14"> 85072862282 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0508310 Symbolic and Quantitative Approaches to Reasoning with Uncertainty : 15th European Conference, ECSQARU 2019, Belgrade, Serbia, September 18-20, 2019 Springer Intenational Publishing 2019 Cham 444 454 978-3-030-29764-0 Lecture Notes in Artificial Intelligence 11726 </unknown> <unknown tag="mrcbU67"> 340 Kern-Isberner G. </unknown> <unknown tag="mrcbU67"> 340 Ognjanovic Z. </unknown> </cas_special> </bibitem>