Copertina

Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Caragiannis, Ioannis, Mehlhorn, Kurt, Rathi, Nidhi
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computer Science and Game Theory 68W40, 91B14 F.2.0
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

EF1 Allocations for Identical Trilean and Separable Single-Peaked Valuations
di: Bhaskar, Umang, et al.
Pubblicazione: (2024)

Equilibrium Computation in the Hotelling-Downs Model of Spatial Competition
di: Bhaskar, Umang, et al.
Pubblicazione: (2024)

The Exchange Problem
di: Garg, Mohit, et al.
Pubblicazione: (2024)

Approximating the Shapley Value of Minimum Cost Spanning Tree Games: An FPRAS for Saving Games
di: Jimbo, Takumi, et al.
Pubblicazione: (2026)

On Computing the Shapley Value in Bankruptcy Games -llustrated by Rectified Linear Function Game-
di: Yamazaki, Shunta, et al.
Pubblicazione: (2025)

A Characterization of Complexity in Public Goods Games
di: Gilboa, Matan
Pubblicazione: (2023)

Estimating the Expected Social Welfare and Cost of Random Serial Dictatorship
di: Caragiannis, Ioannis, et al.
Pubblicazione: (2024)

The fairness of the group draw for the FIFA World Cup
di: Csató, László
Pubblicazione: (2021)

Fair Division in a Variable Setting
di: Chandramouleeswaran, Harish, et al.
Pubblicazione: (2024)

Distributed Nash Equilibrium Seeking over Time-Varying Directed Communication Networks
di: Nguyen, Duong Thuy Anh, et al.
Pubblicazione: (2022)

Almost and Approximate EFX for Few Types of Agents
di: HV, Vishwa Prakash, et al.
Pubblicazione: (2025)

Nash Welfare in Additively Separable Hedonic Games
di: Pagano, Marta, et al.
Pubblicazione: (2026)

From Independence of Clones to Composition Consistency: A Hierarchy of Barriers to Strategic Nomination
di: Berker, Ratip Emin, et al.
Pubblicazione: (2025)

Designing Rules to Pick a Rule: Aggregation by Consistency
di: Berker, Ratip Emin, et al.
Pubblicazione: (2025)

A Fair and Optimal Approach to Sequential Healthcare Rationing
di: Sun, Zhaohong
Pubblicazione: (2025)

Facility Location Problem with Aleatory Agents
di: Auricchio, Gennaro, et al.
Pubblicazione: (2024)

Mechanism Design for Locating Facilities with Capacities with Insufficient Resources
di: Auricchio, Gennaro, et al.
Pubblicazione: (2024)

The average-case complexity of the Word Problem for groups of matrices over $\mathbb{Z}$ is linear
di: Bassino, Frédérique, et al.
Pubblicazione: (2025)

Polynomial-Time Algorithm for Thiele Voting Rules with Voter Interval Preferences
di: Manurangsi, Pasin, et al.
Pubblicazione: (2026)

Naively Sorting Evolving Data is Optimal and Robust
di: Giakkoupis, George, et al.
Pubblicazione: (2024)

Probabilistic Analysis of Stable Matching in Large Markets with Siblings
di: Sun, Zhaohong, et al.
Pubblicazione: (2025)

Achieving Balanced Representation in School Choice with Diversity Goals
di: Sun, Zhaohong, et al.
Pubblicazione: (2024)

Compatible $k$-Relaxations of Fairness and Non-Wastefulness Under Hereditary Constraints
di: Wakasugi, Tenma, et al.
Pubblicazione: (2026)

Stable Matchings in Practice: A Constraint Programming Approach
di: Sun, Zhaohong, et al.
Pubblicazione: (2024)

Stealth edits to large language models
di: Sutton, Oliver J., et al.
Pubblicazione: (2024)

On the Edge of Core (Non-)Emptiness: An Automated Reasoning Approach to Approval-Based Multi-Winner Voting
di: Berker, Ratip Emin, et al.
Pubblicazione: (2025)

How Many Votes is a Lie Worth? Measuring Strategyproofness through Resource Augmentation
di: Berker, Ratip Emin, et al.
Pubblicazione: (2026)

Extracting and Validating Explanatory Word Archipelagoes using Dual Entropy
di: Ohsawa, Yukio
Pubblicazione: (2020)

Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
di: Matti, Fabio, et al.
Pubblicazione: (2025)

The word problem for the mapping class group in quasi-linear time
di: Bell, Mark C., et al.
Pubblicazione: (2025)

Learning to Persuade on the Fly: Robustness Against Ignorance
di: Zu, You, et al.
Pubblicazione: (2021)

Introducing the Quantum Economic Advantage Online Calculator
di: Mejia, Frederick, et al.
Pubblicazione: (2025)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
di: Feldman, Moran, et al.
Pubblicazione: (2025)

A generalization to networks of Young's characterization of the Borda rule
di: Bubboloni, Daniela, et al.
Pubblicazione: (2022)

The Power of Matching for Online Fractional Hedonic Games
di: Bullinger, Martin, et al.
Pubblicazione: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
di: Chen, Zongchen, et al.
Pubblicazione: (2022)

On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
di: Cheval, Vincent, et al.
Pubblicazione: (2025)

Fixed-Point Theorems and the Ethics of Radical Transparency: A Logic-First Treatment
di: Alpay, Faruk, et al.
Pubblicazione: (2025)

Decentralized Signaling Mechanisms
di: Boroujeni, Niloufar Mirzavand, et al.
Pubblicazione: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems: Provable Exponential Speedup via Stochastic Population Update
di: Opris, Andre
Pubblicazione: (2025)