Repeatedly matching items to agents fairly and efficiently

DOI10.1016/j.tcs.2023.114246arXiv2207.01589MaRDI QIDQ6118303

Shivika Narang, Ioannis Caragiannis

Publication date: 23 February 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.01589

zbMATH Keywords

resource allocationmatchingsfair divisionenvy-freeness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Matching theory
• Almost envy-free repeated matching in two-sided markets
• Faster Scaling Algorithms for Network Problems
• Almost Envy-Freeness with General Valuations
• On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources