Budget Feasible Mechanisms for Experimental Design
We present a deterministic, polynomial time, budget feasible mechanism scheme, that is approximately truthful and yields a constant (≈ 12.98) factor approximation for the Experimental Design Problem (EDP). By applying previous work on budget feasible mech
- PDF / 15,346,160 Bytes
- 793 Pages / 439.37 x 666.142 pts Page_size
- 19 Downloads / 186 Views
ARCoSS
Alberto Pardo Alfredo Viola (Eds.)
LATIN 2014: Theoretical Informatics 11th Latin American Symposium Montevideo, Uruguay, March 31–April 4, 2014 Proceedings
123
Lecture Notes in Computer Science
8392
Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board David Hutchison, UK Josef Kittler, UK Alfred Kobsa, USA John C. Mitchell, USA Oscar Nierstrasz, Switzerland Bernhard Steffen, Germany Demetri Terzopoulos, USA Gerhard Weikum, Germany
Takeo Kanade, USA Jon M. Kleinberg, USA Friedemann Mattern, Switzerland Moni Naor, Israel C. Pandu Rangan, India Doug Tygar, USA
Advanced Research in Computing and Software Science Subline of Lectures Notes in Computer Science Subline Series Editors Giorgio Ausiello, University of Rome ‘La Sapienza’, Italy Vladimiro Sassone, University of Southampton, UK
Subline Advisory Board Susanne Albers, University of Freiburg, Germany Benjamin C. Pierce, University of Pennsylvania, USA Bernhard Steffen, University of Dortmund, Germany Deng Xiaotie, City University of Hong Kong Jeannette M. Wing, Microsoft Research, Redmond, WA, USA
Alberto Pardo Alfredo Viola (Eds.)
LATIN 2014: Theoretical Informatics 11th Latin American Symposium Montevideo, Uruguay, March 31 – April 4, 2014 Proceedings
13
Volume Editors Alberto Pardo Universidad de la República Facultad de Ingeniería Instituto de Computación Julio Herrera y Reissig 565 11300 Montevideo, Uruguay E-mail: [email protected] Alfredo Viola Universidad de la República Facultad de Ingeniería Instituto de Computación Julio Herrera y Reissig 565 11300 Montevideo, Uruguay E-mail: [email protected]
ISSN 0302-9743 e-ISSN 1611-3349 ISBN 978-3-642-54422-4 e-ISBN 978-3-642-54423-1 DOI 10.1007/978-3-642-54423-1 Springer Heidelberg New York Dordrecht London Library of Congress Control Number: 2014931658 LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues © Springer-Verlag Berlin Heidelberg 2014 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in ist current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecutio
Data Loading...
