Pages that link to "Item:Q2362197"
From MaRDI portal
The following pages link to Efficient, fair, and strategy-proof (re)allocation under network constraints (Q2362197):
Displaying 9 items.
- Allocation rules on networks (Q485430) (← links)
- Equal-need sharing of a network under connectivity constraints (Q536106) (← links)
- Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems (Q1680106) (← links)
- Egalitarianism under earmark constraints (Q1945835) (← links)
- New variable-population paradoxes for resource allocation (Q2247950) (← links)
- Submodular optimization views on the random assignment problem (Q2330658) (← links)
- The replacement principle in networked economies with single-peaked preferences (Q2361503) (← links)
- Introduction to the Theory of Fair Allocation (Q5133014) (← links)
- Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well (Q5323085) (← links)