Sciweavers

ACMICEC
2007
ACM
220views ECommerce» more  ACMICEC 2007»
13 years 9 months ago
Asymptotically optimal repeated auctions for sponsored search
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...
Nicolas S. Lambert, Yoav Shoham
CIA
2001
Springer
13 years 9 months ago
Cryptographic Protocols for Secure Second-Price Auctions
In recent years auctions have become more and more important in the field of multiagent systems as useful mechanisms for resource allocation, task assignment and last but not leas...
Felix Brandt
ATAL
2001
Springer
13 years 9 months ago
Antisocial Agents and Vickrey Auctions
In recent years auctions have become more and more important in the field of multiagent systems as useful mechanisms for resource allocation and task assignment. In many cases the...
Felix Brandt, Gerhard Weiß
AGENTS
2001
Springer
13 years 9 months ago
Automated negotiation from declarative contract descriptions
We present and implement an infrastructure for automating the negotiation of business contracts. Underlying our system is a declarative language for both (1) fully-specified, exe...
Daniel M. Reeves, Michael P. Wellman, Benjamin N. ...
SIGECOM
2010
ACM
125views ECommerce» more  SIGECOM 2010»
13 years 9 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...
FOCS
2002
IEEE
13 years 10 months ago
Auctions with Severely Bounded Communication
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-max...
Liad Blumrosen, Noam Nisan
ESA
2003
Springer
100views Algorithms» more  ESA 2003»
13 years 10 months ago
Multi-player and Multi-round Auctions with Severely Bounded Communication
We study auctions in which bidders have severe constraints on the size of messages they are allowed to send to the auctioneer. In such auctions, each bidder has a set of k possible...
Liad Blumrosen, Noam Nisan, Ilya Segal
AE
2003
Springer
13 years 10 months ago
An Agent Model for First Price and Second Price Private Value Auctions
The aim of this research is to develop an adaptive agent based model of auction scenarios commonly used in auction theory to help understand how competitors in auctions reach equil...
Anthony J. Bagnall, Iain Toft
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
13 years 10 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
CCS
2005
ACM
13 years 10 months ago
An auctioning reputation system based on anomaly
Existing reputation systems used by online auction houses do not address the concern of a buyer shopping for commodities—finding a good bargain. These systems do not provide in...
Shai Rubin, Mihai Christodorescu, Vinod Ganapathy,...