Imagen de Portada

How to Resolve Envy by Adding Goods

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bentert, Matthias, Bredereck, Robert, Deltl, Eva, Jain, Pallavi, Kellerhals, Leon
Formato:	Preprint
Publicado:	2025
Materias:	Computer Science and Game Theory Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Minimizing the Cost of EFx Allocations
por: Deltl, Eva
Publicado: (2026)

The Core in Max-Loss Non-Centroid Clustering Can Be Empty
por: Bredereck, Robert, et al.
Publicado: (2025)

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas
por: Bredereck, Robert, et al.
Publicado: (2024)

Computing Efficient Envy-Free Partial Allocations of Indivisible Goods
por: Bredereck, Robert, et al.
Publicado: (2025)

Bribery's Influence on Ranked Aggregation
por: Jain, Pallavi, et al.
Publicado: (2026)

Envy-Free Cake-Cutting for Four Agents
por: Hollender, Alexandros, et al.
Publicado: (2023)

Envy-Free House Allocation with Minimum Subsidy
por: Choo, Davin, et al.
Publicado: (2024)

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
por: Gao, Ruiquan, et al.
Publicado: (2024)

Controlling Borda Elections by Adding or Deleting either Votes or Candidates: Complete and Top-Truncated Votes
por: Zhou, Aizhong, et al.
Publicado: (2024)

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

Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NP^PP
por: Kaczmarek, Joanna, et al.
Publicado: (2024)

Tight Inapproximability of Nash Equilibria in Public Goods Games
por: Dinh, Jérémi Do, et al.
Publicado: (2024)

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

Efficiently Computing Equilibria in Budget-Aggregation Games
por: Becker, Patrick, et al.
Publicado: (2025)

Proportional Clustering, the $β$-Plurality Problem, and Metric Distortion
por: Kellerhals, Leon, et al.
Publicado: (2025)

Minimum Envy Graphical House Allocation Beyond Identical Valuations
por: Inamdar, Tanmay, et al.
Publicado: (2026)

Consumable Data via Quantum Communication
por: Gilboa, Dar, et al.
Publicado: (2024)

Approximate Envy-Free Allocations up to any $k$ Goods
por: Filos-Ratsikas, Aris, et al.
Publicado: (2026)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
por: Hansen, Kristoffer Arnsfelt, et al.
Publicado: (2025)

Skating System Unveiled: Exploring Preference Aggregation in Ballroom Tournaments
por: Horn, Laryssa, et al.
Publicado: (2025)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
por: Anagnostides, Ioannis, et al.
Publicado: (2025)

Equilibrium and Selfish Behavior in Network Contagion
por: Zhang, Yi, et al.
Publicado: (2025)

Equilibrium Computation in First-Price Auctions with Correlated Priors
por: Filos-Ratsikas, Aris, et al.
Publicado: (2025)

Constant Inapproximability of Pacing Equilibria in Second-Price Auctions
por: Chen, Xi, et al.
Publicado: (2025)

Reducing the complexity of computing the values of a Nash equilibrium
por: Chatterjee, Debtoru, et al.
Publicado: (2025)

Tarski Lower Bounds from Multi-Dimensional Herringbones
por: Brânzei, Simina, et al.
Publicado: (2025)

Solving Four Open Problems about Core Stability in Altruistic Hedonic Games
por: Rothe, Jörg, et al.
Publicado: (2025)

On Minimal Achievable Quotas in Multiwinner Voting
por: Becker, Patrick, et al.
Publicado: (2025)

On the Smoothed Complexity of Combinatorial Local Search
por: Giannakopoulos, Yiannis, et al.
Publicado: (2022)

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
por: Lin, Chuang-Chieh, et al.
Publicado: (2023)

Constant Inapproximability for Fisher Markets
por: Deligkas, Argyrios, et al.
Publicado: (2026)

Smoothed analysis of deterministic discounted and mean-payoff games
por: Loff, Bruno, et al.
Publicado: (2024)

Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
por: D'Amico-Wong, Luca, et al.
Publicado: (2024)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
por: Brânzei, Simina, et al.
Publicado: (2024)

Committee Elections with Candidate Attribute Constraints
por: Zhou, Aizhong, et al.
Publicado: (2024)

Modelling Network Resilience: The Complexity of Some Graph Division Games
por: Gutowski, Grzegorz, et al.
Publicado: (2026)

Constant Inapproximability for PPA
por: Deligkas, Argyrios, et al.
Publicado: (2022)

Spatial Voting with Incomplete Voter Information
por: Imber, Aviram, et al.
Publicado: (2023)

On the Complexity of Learning Nash Equilibria
por: Biggar, Oliver, et al.
Publicado: (2026)

Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash
por: Babichenko, Yakov, et al.
Publicado: (2015)