Copertina

Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Nishimura, Koichi, Sumita, Hanna
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Computer Science and Game Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods
di: Kawase, Yasushi, et al.
Pubblicazione: (2023)

Decomposition Envy-Freeness in Random Assignment
di: Kawase, Yasushi, et al.
Pubblicazione: (2026)

Envy-freeness in 3D Hedonic Games
di: McKay, Michael, et al.
Pubblicazione: (2022)

Fair and efficient allocation of indivisible items under category constraints
di: Igarashi, Ayumi, et al.
Pubblicazione: (2025)

Random Assignment of Indivisible Goods under Constraints
di: Kawase, Yasushi, et al.
Pubblicazione: (2022)

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

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

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

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

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

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

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

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

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

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

Low communication protocols for fair allocation of indivisible goods
di: Feige, Uriel
Pubblicazione: (2024)

Swap Bounded Envy
di: Echenique, Federico, et al.
Pubblicazione: (2025)

Weighted Envy-Freeness Revisited: Indivisible Resource and House Allocations
di: Liu, Yuxi, et al.
Pubblicazione: (2025)

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

Introspectively Envy-Free and Efficient Allocation of Indivisible Mixed Manna
di: Barman, Siddharth, et al.
Pubblicazione: (2025)

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

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

Fair Division with Two-Sided Preferences
di: Igarashi, Ayumi, et al.
Pubblicazione: (2022)

How to Resolve Envy by Adding Goods
di: Bentert, Matthias, et al.
Pubblicazione: (2025)

Envy Cycle Elimination with Strategic Agents: Best Responses and Fairness Guarantees
di: Amanatidis, Georgios, et al.
Pubblicazione: (2026)

Centralized Group Equitability and Individual Envy-Freeness in the Allocation of Indivisible Items
di: Wang, Ying, et al.
Pubblicazione: (2025)

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

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

Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness
di: Bu, Xiaolin, et al.
Pubblicazione: (2024)

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

Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations
di: Kaviani, Alireza, et al.
Pubblicazione: (2024)

Weighted Envy-Freeness for Submodular Valuations
di: Montanari, Luisa, et al.
Pubblicazione: (2022)

Computing Envy-Free up to Any Good (EFX) Allocations via Local Search
di: Brânzei, Simina
Pubblicazione: (2025)

Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability
di: Tröbst, Thorben, et al.
Pubblicazione: (2024)

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

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

Approximate Envy-Freeness in Graphical Cake Cutting
di: Yuen, Sheung Man, et al.
Pubblicazione: (2023)

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

Reinforcement Nash Equilibrium Solver
di: Wang, Xinrun, et al.
Pubblicazione: (2024)

Almost Envy-Freeness under Weakly Lexicographic Preferences
di: Hosseini, Hadi, et al.
Pubblicazione: (2024)