<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0347865</ARLID> <utime>20240103193928.4</utime><mtime>20101103235959.9</mtime>   <WOS>000287979900064</WOS>         <title language="eng" primary="1">Pexeso ("Concentration game") as an arbiter of bounded-rationality models</title>  <specification> <page_count>4 s.</page_count> </specification>    <serial><ARLID>cav_un_epca*0346970</ARLID><ISBN>978-80-7394-218-2</ISBN><title>Proceedings of the 28th International Conference on Mathematical Methods in Economics 2010</title><part_num/><part_title/><page_num>337-380</page_num><publisher><place>České Budějovice</place><name>University of South Bohemia</name><year>2010</year></publisher><editor><name1>Houda</name1><name2>M.</name2></editor><editor><name1>Friebelová</name1><name2>J.</name2></editor></serial>    <keyword>Concentration game</keyword>   <keyword>pexeso</keyword>   <keyword>perfect players</keyword>    <author primary="1"> <ARLID>cav_un_auth*0264564</ARLID> <name1>Kuběna</name1> <name2>Aleš Antonín</name2> <full_dept language="cz">Ekonometrie</full_dept> <full_dept language="eng">Department of Econometrics</full_dept> <department language="cz">E</department> <department language="eng">E</department> <institution>UTIA-B</institution> <full_dept>Department of Econometrics</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2010/E/kubena-pexeso (concentration game) as an arbiter of bounded-rationality models.pdf</url> </source>        <cas_special> <project> <project_id>GD402/09/H045</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0253998</ARLID> </project> <research> <research_id>CEZ:AV0Z10750506</research_id> </research>  <abstract language="eng" primary="1">Among board games, Pexeso (Concentration game) for two players  is a game almost purely output-oriented, i.e. the optimal play is not given by  strategic plans with long-term horizon (e.g. no short-term tactical sacrifice is  observed). So, the optimal strategy and game dynamics may be calculated  almost analytically, assuming a given rationality restrictions of the players.  In the paper, the optimal strategy for two players is solved using dynamic  programming. Further, it is proved that for rational players, the game would  end with ”stalemate” (the game never ends) with a probability close to 1.  Further, the game dynamics is described if a rationality restriction is given  such that the players perform a random move instead of the optimal one with  probabilities P,Q &gt; 0. In this case, the probability of a stalemate is equal to  zero.</abstract>  <action target="EUR"> <ARLID>cav_un_auth*0264432</ARLID> <name>28-th International Conference on Mathematical Methods in Economics</name> <place>České Budějovice</place> <dates>08.09.2010-10.09.2010</dates>  <country>CZ</country> </action>    <reportyear>2011</reportyear>  <RIV>AH</RIV>      <permalink>http://hdl.handle.net/11104/0188542</permalink>        <arlyear>2010</arlyear>       <unknown tag="mrcbU34"> 000287979900064 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0346970 Proceedings of the 28th International Conference on Mathematical Methods in Economics 2010 978-80-7394-218-2 337 380 České Budějovice University of South Bohemia 2010 </unknown> <unknown tag="mrcbU67"> Houda M. 340 </unknown> <unknown tag="mrcbU67"> Friebelová J. 340 </unknown> </cas_special> </bibitem>