Cover Image

Unravelling Expressive Delegations: Complexity and Normative Analysis

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tyrovolas, Giannis, Constantinescu, Andrei, Elkind, Edith
Format:	Preprint
Published:	2023
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

The Price of Justified Representation
by: Elkind, Edith, et al.
Published: (2021)

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

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

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

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

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

Condorcet Winners and Anscombes Paradox Under Weighted Binary Voting
by: Baharav, Carmel, et al.
Published: (2025)

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

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

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

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)

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

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

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)

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

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
by: Constantinescu, Andrei, et al.
Published: (2023)

Controlling Delegations in Liquid Democracy
by: Alouf-Heffetz, Shiri, et al.
Published: (2024)

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

Byzantine Game Theory: Sun Tzus Boxes
by: Constantinescu, Andrei, et al.
Published: (2025)

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

Delegation with Costly Inspection
by: Hajiaghayi, Mohammad T., et al.
Published: (2025)

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

Algorithmic Delegated Choice: An Annotated Reading List
by: Hajiaghayi, Mohammad T., et al.
Published: (2025)

On the Complexity of the Two-Stage Majoritarian Rule
by: Yang, Yongjie
Published: (2023)

Min-Max Optimization Requires Exponentially Many Queries
by: Bernasconi, Martino, et al.
Published: (2026)

On the Parameterized Complexity of Controlling Amendment and Successive Winners
by: Yang, Yongjie
Published: (2025)

Sample Complexity of Posted Pricing for a Single Item
by: Jin, Billy, et al.
Published: (2024)

Attractors Is All You Need: Parity Games In Polynomial Time
by: van der Heijden, Rick
Published: (2025)

Revisiting Ranking for Online Bipartite Matching with Random Arrivals: the Primal-Dual Analysis
by: Peng, Bo, et al.
Published: (2025)

Pandora's Problem with Combinatorial Cost
by: Berger, Ben, et al.
Published: (2023)

Threshold Testing and Semi-Online Prophet Inequalities
by: Hoefer, Martin, et al.
Published: (2023)

How to Make Knockout Tournaments More Popular?
by: Chaudhary, Juhi, et al.
Published: (2023)

Combinatorial Stationary Prophet Inequalities
by: Patel, Neel, et al.
Published: (2023)

Threshold Policies with Tight Guarantees for Online Selection with Convex Costs
by: Tan, Xiaoqi, et al.
Published: (2023)

Addressing Bias in Online Selection with Limited Budget of Comparisons
by: Benomar, Ziyad, et al.
Published: (2023)

Beyond the worst case: Distortion in impartial culture electorates
by: Caragiannis, Ioannis, et al.
Published: (2023)

Laminar Matroid Secretary: Greedy Strikes Back
by: Huang, Zhiyi, et al.
Published: (2023)

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods
by: Kawase, Yasushi, et al.
Published: (2023)