Sciweavers

7 search results - page 1 / 2
» Improved Lower Bounds for Non-utilitarian Truthfulness
Sort
View
STACS
2004
Springer
13 years 10 months ago
A Lower Bound on the Competitive Ratio of Truthful Auctions
We study a class of single-round, sealed-bid auctions for a set of identical items. We adopt the worst case competitive framework defined by [1,2] that compares the profit of an ...
Andrew V. Goldberg, Jason D. Hartline, Anna R. Kar...
WINE
2009
Springer
178views Economy» more  WINE 2009»
13 years 12 months ago
The Geometry of Truthfulness
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
Angelina Vidali
WINE
2007
Springer
124views Economy» more  WINE 2007»
13 years 11 months ago
On the Price of Truthfulness in Path Auctions
We study the frugality ratio of truthful mechanisms in path auctions, which measures the extent to which truthful mechanisms “overpay” compared to non-truthful mechanisms. In p...
Qiqi Yan
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 5 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett