Sciweavers

22 search results - page 2 / 5
» Approximately Optimal Mechanism Design via Differential Priv...
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 3 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
13 years 12 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
JCSS
2008
138views more  JCSS 2008»
13 years 5 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
CORR
2011
Springer
177views Education» more  CORR 2011»
13 years 11 days ago
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
Shaddin Dughmi
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 3 months ago
Mechanism Design via Correlation Gap
For revenue and welfare maximization in singledimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple i...
Qiqi Yan