Cover Image

The Min Max Average Cycle Weight Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Elmalem, Noga Klein, Gonen, Rica, Segal-Halevi, Erel
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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)

Reducing Leximin Fairness to Utilitarian Optimization
by: Hartman, Eden, 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)

The Average-Value Allocation Problem
by: Bhawalkar, Kshipra, et al.
Published: (2024)

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

Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
by: Glitzner, Frederik, et al.
Published: (2024)

Cycle Cancellation for Submodular Fractional Allocations and Applications
by: Chekuri, Chandra, et al.
Published: (2025)

Edge-Weighted Online Bipartite Matching
by: Fahrbach, Matthew, et al.
Published: (2020)

Equitable Colorings of Vertex-Weighted Graphs
by: Barman, Siddharth, et al.
Published: (2026)

Condorcet Winners and Anscombes Paradox Under Weighted Binary Voting
by: Baharav, Carmel, et al.
Published: (2025)

Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
by: Feng, Yuda, et al.
Published: (2024)

Pandora's Problem with Combinatorial Cost
by: Berger, Ben, et al.
Published: (2023)

Computing Power Indices in Weighted Majority Games with Formal Power Series
by: Kakimura, Naonori, et al.
Published: (2025)

A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
by: Feng, Yuda, et al.
Published: (2024)

Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings
by: V., Vishwa Prakash H., et al.
Published: (2023)

Min-Max Optimization Requires Exponentially Many Queries
by: Bernasconi, Martino, et al.
Published: (2026)

The Secretary Problem with Predicted Additive Gap
by: Braun, Alexander, et al.
Published: (2024)

Canadian Traveller Problems in Temporal Graphs
by: Bellitto, Thomas, et al.
Published: (2024)

Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
by: Brown, Adam, et al.
Published: (2024)

Static Pricing for Online Selection Problem and its Variants
by: Sun, Bo, et al.
Published: (2024)

Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
by: Segev, Danny, et al.
Published: (2020)

Beyond matroids: Secretary Problem and Prophet Inequality with general constraints
by: Rubinstein, Aviad
Published: (2016)

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
by: Constantinescu, Andrei, et al.
Published: (2023)

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

Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded
by: Benedek, Márton, et al.
Published: (2023)

Hedonic Seat Arrangement Problems
by: Bodlaender, Hans L., et al.
Published: (2020)

Non-Exclusive Notifications for Ride-Hailing at Lyft I: Single-Cycle Approximation Algorithms
by: Ekbatani, Farbod, et al.
Published: (2026)

Efficiency in the Roommates Problem
by: Kuwahara, Keita
Published: (2025)

Best of Both Worlds Guarantees for Equitable Allocations
by: Bhaskar, Umang, et al.
Published: (2025)

Universal Online Contention Resolution with Preselected Order
by: Zhao, Junyao
Published: (2025)

Online Job Assignment
by: Ekbatani, Farbod, et al.
Published: (2025)

Online Allocation with Multi-Class Arrivals: Group Fairness vs Individual Welfare
by: Zargari, Faraz, et al.
Published: (2025)

Best-of-Both-Worlds Guarantees with Fairer Endings
by: Kavitha, Telikepalli, et al.
Published: (2025)

Maximizing social welfare among EF1 allocations at the presence of two types of agents
by: Ma, Jiaxuan, et al.
Published: (2025)

A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
by: Charalampopoulos, Andreas, et al.
Published: (2025)

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
by: Bei, Xiaohui, et al.
Published: (2025)