Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Cake-Cutting Is Not a Piece of Cake
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Cake cutting really is not a piece of cake
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Cutting a Cake for Five People
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Thou shalt covet thy neighbor's cake
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Making decisions based on the preferences of multiple agents
Communications of the ACM
The Efficiency of Fair Division
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Communications of the ACM
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
The efficiency of fair division with connected pieces
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Operations Research
Dominant resource fairness: fair allocation of multiple resource types
Proceedings of the 8th USENIX conference on Networked systems design and implementation
Throw one's cake: and eat it too
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Beyond dominant resource fairness: extensions, limitations, and indivisibilities
Proceedings of the 13th ACM Conference on Electronic Commerce
On the complexity of cake cutting
Discrete Optimization
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
Computing socially-efficient cake divisions
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
No agent left behind: dynamic fair division of multiple resources
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
A matroid approach to the worst case allocation of indivisible goods
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Balancing fairness and efficiency in tiered storage systems with bottleneck-aware allocation
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
| Hi-index | 48.22 |
How to fairly allocate divisible resources, and why computer scientists should take notice.