Which is the fairest allocation in the max-min fairness-based coalitional game?

DOI10.1016/J.TCS.2021.07.020MaRDI QIDQ820567OpenAlexFDO

Authors Zheng Chen, Zhaoquan Gu, Yuexuan Wang

Publication date 27 September 2021

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

Full work available at URL https://doi.org/10.1016/j.tcs.2021.07.020

zbMATH Keywords

fair allocationenvy-freenessmax-mincoalitional gameresource exchange

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• The price of fairness
• Coalitions under a competition mechanism of resource allocation
• Fairness in resource allocation: foundation and applications
• scientific article; zbMATH DE number 5543436
• On Efficient Resource Allocation in Communication Networks

Cites work

• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• scientific article; zbMATH DE number 5485470 (Why is no real title available?)
• scientific article; zbMATH DE number 1243371 (Why is no real title available?)
• A discrete and bounded envy-free cake cutting protocol for four agents
• A note on cake cutting
• Agent incentives of strategic behavior in resource exchange
• An Envy-Free Cake Division Protocol
• Incentive compatible allocation and exchange of discrete resources
• Models in Cooperative Game Theory
• Rental Harmony: Sperner's Lemma in Fair Division

Cited in

(1)

• scientific article; zbMATH DE number 5543436 (Why is no real title available?)

This page was built for publication: Which is the fairest allocation in the max-min fairness-based coalitional game?

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