Theory of Combinatorial Games
نویسندگان
چکیده
Aim: To present a systematic development of the theory of combinatorial games from the ground up. Approach: Computational complexity. Combinatorial games are completely determined; the questions of interest are efficiencies of strategies. Methodology: Divide and conquer. Ascend from Nim to Chess in small strides at a gradient that’s not too steep. Presentation: Largely informal; examples of combinatorial games sampled from various strategic viewing points along scenic mountain trails illustrate the theory.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملA review on symmetric games: theory, comparison and applications
Game theory models decision makers' behaviors in strategic situations. Since the structures of games are different, behavior and preferences of the players are different in various types of game. This paper reviews various situations of games. Here, characteristics of some common games are discussed and compared. Specifically, we focus on a group of games called symmetric games including Prison...
متن کاملCombinatorial Structures to Modeling Simple Games and Applications
We connect three different topics: combinatorial structures, game theory and chemistry. In particular, we establish the bases to represent some simple games, defined as influence games, and molecules, defined from atoms, by using combinatorial structures. First, we characterize simple games as influence games using influence graphs. It let us to modeling simple games as combinatorial structures...
متن کاملAppendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory
This is list of combinatorial games problems collected at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory, organized by the authors. For more unsolved problems in combinatorial games see the list of unsolved problems [4] and its successors in Games of No Chance [5] and in More Games of No Chance [7], hereafter referred to as MGONC. An on-line version can be found on David Wol...
متن کاملCombinatorial Games on Graphs
The theory of combinatorial games is a rapidly developing subject of modern combinatorics. It is concerned with the study of certain twoplayer-games, ranging from popular games as Tic-Tac-Toe and Connect Four to merely abstract games defined in graph-theoretic terms. Besides being of interest on their own right, combinatorial games are strongly connected to other areas of combinatorics, such as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012