The Bipartite Rationing Problem
From MaRDI portal
Publication:5166267
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Recommendations
- The partition bargaining problem
- The Nash rationing problem
- The balanced satisfactory partition problem
- A class of balanced allocation problems
- The satisfactory partition problem
- The Pareto set of the partition bargaining problem
- The bipartite quadratic assignment problem and extensions
- Decentralized rationing problems and the proportional rule
- scientific article; zbMATH DE number 714530
Cited in
(17)- `Hydraulic' rationing
- On solving mutual liability problems
- Consistent bilateral assignment
- Decentralized rationing problems and the proportional rule
- Free intermediation in resource transmission
- Equal-quantile rules in resource allocation with uncertain needs
- Submodular optimization views on the random assignment problem
- Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: an update
- The proportional random allocation of indivisible units
- The Nash rationing problem
- Allocation rules on networks
- A fluid model for one-sided bipartite matching queues with match-dependent rewards
- Entropy, desegregation, and proportional rationing
- Sequential claim games
- Proportional clearing mechanisms in financial systems: an axiomatic approach
- Duality in financial networks
- Parametric rationing methods
This page was built for publication: The Bipartite Rationing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166267)
