Sciweavers

44 search results - page 8 / 9
» Domination Game and an Imagination Strategy
Sort
View
ACG
2009
Springer
14 years 1 months ago
Evaluation Function Based Monte-Carlo LOA
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In the game of Lines of Action (LOA), which has been dominated in the past by αβ, M...
Mark H. M. Winands, Yngvi Björnsson
CEC
2007
IEEE
14 years 1 months ago
Evolving cooperation in the non-iterated prisoner's dilemma: A social network inspired approach
— Online service provision is becoming increasingly decentralized as system designers pursue the benefits gained from utilizing nodes at the periphery of the network. However, d...
T. S. Ellis, X. Yao
SAGT
2009
Springer
177views Game Theory» more  SAGT 2009»
14 years 1 months ago
Characterizing Incentive Compatibility for Convex Valuations
We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
André Berger, Rudolf Müller, Seyed Hos...
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
14 years 22 days ago
Better Spread and Convergence: Particle Swarm Multiobjective Optimization Using the Maximin Fitness Function
Maximin strategy has its origin in game theory, but it can be adopted for effective multiobjective optimization. This paper proposes a particle swarm multiobjective optimiser, max...
Xiaodong Li
ATAL
2006
Springer
13 years 11 months ago
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation
Abstract. We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to retain much of their private valuation information, yet generates close-...
Tuomas Sandholm, Andrew Gilpin