1062 search results - page 122 / 213 » Network games |
123
click to vote
IOR
2007
15 years 4 months ago
2007
We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...
125
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
166
click to vote
SAGA
2007
Springer
15 years 10 months ago
2007
Springer
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
136
click to vote
AAAI
1996
15 years 5 months ago
1996
This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent inform...
120
click to vote
SPAA
2006
ACM
15 years 10 months ago
2006
ACM
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...