Sciweavers

8 search results - page 2 / 2
» Strategyproof Approximation of the Minimax on Networks
Sort
View
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
11 years 7 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
TIT
1998
126views more  TIT 1998»
13 years 4 months ago
An Asymptotic Property of Model Selection Criteria
—Probability models are estimated by use of penalized log-likelihood criteria related to AIC and MDL. The accuracies of the density estimators are shown to be related to the trad...
Yuhong Yang, Andrew R. Barron
ATAL
2011
Springer
12 years 5 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...