{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:23:13Z","timestamp":1742941393665,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":35,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_9","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:52Z","timestamp":1461269032000},"page":"37-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic Mechanism Design"],"prefix":"10.1007","author":[{"given":"Ron","family":"Lavi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"1_CR1145","doi-asserted-by":"crossref","unstructured":"Aggarwal G, Fiat A, Goldberg A, Immorlica N, Sudan M (2005) Derandomization of auctions. In: Proceedings of the 37th ACM symposium on theory of computing (STOC'05)","DOI":"10.1145\/1060590.1060682"},{"key":"1_CR1146","doi-asserted-by":"crossref","unstructured":"Andelman N, Azar Y, Sorani M (2005) Truthful approximation mechanisms for scheduling selfish related machines. In: Proceedings of the 22nd international symposium on theoretical aspects of computer science (STACS), pp 69\u201382","DOI":"10.1007\/978-3-540-31856-9_6"},{"key":"1_CR1147","doi-asserted-by":"crossref","unstructured":"Archer A, Tardos \u00c9 (2001) Truthful mechanisms for one\u2010parameter agents. In: Proceedings of the 42nd annual symposium on foundations of computer science (FOCS), pp 482\u2013491","DOI":"10.1109\/SFCS.2001.959924"},{"key":"1_CR1148","doi-asserted-by":"crossref","unstructured":"Awerbuch B, Azar Y, Meyerson A (2003) Reducing truth-telling online mechanisms to online optimization. In: Proceedings of the 35th ACM symposium on theory of computing (STOC'03)","DOI":"10.1145\/780542.780616"},{"key":"1_CR1149","doi-asserted-by":"crossref","unstructured":"Babaioff M, Lavi R, Pavlov E (2006) Single-value combinatorial auctions and implementation in undominated strategies. In: Proceedings of the 17th symposium on discrete algorithms (SODA)","DOI":"10.1145\/1109557.1109674"},{"key":"1_CR1150","doi-asserted-by":"crossref","unstructured":"Balcan M, Blum A, Hartline J, Mansour Y (2005) Mechanism design via machine learning. In: Proceedings of the 46th annual symposium on foundations of computer science (FOCS'05)","DOI":"10.1109\/SFCS.2005.50"},{"key":"1_CR1151","doi-asserted-by":"crossref","unstructured":"Bartal Y, Gonen R, Nisan N (2003) Incentive compatible multiunit combinatorial auctions. In: Proceedings of the 9th conference on theoretical aspects of rationality and knowledge (TARK'03)","DOI":"10.1145\/846241.846250"},{"key":"1_CR1152","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, Chatterjee S, Lavi R, Mu'alem A, Nisan N, Sen A (2006) Weak monotonicity characterizes deterministic dominant\u2010strategy implementation. Econometrica 74:1109\u20131132","journal-title":"Econometrica"},{"key":"1_CR1153","unstructured":"Blum A, Hartline J (2005) Near-optimal online auctions. In: Proceedings of the 16th symposium on discrete algorithms (SODA)"},{"issue":"5","key":"1_CR1154","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/1183907.1183913","volume":"53","author":"A. Blum","year":"2006","unstructured":"Blum A, Sandholm T, Zinkevich M (2006) Online algorithms for market clearing. J ACM53(5):845\u2013879","journal-title":"J. ACM"},{"key":"1_CR1155","doi-asserted-by":"crossref","unstructured":"Blumrosen L, Nisan N (2005) On the computational power of iterative auctions. In: Proceedings of the 7th ACM conference on electronic commerce (EC'05)","DOI":"10.1145\/1064009.1064013"},{"key":"1_CR1156","doi-asserted-by":"crossref","unstructured":"Borgs C, Chayes J, Immorlica N, Mahdian M, Saberi A (2005) Multi\u2010unit auctions with budget\u2010constrained bidders. In: Proceedings of the 7th ACM conference on electronic commerce (EC'05)","DOI":"10.1145\/1064009.1064014"},{"key":"1_CR1157","unstructured":"Christodoulou G, Koutsoupias E, Vidali A (2007) A\u00a0lower bound for scheduling mechanisms. In: Proceedings of the 18th symposium on discrete algorithms (SODA)"},{"key":"1_CR1158","doi-asserted-by":"crossref","unstructured":"Cramton P, Shoham Y, Steinberg R (2005) Combinatorial auctions. MIT","DOI":"10.7551\/mitpress\/9780262033428.001.0001"},{"key":"1_CR1159","doi-asserted-by":"crossref","unstructured":"Dobzinski S, Nisan N, Schapira M (2006) Truthful randomized mechanisms for combinatorial auctions. In: Proceedings of the 38th ACM symposium on theory of computing (STOC'06)","DOI":"10.1145\/1132516.1132607"},{"key":"1_CR1160","doi-asserted-by":"crossref","unstructured":"Feige U (2006) On maximizing welfare when utility functions are subadditive. In: Proceedings of the 38th ACM symposium on theory of computing (STOC'06)","DOI":"10.1145\/1132516.1132523"},{"issue":"2","key":"1_CR1161","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.geb.2006.02.003","volume":"55","author":"A. Goldberg","year":"2006","unstructured":"Goldberg A, Hartline J, Karlin A, Saks M, Wright A (2006) Competitive auctions. Games Econ Behav 55(2):242\u2013269","journal-title":"Games Econ Behav"},{"key":"1_CR1162","unstructured":"Gui H, Muller R, Vohra RV (2004) Characterizing dominant strategy mechanisms with multi\u2010dimensional types. Working paper"},{"key":"1_CR1163","doi-asserted-by":"crossref","unstructured":"Hajiaghayi M, Kleinberg R, Parkes D (2004) Adaptive limited\u2010supply online auctions. In: Proceedings of the 6th ACM conference on electronic commerce (EC'04)","DOI":"10.1145\/988772.988784"},{"key":"1_CR1164","doi-asserted-by":"crossref","unstructured":"Hartline J, McGrew R (2005) From optimal limited to unlimited supply auctions. In: Proceedings of the 7th ACM conference on electronic commerce (EC'05)","DOI":"10.1145\/1064009.1064028"},{"key":"1_CR1165","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.dss.2004.08.009","volume":"39","author":"A. Kothari","year":"2005","unstructured":"Kothari A, Parkes D, Suri S (2005) Approximately\u2010strategy proof and tractable multi\u2010unit auctions. Decis Support Syst 39:105\u2013121","journal-title":"Decis. Support Syst."},{"key":"1_CR1166","doi-asserted-by":"crossref","unstructured":"Kov\u00e1cs A (2005) Fast monotone 3-approximation algorithm for scheduling related machines. In: Proceedings of the 13th annual European symposium on algorithms (ESA), pp 616\u2013627","DOI":"10.1007\/11561071_55"},{"key":"1_CR1167","doi-asserted-by":"crossref","unstructured":"Lavi R, Mu'alem A, Nisan N (2003) Towards a\u00a0characterization of truthful combinatorial auctions. In: Proceedings of the 44rd annual symposium on foundations of computer science (FOCS'03)","DOI":"10.1109\/SFCS.2003.1238230"},{"key":"1_CR1168","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(03)00391-8","volume":"310","author":"R. Lavi","year":"2004","unstructured":"Lavi R, Nisan N (2004) Competitive analysis of incentive compatible on-line auctions. Theor Comput Sci 310:159\u2013180","journal-title":"Theor Comput Sci"},{"key":"1_CR1169","unstructured":"Lavi R, Nisan N (2005) Online ascending auctions for gradually expiring items. In: Proceedings of the 16th symposium on discrete algorithms (SODA)"},{"key":"1_CR1170","doi-asserted-by":"crossref","unstructured":"Lavi R, Swamy C (2005) Truthful and near-optimal mechanism design via linear programming. In: Proceedings of the 46th annual symposium on foundations of computer science (FOCS), pp\u00a0595\u2013604","DOI":"10.1109\/SFCS.2005.76"},{"key":"1_CR1171","doi-asserted-by":"crossref","unstructured":"Lavi R, Swamy C (2007) Truthful mechanism design for multi\u2010dimensional scheduling via cycle monotonicity. Working paper","DOI":"10.1145\/1250910.1250947"},{"issue":"2","key":"1_CR1172","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B. Lehmann","year":"2006","unstructured":"Lehmann B, Lehmann D, Nisan N (2006) Combinatorial auctions with decreasing marginal utilities. Games Econ Behav 55(2):270\u2013296","journal-title":"Games Econ Behav"},{"issue":"5","key":"1_CR1173","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D. Lehmann","year":"2002","unstructured":"Lehmann D, O'Callaghan L, Shoham Y (2002) Truth revelation in approximately efficient combinatorial auctions. J ACM 49(5):577\u2013602","journal-title":"J ACM"},{"key":"1_CR1174","unstructured":"Mu'alem A, Schapira M (2007) Setting lower bounds on truthfulness. In: Proceedings of the 18th symposium on discrete algorithms (SODA)"},{"key":"1_CR1175","doi-asserted-by":"crossref","unstructured":"Nisan N, Ronen A (2000) Computationally feasible VCG mechanisms. In: Proceedings of the 2nd ACM conference on electronic commerce (EC'00)","DOI":"10.1145\/352871.352898"},{"key":"1_CR1176","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 (2001) Algorithmic mechanism design. Games Econ Behav 35:166\u2013196","journal-title":"Games Econ Behav"},{"key":"1_CR1177","doi-asserted-by":"crossref","unstructured":"Nisan N, Roughgarden T, Tardos E, Vazirani V (2007) Algorithmic game theory. Cambridge University Press (expected to appear)","DOI":"10.1017\/CBO9780511800481"},{"key":"1_CR1178","unstructured":"Roberts K (1979) The characterization of implementable choice rules. In: Laffont JJ (ed) Aggregation and revelation of preferences. North-Holland, pp 321\u2013349"},{"key":"1_CR1179","doi-asserted-by":"crossref","unstructured":"Saks M, Yu L (2005) Weak monotonicity suffices for truthfulness on convex domains. In: Proceedings of the 6th ACM conference on electronic commerce (ACM-EC), pp 286\u2013293","DOI":"10.1145\/1064009.1064040"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T19:06:33Z","timestamp":1567796793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_9","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}