A note on balanced flows in equality networks

DOI10.1016/j.ipl.2019.01.014zbMath1452.91152OpenAlexW2912943655WikidataQ128459202 ScholiaQ128459202MaRDI QIDQ1730034

Naoyuki Kamiyama

Publication date: 11 March 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2324/4479690

zbMATH Keywords

equilibriumanalysis of algorithmsbalanced flowlexicographically optimal flow

Mathematics Subject Classification ID

Microeconomic theory (price theory and economic markets) (91B24)

Cites Work

• Improved balanced flow computation using parametric flow
• A combinatorial polynomial algorithm for the linear Arrow-Debreu market
• Spending Constraint Utilities with Applications to the Adwords Market
• Market equilibrium via a primal--dual algorithm for a convex program
• A new approach to the maximum-flow problem
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• Optimal flows in networks with multiple sources and sinks
• An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
• A Fast Parametric Maximum Flow Algorithm and Applications
• The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
• Unnamed Item

This page was built for publication: A note on balanced flows in equality networks