Sciweavers

108 search results - page 18 / 22
» mor 2006
Sort
View
MOR
2010
98views more  MOR 2010»
14 years 8 months ago
Sharing the Cost of a Capacity Network
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
Anna Bogomolnaia, Ron Holzman, Hervé Moulin
MOR
2010
118views more  MOR 2010»
14 years 8 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
MOR
2006
79views more  MOR 2006»
14 years 10 months ago
The Value of Markov Chain Games with Lack of Information on One Side
We consider a two-player zero-sum game given by a Markov chain over a finite set of states K and a family of zero-sum matrix games (Gk)kK. The sequence of states follows the Marko...
Jérôme Renault
MOR
2006
81views more  MOR 2006»
14 years 10 months ago
Simulated Annealing for Convex Optimization
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
Adam Tauman Kalai, Santosh Vempala
MOR
2006
80views more  MOR 2006»
14 years 10 months ago
Regret Minimization Under Partial Monitoring
We consider repeated games in which the player, instead of observing the action chosen by the opponent in each game round, receives a feedback generated by the combined choice of ...
Nicolò Cesa-Bianchi, Gábor Lugosi, G...