Fair Integral Network Flows

András Frank () and Kazuo Murota ()
Additional contact information
András Frank: MTA-ELTE Egerváry Research Group, Department of Operations Research, Eötvös University, Budapest H-1117, Hungary
Kazuo Murota: The Institute of Statistical Mathematics, Tokyo 190-8562, Japan; Faculty of Economics and Business Administration, Tokyo Metropolitan University, Tokyo 192-0397, Japan

Mathematics of Operations Research, 2023, vol. 48, issue 3, 1393-1422

Abstract: A strongly polynomial algorithm is developed for finding an integer-valued feasible st -flow of a given flow amount, which is decreasingly minimal on a specified subset F of edges in the sense that the largest flow value on F is as small as possible; within this, the second largest flow value on F is as small as possible; within this, the third largest flow value on F is as small as possible, and so on. A characterization of the set of these st -flows gives rise to an algorithm to compute a cheapest F -decreasingly minimal integer-valued feasible st -flow of given flow amount. Decreasing minimality is a possible formal way to capture the intuitive notion of fairness.

Keywords: Primary: 90C27; secondary: 05C; 68R10; lexicographic minimization; network flow; polynomial algorithm (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/moor.2022.1303 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormoor:v:48:y:2023:i:3:p:1393-1422

Access Statistics for this article

More articles in Mathematics of Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().