Sciweavers

227 search results - page 15 / 46
» Combinatorial Auctions with Budgets
Sort
View
FC
2004
Springer
105views Cryptology» more  FC 2004»
15 years 5 months ago
Secure Generalized Vickrey Auction without Third-party Servers
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...
Makoto Yokoo, Koutarou Suzuki
99
Voted
AAAI
2008
15 years 2 months ago
Bidding Strategies for Realistic Multi-Unit Sealed-Bid Auctions
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...
Ioannis A. Vetsikas, Nicholas R. Jennings
85
Voted
WINE
2005
Springer
122views Economy» more  WINE 2005»
15 years 6 months ago
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
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 ...
Ning Chen, Atri Rudra
101
Voted
ECAI
2008
Springer
15 years 2 months ago
Agents Preferences in Decentralized Task Allocation
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...
Mark Hoogendoorn, Maria L. Gini
80
Voted
ATAL
2010
Springer
15 years 1 months ago
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori...