共 50 条
- [31] Envy-free Chore Division for An Arbitrary Number of Agents [J]. SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 2564 - 2583
- [33] Cake cutting: An envy-free and truthful mechanism with a small number of cuts [J]. Leibniz Int. Proc. Informatics, LIPIcs, (151-1516):
- [34] The undercut procedure: an algorithm for the envy-free division of indivisible items [J]. Social Choice and Welfare, 2012, 39 : 615 - 631
- [35] A Discrete and Bounded Envy-Free Cake Cutting Protocol for Four Agents [J]. STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 454 - 464
- [39] Envy-Free Solutions to the Problem of Room Assignment and Rent Division [J]. Group Decision and Negotiation, 2022, 31 : 703 - 721
- [40] Envy-Free Classification [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32