{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:53Z","timestamp":1742914133258,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319112053"},{"type":"electronic","value":"9783319112060"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11206-0_2","type":"book-chapter","created":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T01:31:55Z","timestamp":1410744715000},"page":"13-24","source":"Crossref","is-referenced-by-count":6,"title":["Allocation in Practice"],"prefix":"10.1007","author":[{"given":"Toby","family":"Walsh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Dickerson, J., Procaccia, A., Sandholm, T.: Optimizing kidney exchange with transplant chains: Theory and reality. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2012, vol.\u00a02, pp. 711\u2013718. International Foundation for Autonomous Agents and Multiagent Systems (2012)"},{"key":"2_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair Division: From cake-cutting to dispute resolution","author":"S. Brams","year":"1996","unstructured":"Brams, S., Taylor, A.: Fair Division: From cake-cutting to dispute resolution. Cambridge University Press, Cambridge (1996)"},{"issue":"1","key":"2_CR3","first-page":"3","volume":"30","author":"Y. Chevaleyre","year":"2006","unstructured":"Chevaleyre, Y., Dunne, P., Endriss, U., Lang, J., Lemaitre, M., Maudet, N., Padget, J., Phelps, S., Rodriguez-Aguilar, J., Sousa, P.: Issues in multiagent resource allocation. Informatica (Slovenia)\u00a030(1), 3\u201331 (2006)","journal-title":"Informatica (Slovenia)"},{"key":"2_CR4","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Foundations of Artificial Intelligence. Elsevier (2006)"},{"key":"2_CR5","series-title":"LNAI","first-page":"292","volume-title":"ADT 2011","author":"T. Walsh","year":"2011","unstructured":"Walsh, T.: Online cake cutting. In: Brafman, R.I., Roberts, F., Tsouki\u00e0s, A. (eds.) ADT 2011. LNCS (LNAI), vol.\u00a06992, pp. 292\u2013305. Springer, Heidelberg (2011)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-10841-9_23","volume-title":"Internet and Network Economics","author":"M. Guo","year":"2009","unstructured":"Guo, M., Conitzer, V., Reeves, D.M.: Competitive repeated allocation without payments. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 244\u2013255. Springer, Heidelberg (2009)"},{"key":"2_CR7","unstructured":"Gent, I., Walsh, T.: Phase transitions from real computational problems. In: Proceedings of the 8th International Symposium on Artificial Intelligence, pp. 356\u2013364 (1995)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Gent, I., Walsh, T.: Easy problems are sometimes hard. Artificial Intelligence, 335\u2013345 (1994)","DOI":"10.1016\/0004-3702(94)90109-0"},{"key":"2_CR9","unstructured":"Gent, I., Walsh, T.: The SAT phase transition. In: Cohn, A.G. (ed.) Proceedings of 11th ECAI, pp. 105\u2013109. John Wiley & Sons (1994)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Gent, I., Walsh, T.: The hardest random SAT problems. In: Proceedings of KI 1994, Saarbrucken (1994)","DOI":"10.1007\/3-540-58467-6_31"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Gent, I., Walsh, T.: The satisfiability constraint gap. Artificial Intelligence 81(1-2) (1996)","DOI":"10.1016\/0004-3702(95)00047-X"},{"key":"2_CR12","unstructured":"Slaney, J., Walsh, T.: Backbones in optimization and approximation. In: Proceedings of 17th IJCAI, International Joint Conference on Artificial Intelligence (2001)"},{"key":"2_CR13","unstructured":"Kilby, P., Slaney, J., Thiebaux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: Proceedings of the 20th National Conference on AI. Association for Advancement of Artificial Intelligence (2005)"},{"key":"2_CR14","unstructured":"Kilby, P., Slaney, J., Walsh, T.: The backbone of the travelling salesperson. In: IJCAI, pp. 175\u2013180 (2005)"},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1287\/trsc.1030.0035","volume":"38","author":"S. Engevall","year":"2004","unstructured":"Engevall, S., G\u00f6the-Lundgren, M., V\u00e4rbrand, P.: The heterogeneous vehicle-routing game. Transportation Science\u00a038(1), 71\u201385 (2004)","journal-title":"Transportation Science"},{"issue":"6","key":"2_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00355ED1V01Y201107AIM016","volume":"5","author":"G. Chalkiadakis","year":"2011","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational aspects of cooperative game theory. Synthesis Lectures on Artificial Intelligence and Machine Learning\u00a05(6), 1\u2013168 (2011)","journal-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning"},{"key":"2_CR17","unstructured":"Aziz, H., Cahan, C., Gretton, C., Kilby, P., Mattei, N., Walsh, T.: A study of proxies for Shapley allocation of transport costs. Journal of Artificial Intelligence Research (Under review, 2014)"},{"key":"2_CR18","unstructured":"Mann, I., Shapley, L.S.: Values for large games IV: Evaluating the electoral college by monte carlo. Technical report, The RAND Corporation, Santa Monica, CA, USA (1960)"},{"issue":"5","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.cor.2008.04.004","volume":"36","author":"J. Castro","year":"2009","unstructured":"Castro, J., Gomez, D., Tejada, J.: Polynomial calculation of the Shapley value based on sampling. Computers & Operations Research\u00a036(5), 1726\u20131730 (2009)","journal-title":"Computers & Operations Research"},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1613\/jair.2467","volume":"32","author":"S. Bouveret","year":"2008","unstructured":"Bouveret, S., Lang, J.: Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. Journal of Artificial Intelligence Research (JAIR)\u00a032, 525\u2013564 (2008)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.2002.1219","volume":"43","author":"R. Irving","year":"2002","unstructured":"Irving, R., Manlove, D.: The stable roommates problem with ties. J. Algorithms\u00a043(1), 85\u2013105 (2002)","journal-title":"J. Algorithms"},{"key":"2_CR22","first-page":"351","volume-title":"Proceedings of the 2013 International Conference on Autonomous Agents and Multi-agent Systems, AAMAS 2013","author":"I. Kash","year":"2013","unstructured":"Kash, I., Procaccia, A., Shah, N.: No agent left behind: Dynamic fair division of multiple resources. In: Proceedings of the 2013 International Conference on Autonomous Agents and Multi-agent Systems, AAMAS 2013, pp. 351\u2013358. International Foundation for Autonomous Agents and Multiagent Systems, Richland (2013)"},{"issue":"3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10878-009-9257-2","volume":"19","author":"E. McDermid","year":"2010","unstructured":"McDermid, E., Manlove, D.: Keeping partners together: algorithmic results for the hospitals\/residents problem with couples. Journal of Combinatorial Optimization\u00a019(3), 279\u2013303 (2010)","journal-title":"Journal of Combinatorial Optimization"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-44985-X_24","volume-title":"Algorithm Theory - SWAT 2000","author":"R.W. Irving","year":"2000","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: The hospitals\/residents problem with ties. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, pp. 259\u2013271. Springer, Heidelberg (2000)"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/2492002.2482596","volume-title":"Proceedings of the Fourteenth ACM Conference on Electronic Commerce, EC 2013","author":"J. Dickerson","year":"2013","unstructured":"Dickerson, J., Procaccia, A., Sandholm, T.: Failure-aware kidney exchange. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce, EC 2013, pp. 323\u2013340. ACM, New York (2013)"},{"issue":"1","key":"2_CR26","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jda.2006.03.006","volume":"5","author":"D. Abraham","year":"2007","unstructured":"Abraham, D., Irving, R., Manlove, D.: Two algorithms for the student-project allocation problem. Journal of Discrete Algorithms\u00a05(1), 73\u201390 (2007)","journal-title":"Journal of Discrete Algorithms"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Koster, M.: Cost sharing. In: Encyclopedia of Complexity and Systems Science, pp. 724\u2013753 (2009)","DOI":"10.1007\/978-1-4614-1800-9_47"},{"key":"2_CR28","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-0-387-77247-9_6","volume-title":"Pareto Optimality, Game Theory and Equilibria","author":"I. Curiel","year":"2008","unstructured":"Curiel, I.: Cooperative combinatorial games. In: Chinchuluun, A., Pardalos, P., Migdalas, A., Pitsoulis, L. (eds.) Pareto Optimality, Game Theory and Equilibria. Springer Optimization and Its Applications, vol.\u00a017, pp. 131\u2013157. Springer, New York (2008)"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Young, H.P.: Producer incentives in cost allocation 53(4), 757\u2013765 (1985)","DOI":"10.2307\/1912652"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Young, H.P.: Cost allocation. In: Handbook of Game Theory with Economic Applications, vol. 2, pp. 1193\u20131235 (1994)","DOI":"10.1016\/S1574-0005(05)80066-9"},{"key":"2_CR31","unstructured":"Mann, I., Shapley, L.S.: Values for large games IV: Evaluating the electoral college exactly. Technical report, The RAND Corporation, Santa Monica, CA, USA (1962)"},{"issue":"1-3","key":"2_CR32","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01585702","volume":"53","author":"J.A. Potters","year":"1992","unstructured":"Potters, J.A., Curiel, I.J., Tijs, S.H.: Traveling salesman games. Mathematical Programming\u00a053(1-3), 199\u2013211 (1992)","journal-title":"Mathematical Programming"},{"issue":"2","key":"2_CR33","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01295848","volume":"26","author":"J. Derks","year":"1997","unstructured":"Derks, J., Kuipers, J.: On the core of routing games. International Journal of Game Theory\u00a026(2), 193\u2013205 (1997)","journal-title":"International Journal of Game Theory"},{"issue":"1","key":"2_CR34","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02592333","volume":"72","author":"M. G\u00f6the-Lundgren","year":"1996","unstructured":"G\u00f6the-Lundgren, M., J\u00f6rnsten, K., V\u00e4rbrand, P.: On the nucleolus of the basic vehicle routing game. Mathematical Programming\u00a072(1), 83\u2013100 (1996)","journal-title":"Mathematical Programming"},{"issue":"1","key":"2_CR35","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1287\/opre.1120.1130","volume":"61","author":"O.O. \u00d6zener","year":"2013","unstructured":"\u00d6zener, O.O., Ergun, O., Savelsbergh, M.: Allocating cost of service to customers in inventory routing. Oper. Res.\u00a061(1), 112\u2013125 (2013)","journal-title":"Oper. Res."},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press (2006)","DOI":"10.7551\/mitpress\/9780262033428.001.0001"},{"issue":"1","key":"2_CR37","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1111\/j.1468-2354.2009.00572.x","volume":"51","author":"T. Sonmez","year":"2010","unstructured":"Sonmez, T., Unver, M.: Course bidding at business schools. International Economic Review\u00a051(1), 99\u2013123 (2010)","journal-title":"International Economic Review"},{"issue":"5","key":"2_CR38","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1257\/aer.102.5.2237","volume":"102","author":"E. Budish","year":"2012","unstructured":"Budish, E., Cantillon, E.: The Multi-Unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard. American Economic Review\u00a0102(5), 2237\u20132271 (2012)","journal-title":"American Economic Review"},{"key":"2_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-60299-2_5","volume-title":"Principles and Practice of Constraint Programming - CP \u201995","author":"I. Gent","year":"1995","unstructured":"Gent, I., MacIntyre, E., Prosser, P., Walsh, T.: Scaling effects in the CSP phase transition. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol.\u00a0976, pp. 70\u201387. Springer, Heidelberg (1995)"},{"key":"2_CR40","unstructured":"Gent, I., MacIntyre, E., Prosser, P., Walsh, T.: The constrainedness of search. In: Proceedings of the 13th National Conference on AI, pp. 246\u2013252. Association for Advancement of Artificial Intelligence (1996)"},{"key":"2_CR41","unstructured":"Gent, I., MacIntyre, E., Prosser, P., Walsh, T.: The scaling of search cost. In: Proceedings of the 14th National Conference on AI, pp. 315\u2013320. Association for Advancement of Artificial Intelligence (1997)"},{"key":"2_CR42","unstructured":"Walsh, T.: The constrainedness knife-edge. In: Proceedings of the 15th National Conference on AI. Association for Advancement of Artificial Intelligence (1998)"},{"issue":"4","key":"2_CR43","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1011454308633","volume":"6","author":"I. Gent","year":"2001","unstructured":"Gent, I., MacIntyre, E., Prosser, P., Smith, B., Walsh, T.: Random constraint satisfaction: Flaws and structure. Constraints\u00a06(4), 345\u2013372 (2001)","journal-title":"Constraints"},{"key":"2_CR44","unstructured":"Gent, I., Walsh, T.: Phase transitions and annealed theories: Number partitioning as a case study. In: Proceedings of 12th ECAI (1996)"},{"issue":"3","key":"2_CR45","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1111\/0824-7935.00069","volume":"14","author":"I. Gent","year":"1998","unstructured":"Gent, I., Walsh, T.: Analysis of heuristics for number partitioning. Computational Intelligence\u00a014(3), 430\u2013451 (1998)","journal-title":"Computational Intelligence"},{"key":"2_CR46","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/S0004-3702(96)00030-6","volume":"88","author":"I. Gent","year":"1996","unstructured":"Gent, I., Walsh, T.: The TSP phase transition. Artificial Intelligence\u00a088, 349\u2013358 (1996)","journal-title":"Artificial Intelligence"},{"key":"2_CR47","unstructured":"Walsh, T.: Where are the really hard manipulation problems? The phase transition in manipulating the veto rule. In: Proceedings of 21st IJCAI, International Joint Conference on Artificial Intelligence, pp. 324\u2013329 (2009)"},{"key":"2_CR48","unstructured":"Walsh, T.: An empirical study of the manipulability of single transferable voting. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) Proc. of the 19th European Conference on Artificial Intelligence (ECAI 2010). Frontiers in Artificial Intelligence and Applications, vol.\u00a0215, pp. 257\u2013262. IOS Press (2010)"},{"key":"2_CR49","first-page":"1","volume":"42","author":"T. Walsh","year":"2011","unstructured":"Walsh, T.: Where are the hard manipulation problems? Journal of Artificial Intelligence Research\u00a042, 1\u201339 (2011)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2_CR50","unstructured":"Walsh, T.: Search in a small world. In: Proceedings of 16th IJCAI, International Joint Conference on Artificial Intelligence (1999)"},{"key":"2_CR51","unstructured":"Gent, I., Walsh, T.: Beyond NP: the QSAT phase transition. In: Proceedings of the 16th National Conference on AI. Association for Advancement of Artificial Intelligence (1999)"},{"key":"2_CR52","unstructured":"Gent, I., Hoos, H., Prosser, P., Walsh, T.: Morphing: Combining structure and randomness. In: Proceedings of the 16th National Conference on AI. Association for Advancement of Artificial Intelligence (1999)"},{"key":"2_CR53","unstructured":"Walsh, T.: Search on high degree graphs. In: Proceedings of 17th IJCAI, International Joint Conference on Artificial Intelligence (2001)"},{"key":"2_CR54","unstructured":"Walsh, T.: From P to NP: COL, XOR, NAE, 1-in-k, and Horn SAT. In: Proceedings of the 17th National Conference on AI. Association for Advancement of Artificial Intelligence (2002)"}],"container-title":["Lecture Notes in Computer Science","KI 2014: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11206-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T19:01:24Z","timestamp":1676660484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11206-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319112053","9783319112060"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11206-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}