Sciweavers

849 search results - page 3 / 170
» Search allocation game
Sort
View
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
14 years 8 months ago
On the convergence of regret minimization dynamics in concave games
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
Eyal Even-Dar, Yishay Mansour, Uri Nadav
ACID
2006
298views Algorithms» more  ACID 2006»
13 years 9 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
AAAI
2004
13 years 9 months ago
Simple Search Methods for Finding a Nash Equilibrium
We present two simple search methods for computing a sample Nash equilibrium in a normal-form game: one for 2player games and one for n-player games. We test these algorithms on m...
Ryan Porter, Eugene Nudelman, Yoav Shoham
ATAL
2011
Springer
12 years 7 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
EOR
2008
125views more  EOR 2008»
13 years 7 months ago
Shapley mappings and the cumulative value for n-person games with fuzzy coalitions
In this paper we prove the existence and uniqueness of a solution concept for n-person games with fuzzy coalitions, which we call the Shapley mapping. The Shapley mapping, when it...
Dan Butnariu, Tomás Kroupa