Sciweavers

39 search results - page 6 / 8
» Solving Probabilistic Combinatorial Games
Sort
View
CG
2006
Springer
14 years 21 days ago
A Retrograde Approximation Algorithm for One-Player Can't Stop
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
James Glenn, Haw-ren Fang, Clyde P. Kruskal
AAAI
2012
11 years 11 months ago
Security Games for Controlling Contagion
Many strategic actions carry a ‘contagious’ component beyond the immediate locale of the effort itself. Viral marketing and peacekeeping operations have both been observed to ...
Jason Tsai, Thanh H. Nguyen, Milind Tambe
IPPS
2009
IEEE
14 years 3 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
14 years 2 months ago
A stochastic programming approach to scheduling in TAC SCM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
Michael Benisch, Amy R. Greenwald, Victor Narodits...
JAIR
2010
115views more  JAIR 2010»
13 years 7 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech