Algorithmic Game Theory

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (31 May 2010) | Viewed by 8125

Special Issue Editor


E-Mail Website
Guest Editor
Department of Computing and Software, Faculty of Engineering, McMaster University, 1280 Main St. West, Hamilton, ON L8S 4K1, Canada
Interests: design and mathematical analysis of algorithms; combinatorial optimization; approximation algorithms; algorithmic game theory; network algorithms

Special Issue Information

Related MDPI Journal: Games

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

241 KiB  
Article
An O(n)-Round Strategy for the Magnus-Derek Game
by Zhivko Nedev
Algorithms 2010, 3(3), 244-254; https://doi.org/10.3390/a3030244 - 15 Jul 2010
Cited by 5 | Viewed by 7503
Abstract
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. [...] Read more.
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. Full article
(This article belongs to the Special Issue Algorithmic Game Theory)
Back to TopTop