Sciweavers

197 search results - page 20 / 40
» Bidding and allocation in combinatorial auctions
Sort
View
CN
2007
111views more  CN 2007»
14 years 10 months ago
An auction mechanism for allocating the bandwidth of networks to their users
We present a mechanism for auctioning bandwidth on a network-wide basis to end users or ISPs that will utilize it for the same time period. This mechanism consists of a set of sim...
Manos Dramitinos, George D. Stamoulis, Costas Cour...
75
Voted
CN
2008
97views more  CN 2008»
14 years 10 months ago
Towards real-time dynamic spectrum auctions
In this paper, we propose a low-complexity auction framework to distribute spectrum in real-time among a large number of wireless users with dynamic traffic. Our design consists o...
Sorabh Gandhi, Chiranjeeb Buragohain, Lili Cao, Ha...
100
Voted
IOR
2011
96views more  IOR 2011»
14 years 1 months ago
An Ascending Vickrey Auction for Selling Bases of a Matroid
Consider selling bundles of indivisible goods to buyers with concave utilities that are additively separable in money and goods. We propose an ascending auction for the case when ...
Sushil Bikhchandani, Sven de Vries, James Schummer...
70
Voted
CORR
2010
Springer
147views Education» more  CORR 2010»
14 years 10 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
IAT
2009
IEEE
15 years 5 months ago
Incorporating Trust into Combinatorial Auctions: What Does Trust Cost?
As the use of automated negotiations becomes more mainstream, one key attribute that needs to be incorporated is a measure of a seller’s trust or reliability. In this paper, we ...
Guruprasad Airy, Po-Chun Chen, Tracy Mullen, John ...