224 search results - page 3 / 45 » Auctions with Severely Bounded Communication |
ATAL
2004
Springer
15 years 3 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 ...
102
click to vote
JCSS
2008
14 years 10 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
14 years 1 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...
106
click to vote
ECCC
2011
14 years 5 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
15 years 10 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....