11 search results - page 1 / 3 » Stability and Incentive Compatibility in a Kernel-Based Comb... |
AAAI
2010
13 years 6 months ago
2010
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
Publication
Abstract: The current art in optimal combinatorial auctions is limited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (singl...
GLOBECOM
2009
IEEE
14 years 17 hour ago
2009
IEEE
— This paper studies an auction based allocation of network resources for short-term contracts for heterogeneous network services. The combinatorial winner selection yields the o...
AAAI
2000
13 years 6 months ago
2000
This paper presents a new combinatorial auction protocol (LDS protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commer...
AAAI
2004
13 years 6 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...