{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:41Z","timestamp":1725490421256},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_6","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T10:58:43Z","timestamp":1188039523000},"page":"40-52","source":"Crossref","is-referenced-by-count":16,"title":["Mechanism Design for Fractional Scheduling on Unrelated Machines"],"prefix":"10.1007","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[]},{"given":"Elias","family":"Koutsoupias","sequence":"additional","affiliation":[]},{"given":"Annam\u00e1ria","family":"Kov\u00e1cs","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-540-31856-9_6","volume-title":"STACS 2005","author":"N. Andelman","year":"2005","unstructured":"Andelman, N., Azar, Y., Sorani, M.: Truthful approximation mechanisms for scheduling selfish related machines. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 69\u201382. Springer, Heidelberg (2005)"},{"key":"6_CR2","unstructured":"Archer, A.: Mechanisms for Discrete Optimization with Rational Agents. PhD thesis, Cornell University (January 2004)"},{"key":"6_CR3","unstructured":"Archer, A., Papadimitriou, C.H., Talwar, K., Tardos, \u00c9.: An approximate truthful mechanism for combinatorial auctions with single parameter agents. In: SODA, pp. 205\u2013214 (2003)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: FOCS, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"6_CR5","unstructured":"Babaioff, M., Lavi, R., Pavlov, E.: Mechanism design for single-value domains. In: AAAI, pp. 241\u2013247 (2005)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Gonen, R., Nisan, N.: Incentive compatible multi unit combinatorial auctions. In: TARK, pp. 72\u201387 (2003)","DOI":"10.1145\/846241.846250"},{"issue":"4","key":"6_CR7","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"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanism design. In: STOC, pp. 39\u201348 (2005)","DOI":"10.1145\/1060590.1060597"},{"key":"6_CR9","unstructured":"Christodoulou, G., Koutsoupias, E., Vidali, A.: A lower bound for scheduling mechanisms. In: SODA, pp. 1163\u20131170 (2007)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. In: STOC, pp. 610\u2013618 (2005)","DOI":"10.1145\/1060590.1060681"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Truthful randomized mechanisms for combinatorial auctions. In: STOC, pp. 644\u2013652 (2006)","DOI":"10.1145\/1132516.1132607"},{"key":"6_CR12","unstructured":"Gui, H., M\u00fcller, R., Vohra, R.V.: Dominant strategy mechanisms with multidimensional types. In: Computing and Markets (2005)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/11561071_55","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Kov\u00e1cs","year":"2005","unstructured":"Kov\u00e1cs, A.: Fast monotone 3-approximation algorithm for scheduling related machines. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 616\u2013627. Springer, Heidelberg (2005)"},{"key":"6_CR14","unstructured":"Kov\u00e1cs, A.: Fast Algorithms for Two Scheduling Problems. PhD thesis, Universit\u00e4t des Saarlandes (2007)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Lavi, R., Mu\u2019alem, A., Nisan, N.: Towards a characterization of truthful combinatorial auctions. In: FOCS, pp. 574\u2013583 (2003)","DOI":"10.1109\/SFCS.2003.1238230"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. In: FOCS, pp. 595\u2013604 (2005)","DOI":"10.1109\/SFCS.2005.76"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming\u00a046(1), 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"key":"6_CR18","unstructured":"Mu\u2019alem, A., Schapira, M.: Setting lower bounds on truthfulness. In: SODA, pp. 1143\u20131152 (2007)"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R.B. Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Mathematics of Operations Research\u00a06(1), 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"key":"6_CR20","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"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Saks, M.E., Yu, L.: Weak monotonicity suffices for truthfulness on convex domains. In: EC, pp. 286\u2013293 (2005)","DOI":"10.1145\/1064009.1064040"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:11:21Z","timestamp":1619503881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}