The Bipartite Rationing Problem
From MaRDI portal
Publication:5166267
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Games involving graphs (91A43)
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
(16)- The Nash rationing problem
- Entropy, desegregation, and proportional rationing
- A fluid model for one-sided bipartite matching queues with match-dependent rewards
- On solving mutual liability problems
- Equal-quantile rules in resource allocation with uncertain needs
- Decentralized rationing problems and the proportional rule
- Parametric rationing methods
- Consistent bilateral assignment
- Submodular optimization views on the random assignment problem
- The proportional random allocation of indivisible units
- `Hydraulic' rationing
- Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: an update
- Free intermediation in resource transmission
- Allocation rules on networks
- Sequential claim games
- Proportional clearing mechanisms in financial systems: an axiomatic approach
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)
