Cover Image

Envy Cycle Elimination with Strategic Agents: Best Responses and Fairness Guarantees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Amanatidis, Georgios, Birmpas, Georgios, Reiffenhäuser, Rebecca
Format:	Preprint
Published:	2026
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Algorithmically Fair Maximization of Multiple Submodular Objective Functions
by: Amanatidis, Georgios, et al.
Published: (2024)

Best-of-Both-Worlds Fairness of the Envy-Cycle-Elimination Algorithm
by: Garg, Jugal, et al.
Published: (2024)

Position Auctions with a Capacity Constraint
by: Batziou, Eleni, et al.
Published: (2026)

Optimizing the Envy Cycle Elimination Algorithm
by: Celine, Karen Frilya, et al.
Published: (2026)

Metric Distortion under Group-Fair Objectives
by: Amanatidis, Georgios, et al.
Published: (2024)

Pandora's Box Problem With Time Constraints
by: Amanatidis, Georgios, et al.
Published: (2024)

Parallel Contests for Crowdsourcing Reviews: Existence and Quality of Equilibria
by: Birmpas, Georgios, et al.
Published: (2022)

Reward Schemes and Committee Sizes in Proof of Stake Governance
by: Birmpas, Georgios, et al.
Published: (2024)

Tractable Exclusion Zones for Instant-Runoff Voting on Trees and Beyond
by: Birmpas, Georgios, et al.
Published: (2026)

On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes
by: Amanatidis, Georgios, et al.
Published: (2023)

Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents
by: Amanatidis, Georgios, et al.
Published: (2023)

Online Fair Division for Personalized $2$-Value Instances
by: Amanatidis, Georgios, et al.
Published: (2025)

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

On the Tractability Landscape of the Conditional Minisum Approval Voting Rule
by: Amanatidis, Georgios, et al.
Published: (2024)

Selling an Item Among a Strategic Bidder and a Profiled Agent
by: Caragiannis, Ioannis, et al.
Published: (2025)

Simultaneous Ordinal Maximin Share and Envy-Based Guarantees
by: Akrami, Hannaneh, et al.
Published: (2026)

Online Budget-Feasible Mechanism Design with Predictions
by: Amanatidis, Georgios, et al.
Published: (2025)

Pushing the Frontier on Approximate EFX Allocations
by: Amanatidis, Georgios, et al.
Published: (2024)

Fairness in the Multi-Secretary Problem
by: Papasotiropoulos, Georgios, et al.
Published: (2025)

On Hierarchies of Fairness Notions in Cake Cutting: From Proportionality to Super Envy-Freeness
by: Mehra, Arnav, et al.
Published: (2025)

On the Complexity of Winner Determination and Strategic Control in Conditional Approval Voting
by: Markakis, Evangelos, et al.
Published: (2022)

LLMs as Strategic Agents: Beliefs, Best Response Behavior, and Emergent Heuristics
by: de Fortuny, Enric Junque, et al.
Published: (2025)

Near-Optimal Best-of-Both-Worlds Fairness for Few Agents
by: Babaioff, Moshe, et al.
Published: (2026)

Optimal Stopping with Interdependent Values
by: Mauras, Simon, et al.
Published: (2024)

Truthful Matching with Online Items and Offline Agents
by: Feldman, Michal, et al.
Published: (2022)

Online Fair Division With Subsidy: When Do Envy-Free Allocations Exist, and at What Cost?
by: Kulkarni, Pooja, et al.
Published: (2025)

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

Beyond Exact Fairness: Envy-Free Incomplete Connected Fair Division
by: S, Ajaykrishnan E, et al.
Published: (2025)

On the Subsidy of Envy-Free Orientations in Graphs
by: Li, Bo, et al.
Published: (2025)

Weighted Envy-Freeness in House Allocation
by: Dai, Sijia, et al.
Published: (2024)

Weighted Envy-free Allocation with Subsidy
by: Aziz, Haris, et al.
Published: (2024)

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

Online Combinatorial Allocation with Interdependent Values
by: Feldman, Michal, et al.
Published: (2025)

A Complete Landscape for the Price of Envy-Freeness
by: Li, Zihao, et al.
Published: (2024)

The Cost and Complexity of Minimizing Envy in House Allocation
by: Madathil, Jayakrishnan, et al.
Published: (2024)

Asymptotic Existence of Class Envy-free Matchings
by: Yokoyama, Tomohiko, et al.
Published: (2025)

Envy-Free and Efficient Allocations for Graphical Valuations
by: Misra, Neeldhara, et al.
Published: (2024)

Online Fair Allocation with Best-of-Many-Worlds Guarantees
by: Yang, Zongjun, et al.
Published: (2024)

Randomized learning-augmented auctions with revenue guarantees
by: Caragiannis, Ioannis, et al.
Published: (2024)

Learning-Augmented Facility Location Mechanisms for Envy Ratio
by: Aziz, Haris, et al.
Published: (2025)