Sciweavers

267 search results - page 5 / 54
» Online Auctions: There Can Be Only One
Sort
View
SIGECOM
2003
ACM
107views ECommerce» more  SIGECOM 2003»
14 years 2 months ago
Using value queries in combinatorial auctions
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
Benoît Hudson, Tuomas Sandholm
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum
JCP
2007
73views more  JCP 2007»
13 years 8 months ago
Investigating Shill Bidding Behaviour Involving Colluding Bidders
Abstract— Shill bidding is where spurious bids are introduced into an auction to drive up the final price for the seller, thereby defrauding legitimate bidders. Trevathan and Re...
Jarrod Trevathan, Wayne Read
CCIA
2005
Springer
14 years 2 months ago
Auctioning Substitutable Goods
In this paper we extend the notion of multi-unit combinatorial reverse auction by adding a new dimension to the goods at auction. In such a new type of combinatorial auction a buye...
Andrea Giovannucci, Juan A. Rodríguez-Aguil...
IAT
2008
IEEE
14 years 3 months ago
Beyond Quasi-linear Utility: Strategy/False-Name-Proof Multi-unit Auction Protocols
We develop strategy/false-name-proof multi-unit auction protocols for non-quasi-linear utilities. One almost universal assumption in auction theory literature is that each bidder ...
Yuko Sakurai, Yasumasa Saito, Atsushi Iwasaki, Mak...