Sciweavers

34 search results - page 1 / 7
» Online auctions and generalized secretary problems
Sort
View
SIGECOM
2008
ACM
85views ECommerce» more  SIGECOM 2008»
13 years 4 months ago
Online auctions and generalized secretary problems
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
WINE
2010
Springer
164views Economy» more  WINE 2010»
13 years 2 months ago
Incentives in Online Auctions via Linear Programming
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
Niv Buchbinder, Kamal Jain, Mohit Singh
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
13 years 11 months ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
SIGECOM
2004
ACM
165views ECommerce» more  SIGECOM 2004»
13 years 10 months ago
Adaptive limited-supply online auctions
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Da...
SIGECOM
2008
ACM
127views ECommerce» more  SIGECOM 2008»
13 years 4 months ago
Posted prices vs. negotiations: an asymptotic analysis
Full revelation of private values is impractical in many large-scale markets, where posted price mechanisms are a simpler alternative. In this work, we compare the asymptotic beha...
Liad Blumrosen, Thomas Holenstein