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)- A fluid model for one-sided bipartite matching queues with match-dependent rewards
- The proportional random allocation of indivisible units
- Allocation rules on networks
- Equal-quantile rules in resource allocation with uncertain needs
- Free intermediation in resource transmission
- Submodular optimization views on the random assignment problem
- On solving mutual liability problems
- Sequential claim games
- `Hydraulic' rationing
- Entropy, desegregation, and proportional rationing
- Decentralized rationing problems and the proportional rule
- Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: an update
- Consistent bilateral assignment
- Proportional clearing mechanisms in financial systems: an axiomatic approach
- The Nash rationing problem
- 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)
