89 search results - page 2 / 18 » Robust solutions for combinatorial auctions |
ACMICEC
2003
ACM
14 years 1 months ago
2003
ACM
Combinatorial auctions are difficult to analyze in part because of the vast number of potential strategies available to the bidders. Proxy bidding interfaces limit the users’ s...
AAAI
2010
13 years 10 months ago
2010
Using a model of agent behavior based around envy-reducing strategies, we describe an iterated combinatorial auction in which the allocation and prices converge to a solution in t...
SIGECOM
2000
ACM
14 years 27 days ago
2000
ACM
IJCAI
2001
13 years 10 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...
IJCAI
2001
13 years 10 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...