Sciweavers

39 search results - page 3 / 8
» Solving Probabilistic Combinatorial Games
Sort
View
JCSS
2008
96views more  JCSS 2008»
13 years 5 months ago
A combinatorial characterization of resolution width
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
Albert Atserias, Víctor Dalmau
CSL
2003
Springer
13 years 11 months ago
Simple Stochastic Parity Games
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
ANTSW
2004
Springer
13 years 11 months ago
S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
Walter J. Gutjahr
AAAI
2010
13 years 7 months ago
Security Games with Arbitrary Schedules: A Branch and Price Approach
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
Manish Jain, Erim Kardes, Christopher Kiekintveld,...
SIGECOM
2004
ACM
112views ECommerce» more  SIGECOM 2004»
13 years 11 months ago
Self-interested automated mechanism design and implications for optimal combinatorial auctions
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
Vincent Conitzer, Tuomas Sandholm