Image de couverture de livre

Near-Optimal Dropout-Robust Sortition

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gambhir, Maya Pal, Flanigan, Bailey, Roth, Aaron
Format:	Preprint
Publié:	2025
Sujets:	Computer Science and Game Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Maximally Random Sortition
par: de Azevedo, Gabriel, et autres
Publié: (2026)

Boosting Sortition via Proportional Representation
par: Ebadian, Soroush, et autres
Publié: (2024)

The Panel Complexity of Sortition: Is 12 Angry Men Enough?
par: Brustle, Johannes, et autres
Publié: (2025)

Can a Few Decide for Many? The Metric Distortion of Sortition
par: Caragiannis, Ioannis, et autres
Publié: (2024)

Alternates, Assemble! Selecting Optimal Alternates for Citizens' Assemblies
par: Assos, Angelos, et autres
Publié: (2025)

The End Justifies the Mean: A Linear Ranking Rule for Proportional Sequential Decisions
par: Baharav, Carmel, et autres
Publié: (2026)

Strategic Candidacy in Generative AI Arenas
par: Hays, Chris, et autres
Publié: (2026)

The Value of Ambiguous Commitments in Multi-Follower Games
par: Collina, Natalie, et autres
Publié: (2024)

Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions
par: Besançon, Mathieu, et autres
Publié: (2019)

Personalization Aids Pluralistic Alignment Under Competition
par: Collina, Natalie, et autres
Publié: (2026)

Near-Optimal Best-of-Both-Worlds Fairness for Few Agents
par: Babaioff, Moshe, et autres
Publié: (2026)

Forecasting for Swap Regret for All Downstream Agents
par: Roth, Aaron, et autres
Publié: (2024)

A Parametric Model for Near-Optimal Online Synthesis with Robust Reach-Avoid Guarantees
par: Gleirscher, Mario, et autres
Publié: (2025)

Synthesis of Robust Optimal Strategies in Weighted Timed Games
par: Monmege, Benjamin, et autres
Publié: (2024)

On Robustness to $k$-wise Independence of Optimal Bayesian Mechanisms
par: Gravin, Nick, et autres
Publié: (2024)

On the Uniqueness of Nash Equilibria in Multiagent Matrix Games
par: Bailey, James P.
Publié: (2024)

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

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
par: Bechavod, Yahav, et autres
Publié: (2025)

The Relationship between No-Regret Learning and Online Conformal Prediction
par: Ramalingam, Ramya, et autres
Publié: (2025)

Sample Efficient Omniprediction and Downstream Swap Regret for Non-Linear Losses
par: Lu, Jiuyao, et autres
Publié: (2025)

Online Omniprediction with Long-Term Constraints
par: Bechavod, Yahav, et autres
Publié: (2025)

Prior-Agnostic Incentive-Compatible Exploration
par: Ramalingam, Ramya, et autres
Publié: (2026)

Bounding the Price-of-Fair-Sharing using Knapsack-Cover Constraints to guide Near-Optimal Cost-Recovery Algorithms
par: Aarts, Sander, et autres
Publié: (2023)

On the Universal Near Optimality of Hedge in Combinatorial Settings
par: Fan, Zhiyuan, et autres
Publié: (2025)

On the Approximability of the Yolk in the Spatial Model of Voting
par: Hu, Ran, et autres
Publié: (2024)

Solving Matrix Games with Near-Optimal Matvec Complexity
par: Karmarkar, Ishani, et autres
Publié: (2026)

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
par: Balcan, Maria-Florina, et autres
Publié: (2025)

Optimal Robust Contract Design
par: Peng, Bo, et autres
Publié: (2024)

Contract Design for Sequential Actions
par: Ezra, Tomer, et autres
Publié: (2024)

Near-Feasible Stable Matchings: Incentives and Optimality
par: Glitzner, Frederik
Publié: (2026)

Near-Linear MIR Algorithms for Stochastically-Ordered Priors
par: Bahar, Gal, et autres
Publié: (2025)

Near-Feasible Solutions to Complex Stable Matching Problems
par: Csáji, Gergely
Publié: (2025)

Managing Persuasion Robustly: The Optimality of Quota Rules
par: Bergemann, Dirk, et autres
Publié: (2023)

Combinatorial Contracts Through Demand Types
par: Baldwin, Elizabeth, et autres
Publié: (2026)

Optimal Diffusion Auctions
par: Zhang, Yao, et autres
Publié: (2023)

Nearly Tight Bounds on Approximate Equilibria in Spatial Competition on the Line
par: Bhaskar, Umang, et autres
Publié: (2024)

One Action Too Many: Inapproximability of Budgeted Combinatorial Contracts
par: Feldman, Michal, et autres
Publié: (2025)

Budget-Feasible Contracts
par: Feldman, Michal, et autres
Publié: (2025)

Equal-Pay Contracts
par: Feldman, Michal, et autres
Publié: (2026)

Strategically Robust Game Theory via Optimal Transport
par: Lanzetti, Nicolas, et autres
Publié: (2025)