Imagen de Portada

Near-Optimal Dropout-Robust Sortition

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gambhir, Maya Pal, Flanigan, Bailey, Roth, Aaron
Formato:	Preprint
Publicado:	2025
Materias:	Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Maximally Random Sortition
por: de Azevedo, Gabriel, et al.
Publicado: (2026)

Boosting Sortition via Proportional Representation
por: Ebadian, Soroush, et al.
Publicado: (2024)

The Panel Complexity of Sortition: Is 12 Angry Men Enough?
por: Brustle, Johannes, et al.
Publicado: (2025)

Can a Few Decide for Many? The Metric Distortion of Sortition
por: Caragiannis, Ioannis, et al.
Publicado: (2024)

Alternates, Assemble! Selecting Optimal Alternates for Citizens' Assemblies
por: Assos, Angelos, et al.
Publicado: (2025)

The End Justifies the Mean: A Linear Ranking Rule for Proportional Sequential Decisions
por: Baharav, Carmel, et al.
Publicado: (2026)

Strategic Candidacy in Generative AI Arenas
por: Hays, Chris, et al.
Publicado: (2026)

The Value of Ambiguous Commitments in Multi-Follower Games
por: Collina, Natalie, et al.
Publicado: (2024)

Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions
por: Besançon, Mathieu, et al.
Publicado: (2019)

Personalization Aids Pluralistic Alignment Under Competition
por: Collina, Natalie, et al.
Publicado: (2026)

Near-Optimal Best-of-Both-Worlds Fairness for Few Agents
por: Babaioff, Moshe, et al.
Publicado: (2026)

Forecasting for Swap Regret for All Downstream Agents
por: Roth, Aaron, et al.
Publicado: (2024)

A Parametric Model for Near-Optimal Online Synthesis with Robust Reach-Avoid Guarantees
por: Gleirscher, Mario, et al.
Publicado: (2025)

Synthesis of Robust Optimal Strategies in Weighted Timed Games
por: Monmege, Benjamin, et al.
Publicado: (2024)

On Robustness to $k$-wise Independence of Optimal Bayesian Mechanisms
por: Gravin, Nick, et al.
Publicado: (2024)

On the Uniqueness of Nash Equilibria in Multiagent Matrix Games
por: Bailey, James P.
Publicado: (2024)

The Quality of Information: A Weighted Entropy Approach to Near-Optimal Mastermind
por: Gür, Serkan
Publicado: (2025)

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
por: Bechavod, Yahav, et al.
Publicado: (2025)

The Relationship between No-Regret Learning and Online Conformal Prediction
por: Ramalingam, Ramya, et al.
Publicado: (2025)

Sample Efficient Omniprediction and Downstream Swap Regret for Non-Linear Losses
por: Lu, Jiuyao, et al.
Publicado: (2025)

Online Omniprediction with Long-Term Constraints
por: Bechavod, Yahav, et al.
Publicado: (2025)

Prior-Agnostic Incentive-Compatible Exploration
por: Ramalingam, Ramya, et al.
Publicado: (2026)

Bounding the Price-of-Fair-Sharing using Knapsack-Cover Constraints to guide Near-Optimal Cost-Recovery Algorithms
por: Aarts, Sander, et al.
Publicado: (2023)

On the Universal Near Optimality of Hedge in Combinatorial Settings
por: Fan, Zhiyuan, et al.
Publicado: (2025)

On the Approximability of the Yolk in the Spatial Model of Voting
por: Hu, Ran, et al.
Publicado: (2024)

Solving Matrix Games with Near-Optimal Matvec Complexity
por: Karmarkar, Ishani, et al.
Publicado: (2026)

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
por: Balcan, Maria-Florina, et al.
Publicado: (2025)

Optimal Robust Contract Design
por: Peng, Bo, et al.
Publicado: (2024)

Contract Design for Sequential Actions
por: Ezra, Tomer, et al.
Publicado: (2024)

Near-Feasible Stable Matchings: Incentives and Optimality
por: Glitzner, Frederik
Publicado: (2026)

Near-Linear MIR Algorithms for Stochastically-Ordered Priors
por: Bahar, Gal, et al.
Publicado: (2025)

Near-Feasible Solutions to Complex Stable Matching Problems
por: Csáji, Gergely
Publicado: (2025)

Managing Persuasion Robustly: The Optimality of Quota Rules
por: Bergemann, Dirk, et al.
Publicado: (2023)

Combinatorial Contracts Through Demand Types
por: Baldwin, Elizabeth, et al.
Publicado: (2026)

Optimal Diffusion Auctions
por: Zhang, Yao, et al.
Publicado: (2023)

Nearly Tight Bounds on Approximate Equilibria in Spatial Competition on the Line
por: Bhaskar, Umang, et al.
Publicado: (2024)

One Action Too Many: Inapproximability of Budgeted Combinatorial Contracts
por: Feldman, Michal, et al.
Publicado: (2025)

Budget-Feasible Contracts
por: Feldman, Michal, et al.
Publicado: (2025)

Equal-Pay Contracts
por: Feldman, Michal, et al.
Publicado: (2026)

Strategically Robust Game Theory via Optimal Transport
por: Lanzetti, Nicolas, et al.
Publicado: (2025)