10 citations · 21 across the 6 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011★ 1 cited
Recoverable Values for Independent Sets
Uriel Feige, Daniel Reichman
The notion of {\em recoverable value} was advocated in work of Feige, Immorlica, Mirrokni and Nazerzadeh [Approx 2009] as a measure of quality for approximation algorithms. There t…
cs.GT2011★ 2 cited
Mechanism design with uncertain inputs (to err is human, to forgive divine)
Uriel Feige, Moshe Tennenholtz
We consider a task of scheduling with a common deadline on a single machine. Every player reports to a scheduler the length of his job and the scheduler needs to finish as many job…