Tractable graph structures in EFX orientation

DOI10.1007/978-3-032-03639-1_10MaRDI QIDQ6851609zbMATH OpenFDO

Authors Václav Blažej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo

Publication date 27 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-03639-1_10

Mathematics Subject Classification ID

Algorithmic game theory and complexity (91A68)

Cites work

• A proof of the Nisan-Ronen conjecture
• Algorithmic mechanism design
• Almost envy-freeness with general valuations
• Computing fair and efficient allocations with few utility values
• Distance from triviality 2.0: hybrid parameterizations
• Efficient reallocation under additive and responsive preferences
• EFX exists for three agents
• Extension of additive valuations to general valuations on the existence of EFX
• Fair assignment of indivisible objects under ordinal preferences
• Half-integrality, LP-branching, and FPT algorithms
• Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
• On the Nisan-Ronen conjecture
• Optimal binary space partitions for segments in the plane
• Parameterized and Exact Computation
• Settling the complexity of computing two-player Nash equilibria
• The complexity of computing a Nash equilibrium

This page was built for publication: Tractable graph structures in EFX orientation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851609)