# Fair sharing of resources in a supply network with constraints.

@article{Carvalho2012FairSO, title={Fair sharing of resources in a supply network with constraints.}, author={Rui Carvalho and L’ubo{\vs} Buzna and Wolfram Just and Dirk Helbing and David K. Arrowsmith}, journal={Physical review. E, Statistical, nonlinear, and soft matter physics}, year={2012}, volume={85 4 Pt 2}, pages={ 046101 } }

This paper investigates the effect of network topology on the fair allocation of network resources among a set of agents, an all-important issue for the efficiency of transportation networks all around us. We analyze a generic mechanism that distributes network capacity fairly among existing flow demands. The problem can be solved by semianalytical methods on a nearest-neighbor graph with one source and sink pair, when transport occurs over shortest paths. For this setup, we uncover a broad…

## Topics from this paper

## 11 Citations

Controlling Congestion on Complex Networks

- Computer ScienceArXiv
- 2015

The results show that on large random networks a network operator can implement the trade-off instead of the fair allocation with little sacrifice in throughput, and illustrate how the previously studied uniform-flow approach leaves networks severely underutilised in comparison with congestion control algorithms.

Controlling congestion on complex networks: fairness, efficiency and network structure

- Computer Science, PhysicsScientific Reports
- 2017

It is shown that the number of paths passing through an edge characterises the location of a wide range of bottleneck edges in these algorithms, and could provide a bridge between the two fields of complex networks and congestion control.

An approximation to max min fairness in multi commodity networks

- Computer ScienceComput. Manag. Sci.
- 2020

The proposed approach is meant to handle large scale networks since the common approaches are feasible only on small to medium scale networks and can be exact to the MMF solution when ɛ is properly selected.

Quantifying the benefits of vehicle pooling with shareability networks

- Computer Science, PhysicsProceedings of the National Academy of Sciences
- 2014

The notion of shareability network is introduced, which allows to model the collective benefits of sharing as a function of passenger inconvenience, and to efficiently compute optimal sharing strategies on massive datasets, and demonstrates the feasibility of a shareable taxi service in New York City.

An Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective

- Mathematics, Computer ScienceJ. Appl. Math.
- 2014

A new approximation algorithm is presented that allows increasing the size of solvable problems and provides high-quality solutions to the discrete facility location problem providing solutions that are close to the lexicographic minimax optimum.

Rethinking Economics Using Complexity Theory

- Economics
- 2013

In this paper we argue that if we want to find a more satisfactory approach to tackling the major socio-economic problems we are facing, we need to thoroughly rethink the basic assumptions of…

Congestion dependencies in the European gas pipeline network during crises

- Political Science, Computer Science2014 Complexity in Engineering (COMPENG)
- 2014

A decentralized model of congestion control is developed to explore the effects of removing supply or transit countries from the network and the structure of downstream and upstream congestion dependencies between countries.

Resilience of Natural Gas Networks during Conflicts, Crises and Disruptions

- Business, MedicinePloS one
- 2014

This work develops a model to handle network congestion on various geographical scales and offers a resilient response strategy to energy shortages and quantifies its effectiveness for a variety of relevant scenarios.

The emerging energy web

- Computer Science, PhysicsArXiv
- 2013

An attempt is made to describe such multidisciplinary challenges with a coherent set of solutions to be identified to significantly impact the way the interconnected energy world is designed and operated.

Revealing physical interaction networks from statistics of collective dynamics

- Computer Science, PhysicsScience Advances
- 2017

This work exploits changes in invariant measures, in particular distributions of sampled states of the system in response to driving signals, and uses compressed sensing to reveal physical interaction networks in complex synthetic and natural systems.

## References

SHOWING 1-10 OF 46 REFERENCES

The price of stability for network design with fair cost allocation

- Computer Science45th Annual IEEE Symposium on Foundations of Computer Science
- 2004

It is established that the fair cost allocation protocol is in fact a useful mechanism for inducing strategic behavior to form near-optimal equilibria, and its results are extended to cases in which users are seeking to balance network design costs with latencies in the constructed network.

Fairness Measures for Resource Allocation

- Mathematics, Computer ScienceSIAM J. Comput.
- 2006

This work considers the problem of producing solutions that simultaneously approximate all feasible allocations in a coordinate-wise sense, and explores its consequences in a wide range of discrete optimization problems, including facility location, scheduling, and bandwidth assignment in networks.

Fairness in Routing and Load Balancing

- Computer ScienceJ. Comput. Syst. Sci.
- 2001

This work considers the problem of selecting paths for routing in order to provide a bandwidth allocation that is as fair as possible (in the max?min sense), and gets the first approximation algorithms for this basic optimization problem, for single-source unsplittable routings in an arbitrary directed graph.

Max-min fairness in multi-commodity flows

- Computer ScienceComput. Oper. Res.
- 2008

This paper presents the theoretical background for the problem of MMF, its relations with lexicographic optimization as well as a polynomial approach for achieving leximin maximization, and some computational results illustrate the behavior of the obtained solutions and the required CPU time for a range of random and well-dimensioned networks.

Bottleneck Flow Control

- Computer ScienceIEEE Trans. Commun.
- 1981

The problem of optimally choosing message rates for users of a store-and-forward network is analyzed and a generalized definition of ideal tradeoff is introduced to provide more flexibility in the choice of message rates.

Routing, flow, and capacity design in communication and computer networks

- Computer Science
- 2004

Throughout, the authors focus on the traffic demands encountered in the real world of network design, and their generic approach allows problem formulations and solutions to be applied across the board to virtually any type of backbone communication or computer network.

Optimal capacity distribution on complex networks

- Computer Science
- 2010

A flow model is used to study the optimal capacity distribution, with the consideration of the uneven nature of traffic generation rates at different nodes, and it is shown that using this algorithm, the node capacity can be optimally assigned.

Bandwidth sharing: objectives and algorithms

- Computer ScienceTNET
- 2002

It is proved that fixed-size window control can achieve fair bandwidth sharing according to any of these criteria, provided scheduling at each link is performed in an appropriate manner.

Structural bottlenecks for communication in networks.

- Computer Science, MedicinePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2007

It is shown that for any network, there exists an absolute upper bound, expressed in terms of vertex separators, for the scaling of gammac with network size N, irrespective of the static routing protocol used.

A unified framework for max-min and min-max fairness with applications

- Computer ScienceTNET
- 2007

A unifying treatment of max-min fairness is given, which encompasses all existing results in a simplifying framework, and extends its applicability to new examples, and shows that, if the set of feasible allocations has the free disposal property, then Max-min Programming reduces to a simpler algorithm, called Water Filling, whose complexity is much lower.