MANSCI
2007
13 years 4 months ago
2007
This paper studies the impact of competition on a firm’s choice of technology (product-flexible or product-dedicated) and capacity investment decisions. Specifically, we mode...
KBS
2007
13 years 4 months ago
2007
In this paper we present our design tool GUIDE, which allows the user to explore a design in UML interactively by playing a game. The game incorporates both the design model and a...
JCP
2007
13 years 4 months ago
2007
Abstract— In this paper, we develop a mixed-initiative intelligent tutor for the game of Sudoku called MITS. We begin by developing a characterization of the strategies used in S...
JACM
2007
13 years 4 months ago
2007
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
TEDU
2008
13 years 4 months ago
2008
The Killer Phrase game is a digital role-playing game where the player is the moderator of a discussion between two debating robots. In this article, the design steps for the creat...
TCS
2008
13 years 4 months ago
2008
We investigate the role of the information available to the players on the outcome of the cops and robbers game. This game takes place on a graph and players move along the edges ...
TCS
2008
13 years 4 months ago
2008
We introduce a new combinatorial game between two players: Magnus and Derek. Initially, a token is placed at position 0 on a round table with n positions. In each round of the gam...
AML
2005
13 years 4 months ago
2005
The canonical function game is a game of length 1 introduced by W. Hugh Woodin which falls inside a class of games known as Neeman games. Using large cardinals, we show that it is...
AIM
2005
13 years 4 months ago
2005
A General Game Playing System is one that can accept a formal description of a game and play the game effectively without human intervention. Unlike specialized game players, such...
SIAMDM
2008
13 years 4 months ago
2008
Let m and b be positive integers and let F be a hypergraph. In an (m, b) Maker-Breaker game F two players, called Maker and Breaker, take turns selecting previously unclaimed vert...