<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/"
    xmlns:cc="http://web.resource.org/cc/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
	<channel rdf:about="http://www.mdpi.com/rss/special_issue/epistemic-gt">
		<title>Games: Epistemic Game Theory and Modal Logic</title>
		<link>http://www.mdpi.com/journal/games/special_issues/epistemic-gt/</link>
		<description>Dear Colleagues,
The contemporary culture of game theorists and experimentalists was formed in the period 1980-1995, and is virtually free of understanding of the role of the modal logic of knowledge and belief in evaluating models of rational behavior and their equilibrium properties. There is, of course, a specialized literature, including Nobel prize recipient Robert Aumann and his students, but this is ill-understood and indeed widely ignored outside this circle of experts. As a result, most economists simply do no know what the implications of rationality really are. I want papers in this special issue to show the relevance of epistemic game theory for the working economist and experimentalist. I tried to go some distance towards this goal in my recent book, The Bounds of Reason (Princeton, 2009), but there is much work to be done and much misinformation to be corrected.
Prof. Dr. Herbert Gintis  Guest Editor
{snippet name="submission_info"}</description>
								<items>
			<rdf:Seq>
							<rdf:li rdf:resource="http://www.mdpi.com/2073-4336/2/1/52/" />
            				<rdf:li rdf:resource="http://www.mdpi.com/2073-4336/1/4/478/" />
            				<rdf:li rdf:resource="http://www.mdpi.com/2073-4336/1/4/415/" />
            				<rdf:li rdf:resource="http://www.mdpi.com/2073-4336/1/4/381/" />
            				<rdf:li rdf:resource="http://www.mdpi.com/2073-4336/1/3/168/" />
                    	</rdf:Seq>
		</items>
				<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
	</channel>
	<item rdf:about="http://www.mdpi.com/2073-4336/2/1/52/">
	<title>Games, Vol. 2, Pages 52-86: Toward a Theory of Play: A Logical Perspective on Games and Interaction</title>
	<link>http://www.mdpi.com/2073-4336/2/1/52/</link>
	<description>Logic and game theory have had a few decades of contacts by now, with the classical results of epistemic game theory as major high-lights. In this paper, we emphasize a recent new perspective toward “logical dynamics”, designing logical systems that focus on the actions that change information, preference, and other driving forces of agency. We show how this dynamic turn works out for games, drawing on some recent advances in the literature. Our key examples are the long-term dynamics of information exchange, as well as the much-discussed issue of extensive game rationality. Our paper also proposes a new broader interpretation of what is happening here. The combination of logic and game theory provides a fine-grained perspective on information and interaction dynamics, and we are witnessing the birth of something new which is not just logic, nor just game theory, but rather a Theory of Play.</description>
	
	<guid>http://www.mdpi.com/2073-4336/2/1/52/</guid>
	<pubDate>Wed, 16 Feb 2011 00:00:00 CET</pubDate>
	
	<prism:publicationName>Games</prism:publicationName>
	<prism:publicationDate>2011-02-16</prism:publicationDate>
	<prism:volume>2</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>52</prism:startingPage>
		<prism:endingPage>86</prism:endingPage>
		<prism:issn>2073-4336</prism:issn>
	
	<dc:title>Toward a Theory of Play: A Logical Perspective on Games and Interaction</dc:title>
	<dc:date>2011-02-16</dc:date>
	<dc:identifier>doi: 10.3390/g2010052</dc:identifier>
		<dc:creator>Johan Van Benthem</dc:creator>
		<dc:creator>Eric Pacuit</dc:creator>
		<dc:creator>Olivier Roy</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>
	<item rdf:about="http://www.mdpi.com/2073-4336/1/4/478/">
	<title>Games, Vol. 1, Pages 478-526: A Modal Logic of Epistemic Games</title>
	<link>http://www.mdpi.com/2073-4336/1/4/478/</link>
	<description>We propose some variants of a multi-modal of joint action, preference and knowledge that support reasoning about epistemic games in strategic form. The first part of the paper deals with games with complete information. We first provide syntactic proofs of some well-known theorems in the area of interactive epistemology that specify some sufficient epistemic conditions of equilibrium notions such as Nash equilibrium and Iterated Deletion of Strictly Dominated Strategies (IDSDS). Then, we present a variant of the logic extended with dynamic operators of Dynamic Epistemic Logic (DEL). We show that it allows to express the notion IDSDS in a more compact way. The second part of the paper deals with games with weaker forms of complete information. We first discuss several assumptions on different aspects of perfect information about the game structure (e.g., the assumption that a player has perfect knowledge about the players’ strategy sets or about the preference orderings over strategy profiles), and show that every assumption is expressed by a corresponding logical axiom of our logic. Then we provide a proof of Harsanyi’s claim that all uncertainty about the structure of a game can be reduced to uncertainty about payoffs. Sound and complete axiomatizations of the logics are given, as well as some complexity results for the satisfiability problem.</description>
	
	<guid>http://www.mdpi.com/2073-4336/1/4/478/</guid>
	<pubDate>Tue, 02 Nov 2010 00:00:00 CET</pubDate>
	
	<prism:publicationName>Games</prism:publicationName>
	<prism:publicationDate>2010-11-02</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>478</prism:startingPage>
		<prism:endingPage>526</prism:endingPage>
		<prism:issn>2073-4336</prism:issn>
	
	<dc:title>A Modal Logic of Epistemic Games</dc:title>
	<dc:date>2010-11-02</dc:date>
	<dc:identifier>doi: 10.3390/g1040478</dc:identifier>
		<dc:creator>Emiliano Lorini</dc:creator>
		<dc:creator>François Schwarzentruber</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>
	<item rdf:about="http://www.mdpi.com/2073-4336/1/4/415/">
	<title>Games, Vol. 1, Pages 415-421: Consistent Beliefs in Extensive Form Games</title>
	<link>http://www.mdpi.com/2073-4336/1/4/415/</link>
	<description>We introduce consistency of beliefs in the space of hierarchies of conditional beliefs (Battigalli and Siniscalchi) and use it to provide epistemic conditions for equilibria in finite multi-stage games with observed actions.</description>
	
	<guid>http://www.mdpi.com/2073-4336/1/4/415/</guid>
	<pubDate>Wed, 20 Oct 2010 00:00:00 CEST</pubDate>
	
	<prism:publicationName>Games</prism:publicationName>
	<prism:publicationDate>2010-10-20</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>415</prism:startingPage>
		<prism:endingPage>421</prism:endingPage>
		<prism:issn>2073-4336</prism:issn>
	
	<dc:title>Consistent Beliefs in Extensive Form Games</dc:title>
	<dc:date>2010-10-20</dc:date>
	<dc:identifier>doi: 10.3390/g1040415</dc:identifier>
		<dc:creator>Paulo Barelli</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>
	<item rdf:about="http://www.mdpi.com/2073-4336/1/4/381/">
	<title>Games, Vol. 1, Pages 381-394: The Role of Monotonicity in the Epistemic Analysis of Strategic Games</title>
	<link>http://www.mdpi.com/2073-4336/1/4/381/</link>
	<description>It is well-known that in finite strategic games true common belief (or common knowledge) of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. We establish a general theorem that deals with monotonic rationality notions and arbitrary strategic games and allows to strengthen the above result to arbitrary games, other rationality notions, and transfinite iterations of the elimination process. We also clarify what conclusions one can draw for the customary dominance notions that are not monotonic. The main tool is Tarski’s Fixpoint Theorem.</description>
	
	<guid>http://www.mdpi.com/2073-4336/1/4/381/</guid>
	<pubDate>Fri, 08 Oct 2010 00:00:00 CEST</pubDate>
	
	<prism:publicationName>Games</prism:publicationName>
	<prism:publicationDate>2010-10-08</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>4</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>381</prism:startingPage>
		<prism:endingPage>394</prism:endingPage>
		<prism:issn>2073-4336</prism:issn>
	
	<dc:title>The Role of Monotonicity in the Epistemic Analysis of Strategic Games</dc:title>
	<dc:date>2010-10-08</dc:date>
	<dc:identifier>doi: 10.3390/g1040381</dc:identifier>
		<dc:creator>Krzysztof R. Apt</dc:creator>
		<dc:creator>Jonathan A. Zvesper</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>
	<item rdf:about="http://www.mdpi.com/2073-4336/1/3/168/">
	<title>Games, Vol. 1, Pages 168-188: Backward Induction versus Forward Induction Reasoning</title>
	<link>http://www.mdpi.com/2073-4336/1/3/168/</link>
	<description>In this paper we want to shed some light on what we mean by backward induction and forward induction reasoning in dynamic games. To that purpose, we take the concepts of common belief in future rationality (Perea [1]) and extensive form rationalizability (Pearce [2], Battigalli [3], Battigalli and Siniscalchi [4]) as possible representatives for backward induction and forward induction reasoning. We compare both concepts on a conceptual, epistemic and an algorithm level, thereby highlighting some of the crucial differences between backward and forward induction reasoning in dynamic games.</description>
	
	<guid>http://www.mdpi.com/2073-4336/1/3/168/</guid>
	<pubDate>Fri, 02 Jul 2010 00:00:00 CEST</pubDate>
	
	<prism:publicationName>Games</prism:publicationName>
	<prism:publicationDate>2010-07-02</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>168</prism:startingPage>
		<prism:endingPage>188</prism:endingPage>
		<prism:issn>2073-4336</prism:issn>
	
	<dc:title>Backward Induction versus Forward Induction Reasoning</dc:title>
	<dc:date>2010-07-02</dc:date>
	<dc:identifier>doi: 10.3390/g1030168</dc:identifier>
		<dc:creator> Perea</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>


<cc:License rdf:about="http://creativecommons.org/licenses/by/3.0/">
	<cc:permits rdf:resource="http://creativecommons.org/ns#Reproduction" />
	<cc:permits rdf:resource="http://creativecommons.org/ns#Distribution" />
	<cc:permits rdf:resource="http://creativecommons.org/ns#DerivativeWorks" />
</cc:License>

</rdf:RDF>
