Imagen de Portada

Complexity of Round-Robin Allocation with Potentially Noisy Queries

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Zihan, Manurangsi, Pasin, Scarlett, Jonathan, Suksompong, Warut
Formato:	Preprint
Publicado:	2024
Materias:	Computer Science and Game Theory Computational Complexity Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Envy-Free Allocation of Indivisible Goods via Noisy Queries
por: Li, Zihan, et al.
Publicado: (2026)

Ordinal Maximin Guarantees for Group Fair Division
por: Manurangsi, Pasin, et al.
Publicado: (2024)

Asymptotic Fair Division: Chores Are Easier Than Goods
por: Manurangsi, Pasin, et al.
Publicado: (2025)

Differentially Private Fair Division
por: Manurangsi, Pasin, et al.
Publicado: (2022)

Reforming an Unfair Allocation by Exchanging Goods
por: Yuen, Sheung Man, et al.
Publicado: (2024)

Reachability of Fair Allocations via Sequential Exchanges
por: Igarashi, Ayumi, et al.
Publicado: (2023)

The Price of Justified Representation
por: Elkind, Edith, et al.
Publicado: (2021)

Envy-Free House Allocation with Minimum Subsidy
por: Choo, Davin, et al.
Publicado: (2024)

Fair Allocation of Indivisible Goods with Variable Groups
por: Gölz, Paul, et al.
Publicado: (2025)

Asymptotic Analysis of Weighted Fair Division
por: Manurangsi, Pasin, et al.
Publicado: (2025)

Discrepancy Beyond Additive Functions with Applications to Fair Division
por: Hollender, Alexandros, et al.
Publicado: (2025)

Optimizing the Envy Cycle Elimination Algorithm
por: Celine, Karen Frilya, et al.
Publicado: (2026)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
por: Brânzei, Simina, et al.
Publicado: (2024)

Welfare Loss in Connected Resource Allocation
por: Bei, Xiaohui, et al.
Publicado: (2024)

Dividing a Graphical Cake
por: Bei, Xiaohui, et al.
Publicado: (2019)

Minimizing the Cost of EFx Allocations
por: Deltl, Eva
Publicado: (2026)

Approximate Envy-Freeness in Graphical Cake Cutting
por: Yuen, Sheung Man, et al.
Publicado: (2023)

Comparing the Fairness of Recursively Balanced Picking Sequences
por: Celine, Karen Frilya, et al.
Publicado: (2025)

Reconfiguring Proportional Committees
por: Dong, Chris, et al.
Publicado: (2025)

The Computational Complexity of the Housing Market
por: Lock, Edwin, et al.
Publicado: (2024)

On the Complexity of Learning Nash Equilibria
por: Biggar, Oliver, et al.
Publicado: (2026)

Dividing Conflicting Items Fairly
por: Igarashi, Ayumi, et al.
Publicado: (2025)

On the Smoothed Complexity of Combinatorial Local Search
por: Giannakopoulos, Yiannis, et al.
Publicado: (2022)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
por: Ghosh, Abheek, et al.
Publicado: (2024)

The Complexity of Min-Max Optimization with Product Constraints
por: Bernasconi, Martino, et al.
Publicado: (2026)

Incentives in Social Decision Schemes with Pairwise Comparison Preferences
por: Brandt, Felix, et al.
Publicado: (2022)

Truthful Cake Sharing
por: Bei, Xiaohui, et al.
Publicado: (2021)

Modelling Network Resilience: The Complexity of Some Graph Division Games
por: Gutowski, Grzegorz, et al.
Publicado: (2026)

Tight Lower Bound for Multicolor Discrepancy
por: Manurangsi, Pasin, et al.
Publicado: (2025)

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas
por: Bredereck, Robert, et al.
Publicado: (2024)

Ex-post Stability under Two-Sided Matching: Complexity and Characterization
por: Aziz, Haris, et al.
Publicado: (2024)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
por: Hansen, Kristoffer Arnsfelt, et al.
Publicado: (2025)

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
por: Lin, Chuang-Chieh, et al.
Publicado: (2023)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
por: Anagnostides, Ioannis, et al.
Publicado: (2025)

Approval-Based Voting with Mixed Goods
por: Lu, Xinhang, et al.
Publicado: (2022)

Discrete Budget Aggregation: Truthfulness and Proportionality
por: Schmidt-Kraepelin, Ulrike, et al.
Publicado: (2025)

On Multi-Level Apportionment
por: Schmidt-Kraepelin, Ulrike, et al.
Publicado: (2025)

Weighted Fairness Notions for Indivisible Items Revisited
por: Chakraborty, Mithun, et al.
Publicado: (2021)

The Proportional Veto Principle for Approval Ballots
por: Halpern, Daniel, et al.
Publicado: (2025)

Fair Allocation under Conflict Constraints
por: Equbal, Sarfaraz, et al.
Publicado: (2026)