227 search results - page 15 / 46 » Combinatorial Auctions with Budgets |
161
click to vote
FC
2004
Springer
16 years 9 hour ago
2004
Springer
This paper presents a secure Generalized Vickrey Auction (GVA) scheme that does not require third-party servers, i.e., the scheme is executed only by an auctioneer and bidders. Com...
165
click to vote
AAAI
2008
15 years 9 months ago
2008
When autonomous agents decide on their bidding strategies in real world auctions, they have a number of concerns that go beyond the models that are normally analyzed in traditiona...
161
click to vote
WINE
2005
Springer
16 years 2 days ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
166
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
The ability to express preferences for specific tasks in multi-agent auctions is an important element for potential users who are considering to use such auctioning systems. This p...
145
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...