227 search results - page 14 / 46 » Combinatorial Auctions with Budgets |
101
click to vote
IJCAI
2001
14 years 11 months ago
2001
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
CSCLP
2004
Springer
15 years 3 months ago
2004
Springer
Super solutions provide a framework for finding robust solutions to Constraint Satisfaction Problems [5, 3]. We present a novel application of super solutions to combinatorial auc...
103
click to vote
ATAL
2006
Springer
15 years 2 days ago
2006
Springer
Bidding for multiple items or bundles on online auctions raises challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary ...
101
click to vote
IJCAI
2001
14 years 11 months ago
2001
This paper presents a new multi-unit auction protocol (IR protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce a...
SIGECOM
2000
ACM
15 years 2 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...