Sciweavers

220 search results - page 13 / 44
» Combinatorial auctions with externalities
Sort
View
IJCAI
2001
14 years 11 months ago
Robust Multi-unit Auction Protocol against False-name Bids
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...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
SIGECOM
2000
ACM
127views ECommerce» more  SIGECOM 2000»
15 years 2 months ago
Towards a universal test suite for combinatorial auction algorithms
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...
Kevin Leyton-Brown, Mark Pearson, Yoav Shoham
76
Voted
FC
2004
Springer
105views Cryptology» more  FC 2004»
15 years 3 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
WINE
2005
Springer
122views Economy» more  WINE 2005»
15 years 3 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
ECAI
2008
Springer
14 years 12 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