<?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/game-theory">
		<title>Algorithms: Algorithmic Game Theory</title>
		<link>http://www.mdpi.com/journal/algorithms/special_issues/game-theory/</link>
		<description>Related MDPI Journal: Games
Submission
All papers should be submitted to algorithms@mdpi.com. To be published continuously until the deadline and papers will be listed together at the special issue website.

Submitted papers should not have been published nor be under consideration for publication elsewhere. All papers are refereed through a peer-review process. A guide for authors is available on the Instructions for Authors page. Algorithms is an international peer-reviewed quarterly journal published by MDPI.
Article Processing Charges (APC) will be waived for well prepared manuscripts of invited papers. For the first three volumes of this new journal the APC are of 300 CHF (or 550 CHF per paper for those papers that require extensive additional formatting and/or English corrections) for papers submitted before 31 December 2010.</description>
								<items>
			<rdf:Seq>
							<rdf:li rdf:resource="http://www.mdpi.com/1999-4893/3/3/244/" />
                    	</rdf:Seq>
		</items>
				<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
	</channel>
	<item rdf:about="http://www.mdpi.com/1999-4893/3/3/244/">
	<title>Algorithms, Vol. 3, Pages 244-254: An O(n)-Round Strategy for the Magnus-Derek Game</title>
	<link>http://www.mdpi.com/1999-4893/3/3/244/</link>
	<description>We analyze further the Magnus-Derek game, a two-player game played on a round table with n positions. The players jointly control the movement of a token. One player, Magnus, aims to maximize the number of positions visited while minimizing the number of rounds. The other player, Derek, attempts to minimize the number of visited positions. We present a new strategy for Magnus that succeeds in visiting the maximal number of positions in 3(n – 1) rounds, which is the optimal number of rounds up to a constant factor.</description>
	
	<guid>http://www.mdpi.com/1999-4893/3/3/244/</guid>
	<pubDate>Thu, 15 Jul 2010 00:00:00 CEST</pubDate>
	
	<prism:publicationName>Algorithms</prism:publicationName>
	<prism:publicationDate>2010-07-15</prism:publicationDate>
	<prism:volume>3</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>244</prism:startingPage>
		<prism:endingPage>254</prism:endingPage>
		<prism:issn>1999-4893</prism:issn>
	
	<dc:title>An O(n)-Round Strategy for the Magnus-Derek Game</dc:title>
	<dc:date>2010-07-15</dc:date>
	<dc:identifier>doi: 10.3390/a3030244</dc:identifier>
		<dc:creator> Nedev</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>
