Efficient Algorithms for Round-Robin Allocation with Noisy Preferences

This paper analyzes the complexity of implementing the fundamental round-robin algorithm for fairly allocating indivisible items, considering both noiseless and noisy settings for agent preferences.