<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0428518</ARLID> <utime>20240103204254.9</utime><mtime>20140819235959.9</mtime>   <WOS>000337859600009</WOS> <SCOPUS>84901817738</SCOPUS>  <DOI>10.1016/j.ijar.2014.04.009</DOI>           <title language="eng" primary="1">Optimal strategic reasoning with McNaughton functions</title>  <specification> <page_count>11 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0256774</ARLID><ISSN>0888-613X</ISSN><title>International Journal of Approximate Reasoning</title><part_num/><part_title/><volume_id>55</volume_id><volume>6 (2014)</volume><page_num>1458-1468</page_num><publisher><place/><name>Elsevier</name><year/></publisher></serial>    <keyword>Lukasiewicz logic</keyword>   <keyword>McNaughton function</keyword>   <keyword>Infinite game</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101141</ARLID> <name1>Kroupa</name1> <name2>Tomáš</name2> <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> <institution>UTIA-B</institution> <full_dept>Department of Decision Making Theory</full_dept>  <share>50</share> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0284110</ARLID> <name1>Majer</name1> <name2>Ondrej</name2> <full_dept language="cz">Oddělení teoretické informatiky</full_dept> <full_dept>Department of Theoretical Computer Science</full_dept> <institution>UIVT-O</institution> <full_dept>Department of Theoretical Computer Science</full_dept>  <share>50</share> <fullinstit>Ústav informatiky AV ČR, v. v. i.</fullinstit> </author>        <cas_special> <project> <project_id>GAP402/12/1309</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0284931</ARLID> </project>  <abstract language="eng" primary="1">The aim of the paper is to explore strategic reasoning in strategic games of two players with an uncountably infinite space of strategies the payoff of which is given by McNaughton functions—functions on the unit interval which are piecewise linear with integer coefficients. We give a sufficient condition for finite equilibria and we propose an algorithm for recovering the corresponding equilibrium strategies.</abstract>     <reportyear>2015</reportyear>  <RIV>BA</RIV>     <unknown tag="mrcbC52"> 4 A 4a 20231122140243.2 </unknown> <inst_support> RVO:67985556 </inst_support> <inst_support> RVO:67985807 </inst_support>  <permalink>http://hdl.handle.net/11104/0235482</permalink>   <confidential>S</confidential>         <unknown tag="mrcbT16-e">COMPUTERSCIENCEARTIFICIALINTELLIGENCE</unknown> <unknown tag="mrcbT16-j">0.683</unknown> <unknown tag="mrcbT16-s">1.460</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-B">58.39</unknown> <unknown tag="mrcbT16-C">81.707</unknown> <unknown tag="mrcbT16-D">Q2</unknown> <unknown tag="mrcbT16-E">Q1</unknown> <arlyear>2014</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: a0428518.pdf </unknown>    <unknown tag="mrcbU14"> 84901817738 SCOPUS </unknown> <unknown tag="mrcbU34"> 000337859600009 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 55 č. 6 2014 1458 1468 Elsevier </unknown> </cas_special> </bibitem>