{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:55:18Z","timestamp":1743022518506,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":35,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_9","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:37:51Z","timestamp":1214505471000},"page":"16-25","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic Mechanism Design"],"prefix":"10.1007","author":[{"given":"Ron","family":"Lavi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1_9","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Fiat, A., Goldberg, A., Immorlica, N., Sudan, M.: Derandomization of auctions. In: Proc. of the 37th ACM Symposium on Theory of Computing (STOC'05), 2005","DOI":"10.1145\/1060590.1060682"},{"key":"9_CR2_9","doi-asserted-by":"crossref","unstructured":"Andelman, N., Azar, Y., Sorani, M.: Truthful approximation mechanisms for scheduling selfish related machines. In: Proc. of the 22nd International Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 69\u201382","DOI":"10.1007\/978-3-540-31856-9_6"},{"key":"9_CR3_9","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one\u2010parameter agents. In: Proc. 42nd Annual Symposium on Foundations of Computer Science (FOCS), 2001, pp. 482\u2013491","DOI":"10.1109\/SFCS.2001.959924"},{"key":"9_CR4_9","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Meyerson, A.: Reducing truth-telling online mechanisms to online optimization. In: Proc. of the 35th ACM Symposium on Theory of Computing (STOC'03), 2003","DOI":"10.1145\/780542.780616"},{"key":"9_CR5_9","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Lavi, R., Pavlov, E.: Single-value combinatorial auctions and implementation in undominated strategies. In: Proc. of the 17th Symposium on Discrete Algorithms (SODA), 2006","DOI":"10.1145\/1109557.1109674"},{"key":"9_CR6_9","unstructured":"Balcan, M., Blum, A., Hartline, J., Mansour, Y.: Mechanism design via machine learning. In: Proc. of the 46th Annual Symposium on Foundations of Computer Science (FOCS'05), 2005"},{"key":"9_CR7_9","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gonen, R., Nisan, N.: Incentive compatible multi-unit combinatorial auctions. In: Proc. of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK'03), 2003","DOI":"10.1145\/846241.846250"},{"key":"9_CR8_9","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.: Weak monotonicity characterizes deterministic dominant\u2010strategy implementation. Econometrica 74, 1109\u20131132 (2006)","journal-title":"Econometrica"},{"key":"9_CR9_9","unstructured":"Blum, A., Hartline, J.: Near-optimal online auctions. In: Proc. of the 16th Symposium on Discrete Algorithms (SODA), 2005"},{"issue":"5","key":"9_CR10_9","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.: Online algorithms for market clearing. J.\u00a0ACM 53(5), 845\u2013879 (2006)","journal-title":"J. ACM"},{"key":"9_CR11_9","doi-asserted-by":"crossref","unstructured":"Blumrosen, L., Nisan, N.: On the computational power of iterative auctions. In: Proc. of the 7th ACM Conference on Electronic Commerce (EC'05), 2005","DOI":"10.1145\/1064009.1064013"},{"key":"9_CR12_9","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J., Immorlica, N., Mahdian, M., Saberi, A.: Multi-unit auctions with budget\u2010constrained bidders. In: Proc. of the 7th ACM Conference on Electronic Commerce (EC'05), 2005","DOI":"10.1145\/1064009.1064014"},{"key":"9_CR13_9","unstructured":"Christodoulou, G., Koutsoupias, E., Vidali, A.: A\u00a0lower bound for scheduling mechanisms. In: Proc. 18th Symposium on Discrete Algorithms (SODA), 2007"},{"key":"9_CR14_9","doi-asserted-by":"crossref","unstructured":"Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press (2005)","DOI":"10.7551\/mitpress\/9780262033428.001.0001"},{"key":"9_CR15_9","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Truthful randomized mechanisms for combinatorial auctions. In: Proc. of the 38th ACM Symposium on Theory of Computing (STOC'06), 2006","DOI":"10.1145\/1132516.1132607"},{"key":"9_CR16_9","doi-asserted-by":"crossref","unstructured":"Feige, U.: On maximizing welfare when utility functions are subadditive. In: Proc. of the 38th ACM Symposium on Theory of Computing (STOC'06), 2006","DOI":"10.1145\/1132516.1132523"},{"issue":"2","key":"9_CR17_9","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.: Competitive auctions. Games Econ. Behav. 55(2), 242\u2013269 (2006)","journal-title":"Games Econ. Behav."},{"key":"9_CR18_9","unstructured":"Gui, H., Muller, R., Vohra, R.V.: Characterizing dominant strategy mechanisms with multi\u2010dimensional types (2004). Working paper"},{"key":"9_CR19_9","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M., Kleinberg, R., Parkes, D.: Adaptive limited\u2010supply online auctions. In: Proc. of the 6th ACM Conference on Electronic Commerce (EC'04), 2004","DOI":"10.1145\/988772.988784"},{"key":"9_CR20_9","doi-asserted-by":"crossref","unstructured":"Hartline, J., McGrew, R.: From optimal limited to unlimited supply auctions. In: Proc. of the 7th ACM Conference on Electronic Commerce (EC'05), 2005","DOI":"10.1145\/1064009.1064028"},{"key":"9_CR21_9","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.: Approximately\u2010strategyproof and tractable multi-unit auctions. Decis. Support Syst. 39, 105\u2013121 (2005)","journal-title":"Decis. Support Syst."},{"key":"9_CR22_9","doi-asserted-by":"crossref","unstructured":"Kov\u00e1cs, A.: Fast monotone 3\u2011approximation algorithm for scheduling related machines. In: Proc. 13th Annual European Symposium on Algorithms (ESA), 2005, pp. 616\u2013627","DOI":"10.1007\/11561071_55"},{"key":"9_CR23_9","unstructured":"Lavi, R., Mu'alem, A., Nisan, N.: Towards a\u00a0characterization of truthful combinatorial auctions. In: Proc. of the 44rd Annual Symposium on Foundations of Computer Science (FOCS'03), 2003"},{"key":"9_CR24_9","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.: Competitive analysis of incentive compatible on-line auctions. Theor. Comput. Sci. 310, 159\u2013180 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR25_9","unstructured":"Lavi, R., Nisan, N.: Online ascending auctions for gradually expiring items. In: Proc. of the 16th Symposium on Discrete Algorithms (SODA), 2005"},{"key":"9_CR26_9","unstructured":"Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. In: Proc. 46th Annual Symposium on Foundations of Computer Science (FOCS), 2005, pp.\u00a0595\u2013604"},{"key":"9_CR27_9","doi-asserted-by":"crossref","unstructured":"Lavi, R., Swamy, C.: Truthful mechanism design for multi\u2010dimensional scheduling via cycle monotonicity (2007). Working paper","DOI":"10.1145\/1250910.1250947"},{"issue":"2","key":"9_CR28_9","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.: Combinatorial auctions with decreasing marginal utilities. Games Econom. Behav. 55(2), 270\u2013296 (2006)","journal-title":"Games Econom. Behav."},{"issue":"5","key":"9_CR29_9","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.: Truth revelation in approximately efficient combinatorial auctions. J.\u00a0ACM 49(5), 577\u2013602 (2002)","journal-title":"J. ACM"},{"key":"9_CR30_9","unstructured":"Mu'alem, A., Schapira, M.: Setting lower bounds on truthfulness. In: Proc. 18th Symposium on Discrete Algorithms (SODA), 2007"},{"key":"9_CR31_9","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Computationally feasible vcg mechanisms. In: Proc. of the 2nd ACM Conference on Electronic Commerce (EC'00), 2000","DOI":"10.1145\/352871.352898"},{"key":"9_CR32_9","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 Econom. Behav. 35, 166\u2013196 (2001)","journal-title":"Games Econom. Behav."},{"key":"9_CR33_9","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press (2007). (expected to appear)","DOI":"10.1017\/CBO9780511800481"},{"key":"9_CR34_9","unstructured":"Roberts, K.: The characterization of implementable choice rules. In: Laffont, J.J. (ed.) Aggregation and Revelation of Preferences, pp. 321\u2013349. North-Holland (1979)"},{"key":"9_CR35_9","doi-asserted-by":"crossref","unstructured":"Saks, M., Yu, L.: Weak monotonicity suffices for truthfulness on convex domains. In: Proc. 6th ACM Conference on Electronic Commerce (ACM-EC), 2005, pp. 286\u2013293","DOI":"10.1145\/1064009.1064040"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T01:56:36Z","timestamp":1662170196000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_9"}},"subtitle":["1999; Nisan, Ronen"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_9","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}