60 search results - page 3 / 12 » Approximation algorithms for combinatorial auctions with com... |
SIGECOM
2000
ACM
13 years 10 months ago
2000
ACM
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
WECWIS
2005
IEEE
13 years 11 months ago
2005
IEEE
Proxy bidding has been proposed for combinatorial auctions as a means to speed up the auctions, to simplify the user interface, and to limit strategic behavior. The only previousl...
ATAL
2006
Springer
13 years 9 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:...
ATAL
2007
Springer
13 years 12 months ago
2007
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
JCSS
2008
13 years 5 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...