Logarithmic comparison-based query complexity for fair division of indivisible goods

DOI10.1007/978-3-032-08560-3_20MaRDI QIDQ7285581zbMATH OpenFDO

Authors Xiaolin Bu, Zihao Li, Shengxin Liu, Biaoshuai Tao

Publication date 19 June 2026

Full work available at URL https://doi.org/10.1007/978-3-032-08560-3_20

Mathematics Subject Classification ID

Internet topics (68M11) Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites work

• A discrete and bounded envy-free cake cutting protocol for any number of agents
• A discrete and bounded envy-free cake cutting protocol for four agents
• A note on cake cutting
• Almost envy-free allocations with connected bundles
• Almost envy-freeness with general valuations
• An Envy-Free Cake Division Protocol
• Breaking the 3/4 barrier for approximate maximin share
• Cake cutting really is not a piece of cake
• Communication complexity of discrete fair division
• Envy-free cake divisions cannot be found by finite protocols
• Fair allocation of indivisible goods: improvement
• Fairly allocating many goods with few queries
• How to Cut a Cake Fairly
• How to Cut A Cake Fairly
• scientific article; zbMATH DE number 1234106 (Why is no real title available?)
• scientific article; zbMATH DE number 7788374 (Why is no real title available?)
• On the computability of equitable divisions
• Query complexity of approximate Nash equilibria
• Sur la division pragmatique
• The query complexity of graph isomorphism: bypassing distribution testing lower bounds

This page was built for publication: Logarithmic comparison-based query complexity for fair division of indivisible goods

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