500 search results - page 5 / 100 » On the Hardness of Being Truthful |
133
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
148
click to vote
FOCS
2008
IEEE
16 years 15 days ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
152
click to vote
ISAAC
2007
Springer
16 years 6 days ago
2007
Springer
Most of the recent works on algorithmic mechanism design exploit the solution concept of dominant strategy equilibria. Such work designs a proper payment scheme so that selfish ag...
143
click to vote
AAAI
2004
15 years 7 months ago
2004
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
156
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...