197 search results - page 28 / 40 » Bidding and allocation in combinatorial auctions |
AAAI
2000
14 years 11 months ago
2000
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
86
Voted
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...
SIGECOM
2004
ACM
15 years 3 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
ECAI
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. In this paper we introduce a new option pricing mechanism for reducing the exposure problem encountered by bidding agents with complementary valuations when participating...
AAAI
2010
14 years 11 months ago
2010
In many auctions, agents bid more aggressively than selfinterest would prescribe. This can be explained by spite, where the agent's utility not only increases in the agent�...