{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:54Z","timestamp":1740098934339,"version":"3.37.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319671895"},{"type":"electronic","value":"9783319671901"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67190-1_4","type":"book-chapter","created":{"date-parts":[[2017,9,18]],"date-time":"2017-09-18T05:48:49Z","timestamp":1505713729000},"page":"44-57","source":"Crossref","is-referenced-by-count":3,"title":["Most Competitive Mechanisms in Online Fair Division"],"prefix":"10.1007","author":[{"given":"Martin","family":"Aleksandrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,19]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2012.03.031","volume":"443","author":"S Albers","year":"2012","unstructured":"Albers, S., Hellwig, M.: Semi-online scheduling revisited. Theor. Comput. Sci. 443, 1\u20139 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR2","unstructured":"Aleksandrov, M., Aziz, H., Gaspers, S., Walsh, T.: Online fair division: analysing a food bank problem. In: Proceedings of the Twenty-Fourth IJCAI 2015, Buenos Aires, Argentina, pp. 2540\u20132546, 25\u201331 July 2015"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-10631-6_35","volume-title":"Algorithms and Computation","author":"H-J B\u00f6ckenhauer","year":"2009","unstructured":"B\u00f6ckenhauer, H.-J., Komm, D., Kr\u00e1lovi\u010d, R., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: On the advice complexity of online problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 331\u2013340. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-10631-6_35"},{"key":"4_CR4","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"3","key":"4_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/2993749.2993766","volume":"47","author":"J Boyar","year":"2016","unstructured":"Boyar, J., Favrholdt, L.M., Kudahl, C., Larsen, K.S., Mikkelsen, J.W.: Online algorithms with advice: a survey. SIGACT News 47(3), 93\u2013129 (2016)","journal-title":"SIGACT News"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Brualdi, R.: Combinatorial Matrix Classes. No. 13 in Combinatorial Matrix Classes, Cambridge University Press (2006). \nhttps:\/\/books.google.de\/books?id=xdP9d8S1BxQC","DOI":"10.1017\/CBO9780511721182"},{"key":"4_CR7","unstructured":"Brubach, B., Sankararaman, K.A., Srinivasan, A., Xu, P.: New algorithms, better bounds, and a novel model for online stochastic matching. In: 24th Annual European Symposium on Algorithms, ESA, Aarhus, Denmark, pp. 1\u201316, 22\u201324 August 2016"},{"issue":"3","key":"4_CR8","first-page":"585","volume":"43","author":"S Dobrev","year":"2009","unstructured":"Dobrev, S., Kr\u00e1lovic, R., Pardubsk\u00e1, D.: Measuring the problem-relevant information in input. Int. Tromb. Assoc. 43(3), 585\u2013613 (2009)","journal-title":"Int. Tromb. Assoc."},{"key":"4_CR9","unstructured":"Freeman, R., Zahedi, S.M., Conitzer, V.: Fair social choice in dynamic settings. Paper presented at the 3rd (EXPLORE) Workshop, 15th AAMAS Conference 2016, Singapore, 9\u201310 May 2016"},{"key":"4_CR10","first-page":"89","volume":"11","author":"A Gy\u00f6rgy","year":"2010","unstructured":"Gy\u00f6rgy, A., Lugosi, G., Ottucs\u00e1k, G.: On-line sequential bin packing. J. Mach. Learn. Res. 11, 89\u2013109 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"4_CR11","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1287\/moor.2013.0621","volume":"39","author":"P Jaillet","year":"2014","unstructured":"Jaillet, P., Lu, X.: Online stochastic matching: new algorithms with better bounds. Math. Oper. Res. 39(3), 624\u2013646 (2014)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"4_CR12","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0304-3975(99)00140-1","volume":"233","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci. 233(1\u20132), 319\u2013325 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, USA, pp. 352\u2013358, 13\u201317 May 1990","DOI":"10.1145\/100216.100262"},{"issue":"2","key":"4_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(94)90042-6","volume":"127","author":"S Khuller","year":"1994","unstructured":"Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-line algorithms for weighted bipartite matching and stable marriages. Theor. Comput. Sci. 127(2), 255\u2013267 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR15","first-page":"73","volume":"68","author":"A Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Math. Program. 68, 73\u2013104 (1995)","journal-title":"Math. Program."},{"issue":"4","key":"4_CR16","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1561\/0400000057","volume":"8","author":"A Mehta","year":"2013","unstructured":"Mehta, A.: Online matching and ad allocation. Found. Trends Theor. Comput. Sci. 8(4), 265\u2013368 (2013)","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"12","key":"4_CR17","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1016\/j.ipl.2014.06.013","volume":"114","author":"S Miyazaki","year":"2014","unstructured":"Miyazaki, S.: On the advice complexity of online bipartite matching and online stable marriage. Inf. Process. Lett. 114(12), 714\u2013717 (2014)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"4_CR18","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/s10458-013-9224-2","volume":"28","author":"N Nguyen","year":"2014","unstructured":"Nguyen, N., Nguyen, T.T., Roos, M., Rothe, J.: Computational complexity and approximability of social welfare optimization in multiagent resource allocation. Auton. Agents Multi-Agent Syst. 28(2), 256\u2013289 (2014)","journal-title":"Auton. Agents Multi-Agent Syst."},{"issue":"5","key":"4_CR19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0167-6377(00)00053-5","volume":"27","author":"SS Seiden","year":"2000","unstructured":"Seiden, S.S., Sgall, J., Woeginger, G.J.: Semi-online scheduling with decreasing job sizes. Oper. Res. Lett. 27(5), 215\u2013221 (2000)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"4_CR20","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-11206-0_2","volume-title":"KI 2014: Advances in Artificial Intelligence","author":"T Walsh","year":"2014","unstructured":"Walsh, T.: Allocation in practice. In: Lutz, C., Thielscher, M. (eds.) KI 2014. LNCS (LNAI), vol. 8736, pp. 13\u201324. Springer, Cham (2014). doi:\n10.1007\/978-3-319-11206-0_2"},{"key":"4_CR22","unstructured":"Walsh, T.: Challenges in resource and cost allocation. In: Proceedings of 29th AAAI 2015, Austin, Texas, USA, pp. 4073\u20134077, 25\u201330 January 2015. \nhttp:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI15\/paper\/view\/9927"}],"container-title":["Lecture Notes in Computer Science","KI 2017: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67190-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,18]],"date-time":"2017-09-18T05:50:05Z","timestamp":1505713805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67190-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319671895","9783319671901"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67190-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}