Sciweavers

128 search results - page 8 / 26
» Computing optimal strategies to commit to in extensive-form ...
Sort
View
AI
2010
Springer
14 years 6 months ago
Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
James Pita, Manish Jain, Milind Tambe, Fernando Or...
RAS
2002
115views more  RAS 2002»
14 years 9 months ago
Performance evaluation and optimization of human control strategy
Modeling human control strategy (HCS) is becoming an increasingly popular paradigm in a number of different research areas, ranging from robotics and intelligent vehicle highway s...
Yangsheng Xu, Jingyan Song, Michael C. Nechyba, Ye...
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
15 years 3 months ago
Trap Avoidance in Strategic Computer Game Playing with Case Injected Genetic Algorithms
Abstract. We use case injected genetic algorithms to learn to competently play computer strategy games. Such games are characterized by player decision in anticipation of opponent ...
Chris Miles, Sushil J. Louis, Rich Drewes
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
15 years 3 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 1 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...