Sciweavers

5995 search results - page 298 / 1199
» Algorithmic Game Theory
Sort
View
AIIDE
2008
15 years 9 months ago
Agent Learning using Action-Dependent Learning Rates in Computer Role-Playing Games
We introduce the ALeRT (Action-dependent Learning Rates with Trends) algorithm that makes two modifications to the learning rate and one change to the exploration rate of traditio...
Maria Cutumisu, Duane Szafron, Michael H. Bowling,...
ATAL
2008
Springer
15 years 8 months ago
Searching for approximate equilibria in empirical games
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
Patrick R. Jordan, Yevgeniy Vorobeychik, Michael P...
EC
2007
167views ECommerce» more  EC 2007»
15 years 6 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
16 years 1 months ago
On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design
In this paper we study a large class of resource allocation problems with an important complication, the utilization cost of a given resource is private information of a profit ma...
José R. Correa, Nicolas Figueroa
SAGT
2009
Springer
177views Game Theory» more  SAGT 2009»
16 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...