Perpetually Fair Assignments Via Balanced Sequences of Permutations
Fuente:
arXiv
Saved in:
| Main Authors: | Adams, Terrence, Segal-Halevi, Erel |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Perpetual Fully-Online Approximate Fairness
by: Kahana, Ido, et al.
Published: (2026)
by: Kahana, Ido, et al.
Published: (2026)
Fair Allocation of Improvements: When Old Endowments Shape New Assignments
by: Elmalem, Noga Klein, et al.
Published: (2025)
by: Elmalem, Noga Klein, et al.
Published: (2025)
On Connected Strongly-Proportional Cake-Cutting
by: Jankó, Zsuzsanna, et al.
Published: (2023)
by: Jankó, Zsuzsanna, et al.
Published: (2023)
Weighted Fairness Notions for Indivisible Items Revisited
by: Chakraborty, Mithun, et al.
Published: (2021)
by: Chakraborty, Mithun, et al.
Published: (2021)
Computing Welfare-Maximizing Fair Allocations of Indivisible Goods
by: Aziz, Haris, et al.
Published: (2020)
by: Aziz, Haris, et al.
Published: (2020)
Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations
by: Bismuth, Samuel, et al.
Published: (2019)
by: Bismuth, Samuel, et al.
Published: (2019)
Fair Allocation with Money: What is Your Objective?
by: Elmalem, Noga Klein, et al.
Published: (2025)
by: Elmalem, Noga Klein, et al.
Published: (2025)
Improved Maximin Share Approximations for Chores by Bin Packing
by: Garg, Jugal, et al.
Published: (2024)
by: Garg, Jugal, et al.
Published: (2024)
A Reduction from Chores Allocation to Job Scheduling
by: Huang, Xin, et al.
Published: (2023)
by: Huang, Xin, et al.
Published: (2023)
Fairly Wired: Towards Leximin-Optimal Division of Electricity
by: Hartman, Eden, et al.
Published: (2025)
by: Hartman, Eden, et al.
Published: (2025)
Computing approximate roots of monotone functions
by: Hollender, Alexandros, et al.
Published: (2023)
by: Hollender, Alexandros, et al.
Published: (2023)
What Are People's Actual Utility Functions in Budget Aggregation?
by: Amster, Ayelet, et al.
Published: (2025)
by: Amster, Ayelet, et al.
Published: (2025)
Reducing Leximin Fairness to Utilitarian Optimization
by: Hartman, Eden, et al.
Published: (2024)
by: Hartman, Eden, et al.
Published: (2024)
Efficiently Computing Equilibria in Budget-Aggregation Games
by: Becker, Patrick, et al.
Published: (2025)
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)
by: Hartman, Eden, et al.
Published: (2025)
The Min Max Average Cycle Weight Problem
by: Elmalem, Noga Klein, et al.
Published: (2025)
by: Elmalem, Noga Klein, et al.
Published: (2025)
Weighted Envy Freeness With Bounded Subsidies
by: Elmalem, Noga Klein, et al.
Published: (2024)
by: Elmalem, Noga Klein, et al.
Published: (2024)
Optimal Budget Aggregation with Star-Shaped Preference Domains
by: Brandt, Felix, et al.
Published: (2024)
by: Brandt, Felix, et al.
Published: (2024)
Coordinating Charitable Donations with Leontief Preferences
by: Brandt, Felix, et al.
Published: (2023)
by: Brandt, Felix, et al.
Published: (2023)
Comparing the Fairness of Recursively Balanced Picking Sequences
by: Celine, Karen Frilya, et al.
Published: (2025)
by: Celine, Karen Frilya, et al.
Published: (2025)
Whoever Said Money Won't Solve All Your Problems? Weighted Envy-free Allocation with Subsidy
by: Elmalem, Noga Klein, et al.
Published: (2025)
by: Elmalem, Noga Klein, et al.
Published: (2025)
Discrepancy Beyond Additive Functions with Applications to Fair Division
by: Hollender, Alexandros, et al.
Published: (2025)
by: Hollender, Alexandros, et al.
Published: (2025)
Fair Assignment of Indivisible Chores to Asymmetric Agents
by: Seddighin, Masoud, et al.
Published: (2025)
by: Seddighin, Masoud, et al.
Published: (2025)
Connectedness in weighted consensus division of graphical cakes between two agents
by: Hanke, Josef, et al.
Published: (2023)
by: Hanke, Josef, et al.
Published: (2023)
On the structure of EFX orientations on graphs
by: Zeng, Jinghan A, et al.
Published: (2024)
by: Zeng, Jinghan A, et al.
Published: (2024)
Achieving the Highest Possible Elo Rating
by: Shah, Rikhav
Published: (2022)
by: Shah, Rikhav
Published: (2022)
Relationship between misère NIM and two-player GOISHI HIROI
by: Abuku, Tomoaki, et al.
Published: (2024)
by: Abuku, Tomoaki, et al.
Published: (2024)
Edge-dominance games on graphs
by: Arthaud, Farid, et al.
Published: (2024)
by: Arthaud, Farid, et al.
Published: (2024)
An upper bound for the number of chess diagrams without promotion
by: Gourion, Daniel
Published: (2021)
by: Gourion, Daniel
Published: (2021)
An NP-hard generalization of Nim
by: Liu, Chunlei
Published: (2024)
by: Liu, Chunlei
Published: (2024)
A few good choices
by: Nguyen, Thanh, et al.
Published: (2025)
by: Nguyen, Thanh, et al.
Published: (2025)
So Long Sucker: Endgame Analysis
by: De Carufel, Jean-Lou, et al.
Published: (2024)
by: De Carufel, Jean-Lou, et al.
Published: (2024)
Cost Allocation for Set Covering: the Happy Nucleolus
by: Blauth, Jannis, et al.
Published: (2024)
by: Blauth, Jannis, et al.
Published: (2024)
A Linear Programming Approach to the Super-Stable Roommates Problem
by: Kamiyama, Naoyuki
Published: (2025)
by: Kamiyama, Naoyuki
Published: (2025)
von Neumann and Newman Pokers with Finite Decks
by: Krityakierne, Tipaluck, et al.
Published: (2024)
by: Krityakierne, Tipaluck, et al.
Published: (2024)
Nucleolus, Happy Nucleolus, and Vehicle Routing
by: Ebert, Daniel, et al.
Published: (2025)
by: Ebert, Daniel, et al.
Published: (2025)
Cycle Patterns and Mean Payoff Games
by: Loho, Georg, et al.
Published: (2025)
by: Loho, Georg, et al.
Published: (2025)
Misere Connect Four is Solved
by: Steele, Robert, et al.
Published: (2024)
by: Steele, Robert, et al.
Published: (2024)
Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design
by: Ma, Mengfan, et al.
Published: (2024)
by: Ma, Mengfan, et al.
Published: (2024)
I Will Have Order! Optimizing Orders for Fair Reviewer Assignment
by: Payan, Justin, et al.
Published: (2021)
by: Payan, Justin, et al.
Published: (2021)
Similar Items
-
Perpetual Fully-Online Approximate Fairness
by: Kahana, Ido, et al.
Published: (2026) -
Fair Allocation of Improvements: When Old Endowments Shape New Assignments
by: Elmalem, Noga Klein, et al.
Published: (2025) -
On Connected Strongly-Proportional Cake-Cutting
by: Jankó, Zsuzsanna, et al.
Published: (2023) -
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)