Cover Image

Perpetual Fully-Online Approximate Fairness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kahana, Ido, Segal-Halevi, Erel, Hazon, Noam
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

Perpetually Fair Assignments Via Balanced Sequences of Permutations
by: Adams, Terrence, et al.
Published: (2026)

Improved Maximin Share Approximations for Chores by Bin Packing
by: Garg, Jugal, et al.
Published: (2024)

Fair Allocation of Improvements: When Old Endowments Shape New Assignments
by: Elmalem, Noga Klein, et al.
Published: (2025)

Weighted Fairness Notions for Indivisible Items Revisited
by: Chakraborty, Mithun, et al.
Published: (2021)

Computing Welfare-Maximizing Fair Allocations of Indivisible Goods
by: Aziz, Haris, et al.
Published: (2020)

Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations
by: Bismuth, Samuel, et al.
Published: (2019)

Fair Allocation with Money: What is Your Objective?
by: Elmalem, Noga Klein, et al.
Published: (2025)

A Reduction from Chores Allocation to Job Scheduling
by: Huang, Xin, et al.
Published: (2023)

Fairly Wired: Towards Leximin-Optimal Division of Electricity
by: Hartman, Eden, et al.
Published: (2025)

Computing approximate roots of monotone functions
by: Hollender, Alexandros, et al.
Published: (2023)

What Are People's Actual Utility Functions in Budget Aggregation?
by: Amster, Ayelet, et al.
Published: (2025)

Reducing Leximin Fairness to Utilitarian Optimization
by: Hartman, Eden, et al.
Published: (2024)

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

It's Not All Black and White: Degree of Truthfulness for Risk-Avoiding Agents
by: Hartman, Eden, et al.
Published: (2025)

The Min Max Average Cycle Weight Problem
by: Elmalem, Noga Klein, et al.
Published: (2025)

Weighted Envy Freeness With Bounded Subsidies
by: Elmalem, Noga Klein, et al.
Published: (2024)

Optimal Budget Aggregation with Star-Shaped Preference Domains
by: Brandt, Felix, et al.
Published: (2024)

Coordinating Charitable Donations with Leontief Preferences
by: Brandt, Felix, et al.
Published: (2023)

On Connected Strongly-Proportional Cake-Cutting
by: Jankó, Zsuzsanna, et al.
Published: (2023)

Strategic Voting in the Context of Stable-Matching of Teams
by: Schmerler, Leora, et al.
Published: (2022)

Coalition Formation with Bounded Coalition Size
by: Levinger, Chaya, et al.
Published: (2023)

The Complexity of Manipulation of k-Coalitional Games on Graphs
by: Barr, Hodaya, et al.
Published: (2024)

Whoever Said Money Won't Solve All Your Problems? Weighted Envy-free Allocation with Subsidy
by: Elmalem, Noga Klein, et al.
Published: (2025)

On the Efficiency of Fair and Truthful Trade Mechanisms
by: Babaioff, Moshe, et al.
Published: (2025)

Truthful-in-Expectation Mechanisms for MMS Approximation
by: Babaioff, Moshe, et al.
Published: (2026)

Proportionally Fair Makespan Approximation
by: Feldman, Michal, et al.
Published: (2024)

Beyond Proportional Individual Guarantees for Binary Perpetual Voting
by: Gafni, Yotam, et al.
Published: (2024)

Approximate Proportionality in Online Fair Division
by: Choo, Davin, et al.
Published: (2025)

Approximability Landscape of Welfare Maximization within Fair Allocations
by: Bu, Xiaolin, et al.
Published: (2022)

Online Fair Allocations with Binary Valuations and Beyond
by: Wang, Yuanyuan, et al.
Published: (2025)

Beyond the Half-Approximation: Fair and Efficient Online Class Matching
by: Borst, Sander, et al.
Published: (2026)

Fairness under Equal-Sized Bundles: Impossibility Results and Approximation Guarantees
by: Mancho, Alviona, et al.
Published: (2025)

Online Block Packing
by: Eliezer, Ariel Ben, et al.
Published: (2025)

Job-Scheduling Games with Time-Dependent Processing Times
by: Borenstein, Ido, et al.
Published: (2026)

Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness
by: Fikioris, Giannis, et al.
Published: (2023)

Domination-Avoiding Learning Agents Cannot Collude
by: Nisan, Noam, et al.
Published: (2026)

On the Welfare of EIP-1559 with Patient Bidders
by: Babaioff, Moshe, et al.
Published: (2025)

Fair Online Bilateral Trade
by: Bachoc, François, et al.
Published: (2024)

Perpetual Demand Lending Pools
by: Chitra, Tarun, et al.
Published: (2025)

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