Sciweavers

273 search results - page 13 / 55
» DEA based auctions
Sort
View
ARESEC
2011
76views more  ARESEC 2011»
12 years 6 months ago
A Complexity Based Forensic Analysis of the Trojan Horse Defence
—The Operational Complexity Model (OCM) has been used to derive the complexities of the five most prevalent cyber-crimes occurring in southeast Asia, namely peer-to-peer (P2P) mu...
Richard E. Overill, Jantje A. M. Silomon
DEXAW
2002
IEEE
80views Database» more  DEXAW 2002»
13 years 11 months ago
Private Auctions with Multiple Rounds and Multiple Items
For selling spectrum licenses economists have designed new auction types proceeding over several rounds and offering several licenses simultaneously. Communication between bidders...
Ahmad-Reza Sadeghi, Matthias Schunter, Sandra Stei...
SIGECOM
2010
ACM
125views ECommerce» more  SIGECOM 2010»
13 years 11 months ago
Information asymmetries in pay-per-bid auctions
Recently, some mainstream e-commerce web sites have begun using “pay-per-bid” auctions to sell items, from video games to bars of gold. In these auctions, bidders incur a cost...
John W. Byers, Michael Mitzenmacher, Georgios Zerv...
IJCAI
2007
13 years 8 months ago
Spiteful Bidding in Sealed-Bid Auctions
We study the bidding behavior of spiteful agents who, contrary to the common assumption of selfinterest, maximize a convex combination of their own profit and their competitors...
Felix Brandt, Tuomas Sandholm, Yoav Shoham
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
13 years 8 months ago
Competitiveness via consensus
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
Andrew V. Goldberg, Jason D. Hartline