Cover Image

The Price of Justified Representation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Elkind, Edith, Faliszewski, Piotr, Igarashi, Ayumi, Manurangsi, Pasin, Schmidt-Kraepelin, Ulrike, Suksompong, Warut
Format:	Preprint
Published:	2021
Subjects:	Computer Science and Game Theory Computational Complexity Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Unravelling Expressive Delegations: Complexity and Normative Analysis
by: Tyrovolas, Giannis, et al.
Published: (2023)

Condorcet Dimension and Pareto Optimality for Matchings and Beyond
by: Kavitha, Telikepalli, et al.
Published: (2026)

Complexity of Round-Robin Allocation with Potentially Noisy Queries
by: Li, Zihan, et al.
Published: (2024)

Algorithmic Persuasion with Evidence
by: Hoefer, Martin, et al.
Published: (2020)

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

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

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

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

Single-Deviation Stability in Additively Separable Hedonic Games with Constrained Coalition Sizes
by: Bullinger, Martin, et al.
Published: (2025)

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

On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
by: Koenemann, Jochen, et al.
Published: (2021)

Hedonic Seat Arrangement Problems
by: Bodlaender, Hans L., et al.
Published: (2020)

Core Stability in Additively Separable Hedonic Games of Low Treewidth
by: Hanaka, Tesshu, et al.
Published: (2024)

A Smoothed FPTAS for Equilibria in Congestion Games
by: Giannakopoulos, Yiannis
Published: (2023)

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
by: Anagnostides, Ioannis, et al.
Published: (2023)

Satisfactory Budget Division
by: Gourvès, Laurent, et al.
Published: (2025)

Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs
by: Kawase, Sota, et al.
Published: (2024)

A Quadratic Lower Bound for Stable Roommates Solvability
by: Rosenbaum, Will
Published: (2025)

Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded
by: Benedek, Márton, et al.
Published: (2023)

Computing a Fixed Point of Contraction Maps in Polynomial Queries
by: Chen, Xi, et al.
Published: (2024)

Nemesis, an Escape Game in Graphs
by: Bergé, Pierre, et al.
Published: (2026)

Complexity of Auctions with Interdependence
by: Loiseau, Patrick, et al.
Published: (2026)

EF1 and EFX Orientations
by: Deligkas, Argyrios, et al.
Published: (2024)

Differentially Private Fair Division
by: Manurangsi, Pasin, et al.
Published: (2022)

Monotone Randomized Apportionment
by: Correa, José, et al.
Published: (2024)

Partitioned Matching Games for International Kidney Exchange
by: Benedek, Márton, et al.
Published: (2023)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
by: S., Karthik C., et al.
Published: (2024)

A Note on Approximability of Densest At-Least-k-Subgraph
by: Laekhanukit, Bundit, et al.
Published: (2026)

Dynamic Debt Swapping in Financial Networks
by: Froese, Henri, et al.
Published: (2023)

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
by: Hummel, Halvard, et al.
Published: (2024)

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

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

Optimal Pricing with Unreliable Signals
by: Tang, Zhihao Gavin, et al.
Published: (2026)

Logarithmic Approximation for Road Pricing on Grids
by: Constantinescu, Andrei, et al.
Published: (2025)

Static Pricing Guarantees for Queueing Systems
by: Bergquist, Jacob, et al.
Published: (2023)

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
by: Guruswami, Venkatesan, et al.
Published: (2023)

On Binary Networked Public Goods Game with Altruism
by: Maiti, Arnab, et al.
Published: (2022)

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

Posted Price Mechanisms for Online Allocation with Diseconomies of Scale
by: Jazi, Hossein Nekouyan, et al.
Published: (2025)

Static Pricing for Online Selection Problem and its Variants
by: Sun, Bo, et al.
Published: (2024)