Sciweavers

267 search results - page 3 / 54
» Online Auctions: There Can Be Only One
Sort
View
SIGECOM
2008
ACM
127views ECommerce» more  SIGECOM 2008»
13 years 9 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
WINE
2009
Springer
172views Economy» more  WINE 2009»
14 years 3 months ago
An Online Multi-unit Auction with Improved Competitive Ratio
We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, ...
Sourav Chakraborty, Nikhil R. Devanur
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 6 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
WINE
2005
Springer
122views Economy» more  WINE 2005»
14 years 2 months ago
Multi-unit Combinatorial Reverse Auctions with Transformability Relationships Among Goods
In this paper we extend the notion of multi-unit combinatorial reverse auction by adding a new dimension to the goods at auction. In such a new type of combinatorial auction a buye...
Andrea Giovannucci, Juan A. Rodríguez-Aguil...
ATAL
2007
Springer
14 years 3 months ago
On Revenue-Optimal Dynamic Auctions for Bidders with Interdependent Values
In a dynamic market, being able to update one’s value based on information available to other bidders currently in the market can be critical to having profitable transactions. ...
Florin Constantin, David C. Parkes