224 search results - page 3 / 45 » Auctions with Severely Bounded Communication |
ATAL
2004
Springer
13 years 11 months ago
2004
Springer
We investigate the design of iterative, limited-precision mechanisms for single-good auctions with dominant strategy equilibria. Our aim is to design mechanisms that minimize the ...
JCSS
2008
13 years 6 months ago
2008
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...
INFOCOM
2011
IEEE
12 years 10 months ago
2011
IEEE
—Online spectrum auctions offer ample flexibility for bidders to request and obtain spectrum on-the-fly. Such flexibility, however, opens up new vulnerabilities to bidder mani...
ECCC
2011
13 years 1 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....