Communication complexity of discrete fair division
From MaRDI portal
Recommendations
- Communication complexity of discrete fair division
- Diverse fair allocations: complexity and algorithms
- Diverse fair allocations: complexity and algorithms
- Almost envy-freeness with general valuations
- On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
Cites work
- Almost envy-freeness with general valuations
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Computing with Noisy Information
- Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
- Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
- Fair Allocation of Indivisible Goods to Asymmetric Agents
- Handbook of Computational Social Choice
- scientific article; zbMATH DE number 524134 (Why is no real title available?)
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- scientific article; zbMATH DE number 2086678 (Why is no real title available?)
- On the distributional complexity of disjointness
- Private vs. common random bits in communication complexity
- Random Matching Under Dichotomous Preferences
- The communication requirements of efficient allocations and supporting prices
- The Probabilistic Communication Complexity of Set Intersection
- The undercut procedure: an algorithm for the envy-free division of indivisible items
Cited in
(5)
This page was built for publication: Communication complexity of discrete fair division
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663092)
