Sciweavers

35 search results - page 5 / 7
» Designing differentially private spectrum auction mechanisms
Sort
View
ATAL
2007
Springer
14 years 3 months ago
On Revenue-Optimal Dynamic Auctions for Bidders with Interdependent Values
In a dynamic market, being able to update one’s value based on information available to other bidders currently in the market can be critical to having profitable transactions. ...
Florin Constantin, David C. Parkes
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 9 months ago
Single Parameter Combinatorial Auctions with Partially Public Valuations
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
Gagan Goel, Chinmay Karande, Lei Wang
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
13 years 11 months ago
Competitiveness via consensus
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
Andrew V. Goldberg, Jason D. Hartline
INFOCOM
2012
IEEE
12 years 1 days ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 8 months ago
Budget Feasible Mechanisms
We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common econom...
Christos H. Papadimitriou, Yaron Singer