Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

APPROX
2009
Springer

favoriteEmaildiscussreport

126views Algorithms» more APPROX 2009»

On Hardness of Pricing Items for Single-Minded Bidders

14 years 26 days ago

On Hardness of Pricing Items for Single-Minded Bidders

Download www.cs.princeton.edu

Rohit Khandekar, Tracy Kimbrel, Konstantin Makaryc

Real-time Traffic

Algorithms | APPROX 2009 |

claim paper

Related Content

» On the hardness of pricing lossleaders

» Approximation algorithms and online mechanisms for item pricing

» Bidding algorithms for a distributed combinatorial auction

» Compact bidding languages and supplier selection for markets with economies of scale and s...

» An auctioning reputation system based on anomaly

Post Info
More Details (n/a)

Added	25 May 2010
Updated	25 May 2010
Type	Conference
Year	2009
Where	APPROX
Authors	Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko

Comments (0)