{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:09:24Z","timestamp":1750910964951,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67190-1_3","type":"book-chapter","created":{"date-parts":[[2017,9,18]],"date-time":"2017-09-18T09:48:49Z","timestamp":1505728129000},"page":"29-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Expected Outcomes and Manipulations 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":[{"unstructured":"Aleksandrov, M., Aziz, H., Gaspers, S., Walsh, T.: Online fair division: analysing a food bank problem. In: Proceedings of IJCAI 2015, Buenos Aires, Argentina, pp. 2540\u20132546, 25\u201331 July 2015. http:\/\/ijcai.org\/papers15\/Abstracts\/IJCAI15-360.html","key":"3_CR1"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1613\/jair.4856","volume":"54","author":"H Aziz","year":"2015","unstructured":"Aziz, H., Brill, M., Fischer, F.A., Harrenstein, P., Lang, J., Seedig, H.G.: Possible and necessary winners of partial tournaments. J. Artif. Intell. Res. (JAIR) 54, 493\u2013534 (2015). http:\/\/dx.doi.org\/10.1613\/jair.4856","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., Mattei, N., Narodytska, N., Walsh, T.: Equilibria under the probabilistic serial rule. In: Proceedings of IJCAI 2015, Buenos Aires, Argentina, pp. 1105\u20131112, 25\u201331 July 2015. http:\/\/ijcai.org\/papers15\/Abstracts\/IJCAI15-160.html","key":"3_CR3"},{"unstructured":"Aziz, H., Walsh, T., Xia, L.: Possible and necessary allocations via sequential mechanisms. In: Proceedings of IJCAI 2015, Buenos Aires, Argentina, pp. 468\u2013474, 25\u201331 July 2015. http:\/\/ijcai.org\/papers15\/Abstracts\/IJCAI15-072.html","key":"3_CR4"},{"unstructured":"Bachrach, Y., Betzler, N., Faliszewski, P.: Probabilistic possible winner determination. In: Proceedings of AAAI 2010, Atlanta, Georgia, USA, 11\u201315 July 2010","key":"3_CR5"},{"doi-asserted-by":"crossref","unstructured":"Bouveret, S., Lang, J.: Manipulating picking sequences. In: ECAI 2014\u201321st European Conference on Artificial Intelligence, Prague, Czech Republic - Including PAIS, pp. 141\u2013146, 18\u201322 August 2014. http:\/\/dx.doi.org\/10.3233\/978-1-61499-419-0-141","key":"3_CR6","DOI":"10.3233\/978-1-61499-419-0-141"},{"key":"3_CR7","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04179-6","volume-title":"Completeness and Reduction in Algebraic Complexity Theory","author":"P B\u00fcrgisser","year":"2000","unstructured":"B\u00fcrgisser, P.: Completeness and Reduction in Algebraic Complexity Theory. Algorithms and Computation in Mathematics. Springer, New York (2000). http:\/\/opac.inria.fr\/record=b1099577"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(92)90234-7","volume":"102","author":"P Dagum","year":"1992","unstructured":"Dagum, P., Luby, M.: Approximating the permanent of graphs with large factors. Theor. Comput. Sci. 102(2), 283\u2013305 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-79228-4_32","volume-title":"Theory and Applications of Models of Computation","author":"M Demange","year":"2008","unstructured":"Demange, M., Ekim, T.: Minimum maximal matching is NP-hard in regular bipartite graphs. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 364\u2013374. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-79228-4_32"},{"key":"3_CR10","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"3_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/0406030","volume":"6","author":"JD Horton","year":"1993","unstructured":"Horton, J.D., Kilakos, K.: Minimum edge dominating sets. SIAM J. Discrete Math. 6(3), 375\u2013387 (1993). http:\/\/dx.doi.org\/10.1137\/0406030","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/0218077","volume":"18","author":"M Jerrum","year":"1989","unstructured":"Jerrum, M., Sinclair, A.: Approximating the permanent. SIAM J. of Comp. 18(6), 1149\u20131178 (1989). http:\/\/dx.doi.org\/10.1137\/0218077","journal-title":"SIAM J. of Comp."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-11409-0_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Y Okamoto","year":"2010","unstructured":"Okamoto, Y., Uehara, R., Uno, T.: Counting the number of matchings in chordal and chordal bipartite graph classes. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 296\u2013307. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-11409-0_26"},{"issue":"4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1287\/moor.2014.0707","volume":"40","author":"D Sab\u00e1n","year":"2015","unstructured":"Sab\u00e1n, D., Sethuraman, J.: The complexity of computing the random priority allocation matrix. Math. Oper. Res. 40(4), 1005\u20131014 (2015)","journal-title":"Math. Oper. Res."},{"issue":"42","key":"3_CR16","first-page":"230","volume":"2","author":"AM Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. J. Proc. Lond. Math. Soc. 2(42), 230\u2013265 (1936). http:\/\/www.cs.helsinki.fi\/u\/gionis\/cc05\/OnComputableNumbers.pdf","journal-title":"J. Proc. Lond. Math. Soc."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theor. Comput. Sci. 8, 189\u2013201 (1979). http:\/\/dx.doi.org\/10.1016\/0304-3975(79)90044\u20136","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"3_CR18","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979). http:\/\/dx.doi.org\/10.1137\/0208032","journal-title":"SIAM J. Comput."},{"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. http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI15\/paper\/view\/9927","key":"3_CR19"},{"key":"3_CR20","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.3186","volume":"41","author":"L Xia","year":"2011","unstructured":"Xia, L., Conitzer, V.: Determining possible and necessary winners given partial orders. J. Artif. Intell. Res. (JAIR) 41, 25\u201367 (2011)","journal-title":"J. Artif. Intell. Res. (JAIR)"}],"container-title":["Lecture Notes in Computer Science","KI 2017: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67190-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T19:49:26Z","timestamp":1750880966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67190-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319671895","9783319671901"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67190-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 September 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint German\/Austrian Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ki2017.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}