Repeatedly matching items to agents fairly and efficiently

DOI10.1007/978-3-031-43254-5_20MaRDI QIDQ6546304zbMATH OpenFDO

Authors I. Caragiannis, Shivika Narang

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43254-5_20

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68)

Recommendations

• Almost envy-free repeated matching in two-sided markets
• Fair and efficient online allocations
• The envy-free matching problem with pairwise preferences

Cites work

• Almost envy-free repeated matching in two-sided markets
• Faster Scaling Algorithms for Network Problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Linear degree extractors and the inapproximability of max clique and chromatic number
• Matching theory
• On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources

Cited in

(2)

• Almost envy-free repeated matching in two-sided markets
• Fair distribution of delivery orders

This page was built for publication: Repeatedly matching items to agents fairly and efficiently

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546304)