Sciweavers

1040 search results - page 69 / 208
» Revenue maximization through
Sort
View
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
15 years 10 months ago
Solving combinatorial exchanges: optimality via a few partial bids
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Anshul Kothari, Tuomas Sandholm, Subhash Suri
ACMICEC
2007
ACM
220views ECommerce» more  ACMICEC 2007»
15 years 8 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
ECRA
2010
111views more  ECRA 2010»
15 years 4 months ago
RDRP: Reward-Driven Request Prioritization for e-Commerce web sites
Meeting client Quality-of-Service (QoS) expectations proves to be a difficult task for the providers of e-Commerce services, especially when web servers experience overload condit...
Alexander Totok, Vijay Karamcheti
JSAC
2008
146views more  JSAC 2008»
15 years 4 months ago
On the Interaction and Competition among Internet Service Providers
The current Internet architecture comprises of different privately owned Internet service providers (ISPs) where higher tier ISPs supply connectivity service to lower tier ISPs an...
Sam C. M. Lee, John C. S. Lui
AI
2002
Springer
15 years 4 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm