Allocation in Practice

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.

• Publication year

  2014

• Venue

  Deutsche Jahrestagung für Künstliche Intelligenz

• Publication date

  2014-07-11

• Fields of study

  Business, Economics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-11206-0_2arXiv 1407.3130
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Handbook of Game Theory with Economic Applications

  2015cited by this paper
• A Study of Proxies for Shapley Allocations of Transport Costs

  2014cited by this paper
• Failure-aware kidney exchange

  2013cited by this paper
• International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '13, Saint Paul, MN, USA, May 6-10, 2013

  2013cited by this paper
• No agent left behind: dynamic fair division of multiple resources

  2013cited by this paper
• Allocating Cost of Service to Customers in Inventory Routing

  2013cited by this paper
• Optimizing kidney exchange with transplant chains: theory and reality

  2012cited by this paper
• Computational Aspects of Cooperative Game Theory

  2011cited by this paper
• Online Cake Cutting

  2010cited by this paper
• An Empirical Study of the Manipulability of Single Transferable Voting

  2010cited by this paper
• COURSE BIDDING AT BUSINESS SCHOOLS

  2010cited by this paper
• Keeping partners together: algorithmic results for the hospitals/residents problem with couples

  2010cited by this paper
• Where are the hard manipulation problems?

  2010cited by this paper
• Competitive Repeated Allocation without Payments

  2009cited by this paper
• Polynomial calculation of the Shapley value based on sampling

  2009cited by this paper
• Where Are the Really Hard Manipulation Problems? The Phase Transition in Manipulating the Veto Rule

  2009cited by this paper
• The Multi-unit Assignment Problem : Theory and Evidence from Course Allocation at Harvard

  2009cited by this paper
• Pareto optimality, game theory and equilibria

  2008cited by this paper
• Encyclopedia of Complexity and Systems Science

  2008cited by this paper
• Cooperative Combinatorial Games

  2008cited by this paper
• Two algorithms for the Student-Project Allocation problem

  2007cited by this paper
• Handbook of Constraint Programming

  2006cited by this paper
• Issues in Multiagent Resource Allocation

  2006cited by this paper
• Handbook of Constraint Programming (Foundations of Artificial Intelligence)

  2006cited by this paper
• Backbones and Backdoors in Satisfiability

  2005cited by this paper
• Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity

  2005cited by this paper
• The Backbone of the Travelling Salesperson

  2005cited by this paper
• The Heterogeneous Vehicle - Routing Game

  2004cited by this paper
• The interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT

  2002cited by this paper
• The Stable Roommates Problem with Ties

  2002cited by this paper
• Random Constraint Satisfaction: Flaws and Structure

  2001cited by this paper
• Search on High Degree Graphs

  2001cited by this paper
• Backbones in Optimization and Approximation

  2001cited by this paper
• The Hospitals/Residents Problem with Ties

  2000cited by this paper
• Beyond NP: the QSAT phase transition

  1999cited by this paper
• The SAT phase transition

  1999cited by this paper
• Search in a Small World

  1999cited by this paper
• Morphing: Combining Structure and Randomness

  1999cited by this paper
• Analysis of Heuristics for Number Partitioning

  1998cited by this paper
• The Constrainedness Knife-Edge

  1998cited by this paper
• The Scaling of Search Cost

  1997cited by this paper
• On the core of routing games

  1997cited by this paper
• The TSP Phase Transition

  1996cited by this paper
• On the nucleolus of the basic vehicle routing game

  1996cited by this paper
• The Satisfiability Constraint Gap

  1996cited by this paper
• Fair Division: From Cake-Cutting to Dispute Resolution

  1996cited by this paper
• Phase Transitions and Annealed Theories: Number Partitioning as a Case Study

  1996cited by this paper
• The Constrainedness of Search

  1996cited by this paper
• Cost allocation

  1996cited by this paper
• Scaling Effects in the CSP Phase Transition

  1995cited by this paper
• Phase Transitions from Real Computational Problems

  1995cited by this paper
• Easy Problems are Sometimes Hard

  1994cited by this paper
• The Hardest Random SAT Problems

  1994cited by this paper
• Chapter 34 Cost allocation

  1994cited by this paper
• Traveling salesman games

  1992cited by this paper
• Producer Incentives in Cost Allocation

  1985cited by this paper
• Cost Allocation

  1980cited by this paper
• VALUES OF LARGE GAMES. 6: EVALUATING THE ELECTORAL COLLEGE EXACTLY

  1962cited by this paper

• Online Resource Sharing: Better Robust Guarantees via Randomized Strategies

  2025cites this paper
• Mechanism Design with Delegated Bidding

  2024cites this paper
• Online Resource Sharing via Dynamic Max-Min Fairness: Efficiency, Robustness and Non-Stationarity

  2023cites this paper
• Multi-agent Online Scheduling: MMS Allocations for Indivisible Items

  2023cites this paper
• Online fair division with arbitrary entitlements

  2023cites this paper
• Robust Pseudo-Markets for Reusable Public Resources

  2023cites this paper
• Fair Division: The Computer Scientist's Perspective

  2020cites this paper
• Online Fair Division: A Survey

  2019cites this paper
• Strategy-Proofness, Envy-Freeness and Pareto Efficiency in Online Fair Division with Additive Utilities

  2019cites this paper
• Monotone and Online Fair Division

  2019cites this paper
• Most Competitive Mechanisms in Online Fair Division

  2017cites this paper
• Pure Nash Equilibria in Online Fair Division

  2017cites this paper
• Deceased Organ Matching in Australia

  2017cites this paper
• Near-efficient allocation using artificial currency in repeated settings

  2016cites this paper
• Strategic Behaviour When Allocating Indivisible Goods

  2016cites this paper
• Challenges in Resource and Cost Allocation

  2015cites this paper
• Online Fair Division: Analysing a Food Bank Problem

  2015cites this paper