Skip to main content
SpringerLink
Log in
Book cover

Joint German/Austrian Conference on Artificial Intelligence (Künstliche Intelligenz)

KI 2014: KI 2014: Advances in Artificial Intelligence pp 13–24Cite as

Allocation in Practice

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8736))

Abstract

How do we allocate scarce resources? How do we fairly allocate costs? These are two pressing challenges facing society today. I discuss two recent projects at NICTA concerning resource and cost allocation. In the first, we have been working with FoodBank Local, a social startup working in collaboration with food bank charities around the world to optimise the logistics of collecting and distributing donated food. Before we can distribute this food, we must decide how to allocate it to different charities and food kitchens. This gives rise to a fair division problem with several new dimensions, rarely considered in the literature. In the second, we have been looking at cost allocation within the distribution network of a large multinational company. This also has several new dimensions rarely considered in the literature.

The work described here is joint with many colleagues including: Martin Aleksandrov, Haris Aziz, Casey Cahan, Charles Grettom, Phil Kilby, Nick Mattei. NICTA is supported by the Australian Government through the Department of Communications and the Australian Research Council through the ICT Centre of Excellence Program. The author receives support from the Federal Ministry for Education and Research via the Alexander von Humboldt Foundation.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2, pp. 711–718. International Foundation for Autonomous Agents and Multiagent Systems (2012)

    Google Scholar 

  2. Brams, S., Taylor, A.: Fair Division: From cake-cutting to dispute resolution. Cambridge University Press, Cambridge (1996)

    Book  MATH  Google Scholar 

  3. 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) 30(1), 3–31 (2006)

    MATH  Google Scholar 

  4. Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Foundations of Artificial Intelligence. Elsevier (2006)

    Google Scholar 

  5. Walsh, T.: Online cake cutting. In: Brafman, R.I., Roberts, F., Tsoukiàs, A. (eds.) ADT 2011. LNCS (LNAI), vol. 6992, pp. 292–305. Springer, Heidelberg (2011)

    Google Scholar 

  6. Guo, M., Conitzer, V., Reeves, D.M.: Competitive repeated allocation without payments. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 244–255. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Gent, I., Walsh, T.: Phase transitions from real computational problems. In: Proceedings of the 8th International Symposium on Artificial Intelligence, pp. 356–364 (1995)

    Google Scholar 

  8. Gent, I., Walsh, T.: Easy problems are sometimes hard. Artificial Intelligence, 335–345 (1994)

    Google Scholar 

  9. Gent, I., Walsh, T.: The SAT phase transition. In: Cohn, A.G. (ed.) Proceedings of 11th ECAI, pp. 105–109. John Wiley & Sons (1994)

    Google Scholar 

  10. Gent, I., Walsh, T.: The hardest random SAT problems. In: Proceedings of KI 1994, Saarbrucken (1994)

    Google Scholar 

  11. Gent, I., Walsh, T.: The satisfiability constraint gap. Artificial Intelligence 81(1-2) (1996)

    Google Scholar 

  12. Slaney, J., Walsh, T.: Backbones in optimization and approximation. In: Proceedings of 17th IJCAI, International Joint Conference on Artificial Intelligence (2001)

    Google Scholar 

  13. 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)

    Google Scholar 

  14. Kilby, P., Slaney, J., Walsh, T.: The backbone of the travelling salesperson. In: IJCAI, pp. 175–180 (2005)

    Google Scholar 

  15. Engevall, S., Göthe-Lundgren, M., Värbrand, P.: The heterogeneous vehicle-routing game. Transportation Science 38(1), 71–85 (2004)

    Article  Google Scholar 

  16. Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational aspects of cooperative game theory. Synthesis Lectures on Artificial Intelligence and Machine Learning 5(6), 1–168 (2011)

    Article  Google Scholar 

  17. 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)

    Google Scholar 

  18. 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)

    Google Scholar 

  19. Castro, J., Gomez, D., Tejada, J.: Polynomial calculation of the Shapley value based on sampling. Computers & Operations Research 36(5), 1726–1730 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  20. Bouveret, S., Lang, J.: Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity. Journal of Artificial Intelligence Research (JAIR) 32, 525–564 (2008)

    MathSciNet  MATH  Google Scholar 

  21. Irving, R., Manlove, D.: The stable roommates problem with ties. J. Algorithms 43(1), 85–105 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  22. 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–358. International Foundation for Autonomous Agents and Multiagent Systems, Richland (2013)

    Google Scholar 

  23. McDermid, E., Manlove, D.: Keeping partners together: algorithmic results for the hospitals/residents problem with couples. Journal of Combinatorial Optimization 19(3), 279–303 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  24. Irving, R.W., Manlove, D.F., Scott, S.: The hospitals/residents problem with ties. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 259–271. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  25. Dickerson, J., Procaccia, A., Sandholm, T.: Failure-aware kidney exchange. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce, EC 2013, pp. 323–340. ACM, New York (2013)

    Chapter  Google Scholar 

  26. Abraham, D., Irving, R., Manlove, D.: Two algorithms for the student-project allocation problem. Journal of Discrete Algorithms 5(1), 73–90 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  27. Koster, M.: Cost sharing. In: Encyclopedia of Complexity and Systems Science, pp. 724–753 (2009)

    Google Scholar 

  28. 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. 17, pp. 131–157. Springer, New York (2008)

    Chapter  Google Scholar 

  29. Young, H.P.: Producer incentives in cost allocation 53(4), 757–765 (1985)

    Google Scholar 

  30. Young, H.P.: Cost allocation. In: Handbook of Game Theory with Economic Applications, vol. 2, pp. 1193–1235 (1994)

    Google Scholar 

  31. 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)

    Google Scholar 

  32. Potters, J.A., Curiel, I.J., Tijs, S.H.: Traveling salesman games. Mathematical Programming 53(1-3), 199–211 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  33. Derks, J., Kuipers, J.: On the core of routing games. International Journal of Game Theory 26(2), 193–205 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  34. Göthe-Lundgren, M., Jörnsten, K., Värbrand, P.: On the nucleolus of the basic vehicle routing game. Mathematical Programming 72(1), 83–100 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  35. Özener, O.O., Ergun, O., Savelsbergh, M.: Allocating cost of service to customers in inventory routing. Oper. Res. 61(1), 112–125 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  36. Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press (2006)

    Google Scholar 

  37. Sonmez, T., Unver, M.: Course bidding at business schools. International Economic Review 51(1), 99–123 (2010)

    Article  MathSciNet  Google Scholar 

  38. Budish, E., Cantillon, E.: The Multi-Unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard. American Economic Review 102(5), 2237–2271 (2012)

    Article  Google Scholar 

  39. 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. 976, pp. 70–87. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  40. Gent, I., MacIntyre, E., Prosser, P., Walsh, T.: The constrainedness of search. In: Proceedings of the 13th National Conference on AI, pp. 246–252. Association for Advancement of Artificial Intelligence (1996)

    Google Scholar 

  41. Gent, I., MacIntyre, E., Prosser, P., Walsh, T.: The scaling of search cost. In: Proceedings of the 14th National Conference on AI, pp. 315–320. Association for Advancement of Artificial Intelligence (1997)

    Google Scholar 

  42. Walsh, T.: The constrainedness knife-edge. In: Proceedings of the 15th National Conference on AI. Association for Advancement of Artificial Intelligence (1998)

    Google Scholar 

  43. Gent, I., MacIntyre, E., Prosser, P., Smith, B., Walsh, T.: Random constraint satisfaction: Flaws and structure. Constraints 6(4), 345–372 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  44. Gent, I., Walsh, T.: Phase transitions and annealed theories: Number partitioning as a case study. In: Proceedings of 12th ECAI (1996)

    Google Scholar 

  45. Gent, I., Walsh, T.: Analysis of heuristics for number partitioning. Computational Intelligence 14(3), 430–451 (1998)

    Article  MathSciNet  Google Scholar 

  46. Gent, I., Walsh, T.: The TSP phase transition. Artificial Intelligence 88, 349–358 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  47. 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–329 (2009)

    Google Scholar 

  48. 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. 215, pp. 257–262. IOS Press (2010)

    Google Scholar 

  49. Walsh, T.: Where are the hard manipulation problems? Journal of Artificial Intelligence Research 42, 1–39 (2011)

    MathSciNet  MATH  Google Scholar 

  50. Walsh, T.: Search in a small world. In: Proceedings of 16th IJCAI, International Joint Conference on Artificial Intelligence (1999)

    Google Scholar 

  51. 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)

    Google Scholar 

  52. 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)

    Google Scholar 

  53. Walsh, T.: Search on high degree graphs. In: Proceedings of 17th IJCAI, International Joint Conference on Artificial Intelligence (2001)

    Google Scholar 

  54. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. NICTA and UNSW, Sydney, Australia

    Toby Walsh

Authors
  1. Toby Walsh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Bremen, Germany

    Carsten Lutz

  2. University of New South Wales, 2052, Sydney, NSW, Australia

    Michael Thielscher

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Walsh, T. (2014). Allocation in Practice. In: Lutz, C., Thielscher, M. (eds) KI 2014: Advances in Artificial Intelligence. KI 2014. Lecture Notes in Computer Science(), vol 8736. Springer, Cham. https://doi.org/10.1007/978-3-319-11206-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11206-0_2

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11205-3

  • Online ISBN: 978-3-319-11206-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation