Truthful Mechanisms for Exhibitions

  • George Christodoulou
  • Khaled Elbassioni
  • Mahmoud Fouz
Conference paper

DOI: 10.1007/978-3-642-17572-5_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6484)
Cite this paper as:
Christodoulou G., Elbassioni K., Fouz M. (2010) Truthful Mechanisms for Exhibitions. In: Saberi A. (eds) Internet and Network Economics. WINE 2010. Lecture Notes in Computer Science, vol 6484. Springer, Berlin, Heidelberg

Abstract

We consider the following combinatorial auction: Given a range space Open image in new window, and m bidders interested in buying only ranges in Open image in new window, each bidder j declares her bid Open image in new window. We give a deterministic truthful mechanism, when the valuations are single-minded: when Open image in new window is a collection of fat objects (respectively, axis-aligned rectangles) in the plane, there is a truthful mechanism with a 1 + ε- (respectively, ⌈logn⌉)-approximation of the social welfare (where n is an upper bound on the maximum integral coordinate of each rectangle). We also consider the non-single-minded case, and design a randomized truthful-in-expectation mechanism with approximation guarantee O(1) (respectively, O(logm)).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • George Christodoulou
    • 1
    • 2
  • Khaled Elbassioni
    • 1
  • Mahmoud Fouz
    • 3
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany
  2. 2.Cluster of Excellence “Multimodal Computing and Interaction”Universität des Saarlandes 
  3. 3.FR InformatikUniversität des SaarlandesSaarbrückenGermany

Personalised recommendations