Sciweavers

205 search results - page 12 / 41
» An Algorithmic Analysis of the Honey-Bee Game
Sort
View
SIGECOM
2009
ACM
100views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
The price of uncertainty
We study the degree to which small fluctuations in costs in wellstudied potential games can impact the result of natural best-response and improved-response dynamics. We call thi...
Maria-Florina Balcan, Avrim Blum, Yishay Mansour
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
14 years 2 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
ATAL
2001
Springer
14 years 1 months ago
A Stable and Feasible Payoff Division for Coalition Formation in a Class of Task Oriented Domains
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
María-Victoria Belmonte, Ricardo Conejo, Jo...
ATAL
2006
Springer
14 years 11 days ago
A novel method for automatic strategy acquisition in N-player non-zero-sum games
We present a novel method for automatically acquiring strategies for the double auction by combining evolutionary optimization together with a principled game-theoretic analysis. ...
Steve Phelps, Marek Marcinkiewicz, Simon Parsons
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 8 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...