31 search results - page 5 / 7 » Truthful randomized mechanisms for combinatorial auctions |
SIGECOM
2005
ACM
14 years 11 days ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We consider the problem of designing a revenue-maximizing auction for a single item, when the values of the bidders are drawn from a correlated distribution. We observe that there...
SIGECOM
2010
ACM
13 years 11 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
SIGECOM
2009
ACM
14 years 1 months ago
2009
ACM
In the context of auctions for digital goods, an interesting Random Sampling Optimal Price auction (RSOP) has been proposed by Goldberg, Hartline and Wright; this leads to a truth...