Near-optimal pricing in near-linear time

Lecture Notes in Computer Science

Volumn 3608, Issue , 2005, Pages 422-431

  Hartline, Jason D ^a   Koltun, Vladlen ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DATA STRUCTURES; PROBLEM SOLVING;

NEAR-LINEAR TIME; NEAR-OPTIMAL PRICING; PRICING MECHANISMS;

ALGORITHMS;

EID: 26844449083     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534273_37     Document Type: Conference Paper

References (6)

1. G. Aggarwal, T. Feder, R. Motwani, and A. Zhu. Algorithms for multi-product pricing. In Proc. of ICALP, 2004.
2. B. Chazelle and J. Friedman. Point location among hyperplanes and unidirectional ray-shooting. Comput. Geom. Theory Appl., 4:53-62, 1994.
3. A. Goldberg and J. Hartline. Competitive Auctions for Multiple Digital Goods. In Proc. 9th European Symposium on Algorithms, pages 416-427. Springer-Verlag, 2001.
4. F. Gul and E. Stacchetti. Walrasian Equilibrium with Gross Substitutes. Journal of Economic Theory, 87:95-124, 1999.
5. V. Guruswami, J. Hartline, A. Karlin, D. Kempe, K. Kenyon, and F. McSherry. On Profit Maximizing Envy-free Pricing. In Proc. 16th Symp. on Discrete Algorithms. ACM/SIAM, 2005.
6. L. Walras. Elements of Pure Economics. Allen and Unwin, 1954.