Research map / Learning theory and algorithms / Submodular and game algorithms
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- The Complexity of Extending Fair Allocations of Indivisible Goods (AAAI 2025 · similarity 0.87)
- Envy-Free House Allocation under Uncertain Preferences (AAAI 2024 · similarity 0.87)
- On Hierarchies of Fairness Notions in Cake Cutting: From Proportionality to Super Envy-Freeness (NeurIPS 2025 · similarity 0.86)
- The Complexity of Fair Division of Indivisible Items with Externalities (AAAI 2024 · similarity 0.86)
- Maxileximin Envy Allocations and Connected Goods (AAAI 2024 · similarity 0.86)
- Approximate Envy-Free Allocations up to any k Goods (NeurIPS 2026 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.