Abstract
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated to report their true values for the figures as well as to report the true figures. Moreover, an approximation algorithm should be used for guaranteeing a reasonable solution for the underlying NP-complete problem. We present truthful mechanisms that guarantee a certain fraction of the social welfare, as a function of a measure on the geometric diversity of the shapes. We give the first approximation algorithm for packing arbitrary weighted compact convex figures. We use this algorithm, and variants of existing algorithms, to create polynomial-time truthful mechanisms that approximate the social welfare. We show that each mechanism achieves the best approximation over all the mechanisms of its kind. We also study different models of information and a discrete model, where players bid for sets of predefined building blocks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: symposium on foundations of computer science, pp. 482–491 (2001)
Babaioff, M., Blumrosen, L.: Computationally-feasible truthful auctions for convex bundles, Full version. Available from www.cs.huji.ac.il/ liad or / mosheb
Babaioff, M., Walsh, W.E.: Incentive-compatible, budget-balanced, yet highly efficient auctions for supply chain formation. In: ACM Conference on Electronic Commerce, pp. 64–75 (2003); Extended version to appear in DSS, 2004
Chan, T.M.: Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms 46, 209–218 (2003)
Erlebacj, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric graphs. In: SODA, pp. 671–679 (2001)
Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 749–753 (2001)
Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and vlsi. Journal of the ACM, 130–136 (1985)
Khanna, S., Muthukrishnan, S., Paterson, M.: On approximating rectangle tiling and packing. In: Symposium on Discrete Algorithms, pp. 384–393 (1998)
Lavi, R., Mua’lem, A., Nisan, N.: Towards a characterization of truthful combinatorial auctions. In: FOCS 2003, pp. 574–583 (2003)
Lehmann, D., O’Callaghan, L.I., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. Journal of the ACM 49(5), 1–26 (2002)
Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, New York (1995)
Mua’lem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions. In: AAAI 2002 (2002)
Nisan, N.: Algorithms for selfish agents. In: 16th Symposium on Theoretical Aspects of Computer Science (1999)
Nisanand, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behavior 35(1/2), 166–196 (2001)
Rothkopf, M.H., Pekeč, A., Harstad, R.M.: Computationally manageable combinatorial auctions. Management Science 44, 1131–1147 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Babaioff, M., Blumrosen, L. (2004). Computationally-Feasible Truthful Auctions for Convex Bundles. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 2004 2004. Lecture Notes in Computer Science, vol 3122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27821-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-27821-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22894-3
Online ISBN: 978-3-540-27821-4
eBook Packages: Springer Book Archive