Sciweavers

1034 search results - page 7 / 207
» Competitive generalized auctions
Sort
View
SODA
2003
ACM
132views Algorithms» more  SODA 2003»
13 years 10 months ago
Online learning in online auctions
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids are received and dealt with one-by-one. In this note, we demonstrate that resul...
Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu
AGENTS
2001
Springer
14 years 1 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. ...
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
14 years 3 months ago
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
Niv Buchbinder, Kamal Jain, Joseph Naor
DA
2010
109views more  DA 2010»
13 years 9 months ago
Auctioning the Right to Choose When Competition Persists
Several papers compare auctioning heterogeneous assets sequentially with sequentially selling the right to choose among assets not yet taken. Typically motivated by auctions of co...
Ronald M. Harstad
SIGECOM
2003
ACM
106views ECommerce» more  SIGECOM 2003»
14 years 2 months ago
Envy-free auctions for digital goods
We study auctions for a commodity in unlimited supply, e.g., a digital good. In particular we consider three desirable properties for auctions: • Competitive: the auction achiev...
Andrew V. Goldberg, Jason D. Hartline