{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:52:20Z","timestamp":1742975540981,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642148484"},{"type":"electronic","value":"9783642148491"}],"license":[{"start":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T00:00:00Z","timestamp":1289174400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-14849-1_4","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T15:47:28Z","timestamp":1303919248000},"page":"85-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol"],"prefix":"10.1007","author":[{"given":"Peter","family":"Widmayer","sequence":"first","affiliation":[]},{"given":"Luzi","family":"Anderegg","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Eidenbenz","sequence":"additional","affiliation":[]},{"given":"Leon","family":"Peeters","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,8]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02716576","volume":"15","author":"P. Agarwal","year":"1996","unstructured":"P. Agarwal, O. Schwarzkopf, and M. Sharir. The overlay of lower envelopes and its applications. Discrete & Computational Geometry, 15(1):1\u201313, Springer, New York, NY, 1996.","journal-title":"Discrete & Computational Geometry"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"S. Albers, S. Eilts, E. Even-Dar, Y. Mansour, and L. Roditty. On Nash equilibria for a network creation game. In: Proceedings SODA 2006, pages 89\u201398, Miami, Florida, 2006.","DOI":"10.1145\/1109557.1109568"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"L. Anderegg and S. Eidenbenz. Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In: Proceedings MOBICOM 2003, pages 245\u2013259, San Diego, California, 2003.","DOI":"10.1145\/938985.939011"},{"key":"4_CR4","first-page":"58","volume-title":"Algosensors","author":"L. Anderegg","year":"2007","unstructured":"L. Anderegg, S. Eidenbenz, L. Peeters, and P. Widmayer. Optimal placement of ad-hoc devices under a vcg-style routing protocol. In M. Kutylowski, J. Cichon, and P. Kubiak, editors, ALGOSENSORS, vol. 4837 of Lecture Notes in Computer Science, pages 58\u201370. Springer, New York, NY, 2007."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. The price of stability for network design with fair cost allocation. In: Proceedings FOCS 2004, pages 295\u2013304, Rome, Italy, 2004.","DOI":"10.1109\/FOCS.2004.68"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"E. Anshelevich, A. Dasgupta, E. Tardos, and T. Wexler. Near-optimal network design with selfish agents. In: Proceedings STOC 2003, pages 511\u2013520, 2003.","DOI":"10.1145\/780542.780617"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"J. Corbo and D. Parkes. The price of selfish behavior in bilateral network formation. In: Proceedings PODC 2005, pages 99\u2013107, Las Vegas, Nevada, 2005.","DOI":"10.1145\/1073814.1073833"},{"key":"4_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. de Berg","year":"1997","unstructured":"M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer, New York, NY, 1997."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","volume":"7","author":"M. Dyer","year":"1986","unstructured":"M. Dyer and A. Frieze. Planar 3DM is np-complete. Journal of Algorithms, 7:174\u2013184, 1986.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/TMC.2007.1069","volume":"7","author":"S. Eidenbenz","year":"2008","unstructured":"S. Eidenbenz, G. Resta, and P. Santi. The commit protocol for truthful and cost-efficient routing in ad hoc networks with selfish nodes. IEEE Transactions on Mobile Computing, 7(1):19\u201333, 2008.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"A. Fabrikant, A. Luthra, E. Maneva, C. Papadimitriou, and S. Shenker. On a network creation game. In: Proceedings PODC 2003, Boston, Massachusetts, 2003.","DOI":"10.1145\/872035.872088"},{"key":"4_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"O. Goussevskaia, M. Halld\u00f3rsson, R. Wattenhofer, and E. Welzl. Capacity of Arbitrary Wireless Networks. In: 28th Annual IEEE Conference on Computer Communications (INFOCOM), Rio de Janeiro, Brazil, April, 2009.","DOI":"10.1109\/INFCOM.2009.5062108"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"O. Goussevskaia, Y. A. Oswald, and R. Wattenhofer. Complexity in Geometric SINR. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Montreal, Canada, September, 2007.","DOI":"10.1145\/1288107.1288122"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"A. Hayrapetyan, E. Tardos, and T. Wexler. A network pricing game for selfish traffic. In: Proceedings PODC 2005, pages 284\u2013291, Las Vegas, Nevada, 2005.","DOI":"10.1145\/1073814.1073869"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"M. Hoefer and P. Krysta. Geometric Network Design with Selfish Agents. In: Proceedings of 11th Annual International Conference on Computing and Combinatorics (COCOON 2005), pages 167\u2013178, Kunming, Yunnan, 2005.","DOI":"10.1007\/11533719_19"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"G. Kant. Drawing planar graphs using the lmc-ordering. In: Proceedings FOCS 1992, pages 101\u2013110, Pittsburgh, Pennsylvania, 1992.","DOI":"10.1109\/SFCS.1992.267814"},{"key":"4_CR18","unstructured":"S. Krumke. The Approximability of Location and Network Design Problems. PhD thesis, University of Wuerzburg, 1996."},{"key":"4_CR19","unstructured":"A. Mas-Colell, M. Whinston, and J. Green. Microeconomic Theory. Oxford University Press, 1995."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"C. Thielen and S. O. Krumke. Truthful mechanisms for selfish routing and two-parameter agents. In: SAGT, pages 36\u201347, Paphos, Cyprus, 2009.","DOI":"10.1007\/978-3-642-04645-2_5"}],"container-title":["Monographs in Theoretical Computer Science. An EATCS Series","Theoretical Aspects of Distributed Computing in Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14849-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T08:36:30Z","timestamp":1741163790000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14849-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,8]]},"ISBN":["9783642148484","9783642148491"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14849-1_4","relation":{},"ISSN":["1431-2654"],"issn-type":[{"type":"print","value":"1431-2654"}],"subject":[],"published":{"date-parts":[[2010,11,8]]},"assertion":[{"value":"8 November 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}