178
click to vote
FOCS
15 years 8 months ago
2007 IEEE 
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
158
click to vote
FOCS
15 years 10 months ago
2007 IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
163
click to vote
FOCS
15 years 10 months ago
2007 IEEE 
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
128
click to vote
FOCS
15 years 10 months ago
2007 IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
|
Theoretical Computer Science