Complexity of round-robin allocation with potentially noisy queries
From MaRDI portal
Cites work
- Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness
- Almost envy-freeness with general valuations
- An almost optimal algorithm for unbounded search with noisy information
- Asymptotic analysis of weighted fair division
- Asymptotic existence of proportionally fair allocations
- Balancing pairs and the cross product conjecture
- Balancing poset extensions
- Bandit algorithms
- Closing gaps in asymptotic fair division
- Complexity of round-robin allocation with potentially noisy queries
- Computing with Noisy Information
- Fair assignment of indivisible objects under ordinal preferences
- Fairly allocating many goods with few queries
- Finite partially ordered sets and their corresponding permutation sets
- scientific article; zbMATH DE number 1234106 (Why is no real title available?)
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- Instance-Optimality in the Noisy Value-and Comparison-Model
- Introduction to algorithms.
- Manipulating picking sequences
- On the complexity of best-arm identification in multi-armed bandit models
- Optimal Bounds for Noisy Sorting
- Parallel algorithms for select and partition with noisy comparisons
- Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity
- Picking sequences and monotonicity in weighted fair division
- Time bounds for selection
- Top-k and clustering with noisy comparisons
- Two combinatorial applications of the Aleksandrov-Fenchel inequalities
- Two-person fair division of indivisible items: an efficient envy-free algorithm
- Weighted fair division of indivisible items: a review
- When do envy-free allocations exist?
This page was built for publication: Complexity of round-robin allocation with potentially noisy queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6931982)
