Sciweavers

1599 search results - page 177 / 320
» Algorithms for Parity Games
Sort
View
GECCO
2008
Springer
178views Optimization» more  GECCO 2008»
15 years 7 months ago
Agent Smith: a real-time game-playing agent for interactive dynamic games
The goal of this project is to develop an agent capable of learning and behaving autonomously and making decisions quickly in a dynamic environment. The agent’s environment is a...
Ryan K. Small
TCS
2010
15 years 4 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer
WINE
2010
Springer
251views Economy» more  WINE 2010»
15 years 4 months ago
The Complexity of Equilibria in Cost Sharing Games
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
Vasilis Syrgkanis
EOR
2011
113views more  EOR 2011»
15 years 1 months ago
A relation-algebraic approach to simple games
Simple games are a powerful tool to analyze decision-making and coalition formation in social and political life. In this paper, we present relation-algebraic models of simple game...
Rudolf Berghammer, Stefan Bolus, Agnieszka Rusinow...
JMLR
2010
149views more  JMLR 2010»
15 years 1 months ago
Coherent Inference on Optimal Play in Game Trees
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
Philipp Hennig, David H. Stern, Thore Graepel