163 search results - page 12 / 33 » Approximate bidding algorithms for a distributed combinatori... |
ESA
2009
Springer
13 years 12 months ago
2009
Springer
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
CN
2008
13 years 7 months ago
2008
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...
WINE
2005
Springer
14 years 25 days ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
MFCS
2005
Springer
14 years 26 days ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...