Ex ante and ex post envy-freeness on polytope resources
From MaRDI portal
(Redirected from Publication:6671889)
Recommendations
Cites work
- A new solution to the random assignment problem.
- A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM
- A simple characterization of assignment mechanisms on set constraints
- Computing Maximal “Polymatroidal” Network Flows
- Constrained random matching
- Extended random assignment mechanisms on a family of good sets
- Fair assignment of indivisible objects under ordinal preferences
- Fair division of indivisible goods: recent progress and open questions
- Fair division under ordinal preferences: computing envy-free allocations of indivisible goods
- scientific article; zbMATH DE number 894716 (Why is no real title available?)
- Simultaneous eating algorithm and greedy algorithm in assignment problems
- Simultaneously achieving ex-ante and ex-post fairness
- Submodular functions and optimization.
- Submodular optimization views on the random assignment problem
- Two axiomatic approaches to the probabilistic serial mechanism
Cited in
(2)
This page was built for publication: Ex ante and ex post envy-freeness on polytope resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671889)