Envy-free matchings in bipartite graphs and their applications to fair division.
Elad Aigner-HorevErel Segal-HaleviPublished in: Inf. Sci. (2022)
Keyphrases
- envy free
- bipartite graph
- maximum cardinality
- resource allocation
- pareto optimal
- additively separable
- utility function
- maximum matching
- minimum weight
- envy freeness
- social welfare
- link prediction
- bipartite graph matching
- reinforcement learning
- web search
- lower bound
- learning algorithm
- nash equilibrium
- supervised learning
- search space