Calls for Papers - Journal Submissions
Call for papers for submission to the
The International Journal of Game Theory (IJGT) encourages
submissions of significant papers in Combinatorial Game
Theory, and has invited Aviezri Fraenkel to its Editorial
Board to deal with these submissions.
International Journal of Game Theory
in the area of Combinatorial Games
IJGT, founded in 1971, has a long tradition of publishing papers in game theory with significant mathematical content. Combinatorial Game Theory has developed into a field with advanced mathematical and computational complexity techniques and a number of challenging open questions, where new results will nicely fit with and complement the scope of IJGT.
Combinatorial games are typically two-player games with perfect information and ``win'', ``lose'', and ``draw'' or ``tie'' as possible outcomes, and an underlying mathematical structure. This is in contrast to games involving chance and lack of information such as Poker, which are central to ``classical'' game theory.
A basic combinatorial game is Nim, given by a number of heaps of chips where players alternately remove some chips from one of those heaps, and the last player to move wins. Over a century ago, it was shown how to play Nim optimally using the binary representation of the heap sizes. This method can be extended to ``impartial'' games where the available moves from any position do not depend on the player to move. An important algebraic structure is the ``sum'' of games where a player can move in one of several independent parts of the game. Such decompositions are important, for example, to improve algorithms for playing endgames of the board game Go where humans still highly outperform computers.
Recent progress in Combinatorial Game Theory concern difficult questions on partizan (not impartial) games such as chess, misère play (where the last player to move loses) and interactions of game tokens, both of which conflict with the ``sum'' of games, and computational hardness questions.
The classical book on combinatorial games is ``Winning ways'' by Berlekamp, Conway, and Guy from 1982, recently republished. As shown by Conway, all two-player games can be constructed by a simple Dedekind-reminiscent cut, with a rich mathematical theory. All real numbers are a subset of the set of all games. Many challenging questions concern the computational complexity of optimal play, given a particular game specification.
Given the advanced development and mathematical depth of Combinatorial Game Theory, its significant papers will be a welcome contribution to IJGT. We hope that IJGT will be considered as the premier publication outlet by the Combinatorial Game Theory community.
1 July 2011
Shmuel Zamir, Editor, and
Bernhard von Stengel, Co-Editor of IJGT
For further information and questions, please contact Bernhard von Stengel at email@example.com
Call for Papers: Dynamic Games and Applications -
Special Issue on Stochastic Games
Guest Editors:Andrzej Nowak, University of Zielona Góra, A.Nowak@wmie.uz.zgora.pl
Eilon Solan, Tel Aviv University, firstname.lastname@example.org
Sylvain Sorin, Université Pierre et Marie Curie, email@example.com
To celebrate the 60th anniversary of the seminal paper of L.S. Shapley in 1953, Dynamic Games and Applications will publish in 2013 a special issue on stochastic games. Shapley's Stochastic Games paper has had a tremendous scientific impact, and there is still a very active research on this area, and in particular in:
- zero-sum repeated games and Shapley operator, asymptotic and uniform approach
- games with signals and link to incomplete information games
- non zero-sum games : asymptotic and uniform approach
- Nash and correlated equilibria
- link with quitting and stopping games
- infinite stochastic games
- algorithms and dynamics for stochastic games
- applications in, e.g., biology, computer science, economics, finance, transportation
Submission Deadline: March 2012
Publication Date: March 2013 (first issue of Volume 3 of DGAA)
For submission instructions, please visit: