{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:18:33Z","timestamp":1725538713738},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046445"},{"type":"electronic","value":"9783642046452"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04645-2_5","type":"book-chapter","created":{"date-parts":[[2009,10,7]],"date-time":"2009-10-07T11:14:23Z","timestamp":1254914063000},"page":"36-47","source":"Crossref","is-referenced-by-count":1,"title":["Truthful Mechanisms for Selfish Routing and Two-Parameter Agents"],"prefix":"10.1007","author":[{"given":"Clemens","family":"Thielen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven O.","family":"Krumke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Microeconomic Theory","author":"A. Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1995)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behavior\u00a035, 166\u2013196 (2001)","journal-title":"Games and Economic Behavior"},{"doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science, pp. 482\u2013491 (2001)","key":"5_CR3","DOI":"10.1109\/SFCS.2001.959924"},{"volume-title":"Selfish Routing and the Price of Anarchy","year":"2005","unstructured":"Roughgarden, T. (ed.): Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)","key":"5_CR4"},{"unstructured":"Roughgarden, T.: Selfish Routing. PhD thesis, Cornell University (2002)","key":"5_CR5"},{"doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: Proceedings of the 4th ACM Conference on Electronic Commerce, pp. 98\u2013107 (2003)","key":"5_CR6","DOI":"10.1145\/779928.779941"},{"doi-asserted-by":"crossref","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: Proceedings of the 45th Annual IEEE Symposium on the Foundations of Computer Science, pp. 277\u2013285 (2004)","key":"5_CR7","DOI":"10.1109\/FOCS.2004.69"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/BF02612357","volume":"28","author":"S.C. Dafermos","year":"1984","unstructured":"Dafermos, S.C., Nagurney, A.: Sensitivity analysis for the asymmetric network equilibrium problem. Mathematical Programming\u00a028, 174\u2013184 (1984)","journal-title":"Mathematical Programming"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0191-2615(79)90022-5","volume":"13B","author":"M.J. Smith","year":"1979","unstructured":"Smith, M.J.: The existence, uniqueness, and stability of traffic equilibria. Transportation Research\u00a013B, 295\u2013304 (1979)","journal-title":"Transportation Research"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/11496915_13","volume-title":"Integer Programming and Combinatorial Optimization","author":"J.R. Correa","year":"2005","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: On the inefficiency of equilibria in congestion games. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 167\u2013181. Springer, Heidelberg (2005)"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1111\/j.1468-0262.2006.00695.x","volume":"74","author":"S. Bikhchandani","year":"2006","unstructured":"Bikhchandani, S., Chatterji, S., Lavi, R., Mu\u2019alem, A., Nisan, N., Sen, A.: Weak monotonicity characterizes deterministic dominant strategy implementation. Econometrica\u00a074(4), 1109\u20131132 (2006)","journal-title":"Econometrica"},{"doi-asserted-by":"crossref","unstructured":"Saks, M., Yu, L.: Weak monotonicity suffices for truthfulness on convex domains. In: Proceedings of the 6th ACM Conference on Electronic Commerce, pp. 286\u2013293 (2005)","key":"5_CR13","DOI":"10.1145\/1064009.1064040"},{"unstructured":"Archer, A.: Mechanisms for Discrete Optimization with Rational Agents. PhD thesis, Cornell University (2004)","key":"5_CR14"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04645-2_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:09:47Z","timestamp":1619780987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04645-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046445","9783642046452"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04645-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}