:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Zhang, Han, Sabath, Anshuman, Dunn, Timothy W., Brinson, L. Catherine
Format:	Preprint
Published:	2026
Subjects:	Digital Libraries Discrete Mathematics Computer Science and Game Theory
Online Access:	https://arxiv.org/abs/2605.02128
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings
by: Kanaya, Yuga, et al.
Published: (2025)

Thinned Quantile Shares are Universally Feasible
by: Jain, Vishesh, et al.
Published: (2026)

Asynchronous Majority Dynamics on Binomial Random Graphs
by: Mohan, Divyarthi, et al.
Published: (2023)

Welfare Loss in Connected Resource Allocation
by: Bei, Xiaohui, et al.
Published: (2024)

Static Nuel Games with Terminal Payoff
by: Mastrakoulis, S., et al.
Published: (2024)

Tight Lower Bound for Multicolor Discrepancy
by: Manurangsi, Pasin, et al.
Published: (2025)

Nonatomic Non-Cooperative Neighbourhood Balancing Games
by: Auger, David, et al.
Published: (2023)

Misère Greedy Nim and Misère Bounded Greedy Nim
by: Omiya, Nanako, et al.
Published: (2025)

Discrepancy And Fair Division For Non-Additive Valuations
by: la Tour, Max Dupre, et al.
Published: (2025)

Popularity and Perfectness in One-sided Matching Markets with Capacities
by: Csáji, Gergely
Published: (2024)

Tracking Truth with Liquid Democracy
by: Berinsky, Adam, et al.
Published: (2021)

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

An Algorithm for the Assignment Game Beyond Additive Valuations
by: Balkanski, Eric, et al.
Published: (2024)

Computation of Approximately Stable Committees in Approval-based Elections
by: Gao, Drew, et al.
Published: (2025)

Testing popularity in linear time via maximum matching
by: Bérczi-Kovács, Erika, et al.
Published: (2023)

Improved lower bounds for the maximum size of Condorcet domains
by: Karpov, Alexander, et al.
Published: (2026)

Dividing a Graphical Cake
by: Bei, Xiaohui, et al.
Published: (2019)

Discrete Single-Parameter Optimal Auction Design
by: Giannakopoulos, Yiannis, et al.
Published: (2024)

Matrix Rationalization via Partial Orders
by: Totschnig, Agnes, et al.
Published: (2024)

Combinatorics on Social Configurations
by: Mermoud, Dylan Laplace, et al.
Published: (2024)

Localizing Preference Aggregation Conflicts: A Graph-Theoretic Approach Using Sheaves
by: Sargsyan, Karen
Published: (2025)

Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond
by: Takazawa, Kenjiro
Published: (2024)

Matroids are Equitable
by: Akrami, Hannaneh, et al.
Published: (2025)

Asymptotic Analysis of Weighted Fair Division
by: Manurangsi, Pasin, et al.
Published: (2025)

Poset Positional Games
by: Bagan, Guillaume, et al.
Published: (2024)

A Direct Proof of the Short-Side Advantage in Random Matching Markets
by: Mauras, Simon, et al.
Published: (2025)

Quantifying Core Stability Relaxations in Hedonic Games
by: Demeulemeester, Tom, et al.
Published: (2024)

Fair Allocation of Indivisible Goods with Variable Groups
by: Gölz, Paul, et al.
Published: (2025)

Discrepancy Beyond Additive Functions with Applications to Fair Division
by: Hollender, Alexandros, et al.
Published: (2025)

Online Budgeted Matching with General Bids
by: Yang, Jianyi, et al.
Published: (2024)

On the Nucleolus of a Class of Linear Production Games
by: Baïou, Mourad, et al.
Published: (2022)

On the Formation of Steady Coalitions
by: Mermoud, Dylan Laplace
Published: (2024)

Pushing the Frontier on Approximate EFX Allocations
by: Amanatidis, Georgios, et al.
Published: (2024)

Polynomial-Time Algorithms for Fair Orientations of Chores
by: Hsu, Kevin, et al.
Published: (2025)

A two-player version of the assignment problem
by: Galliot, Florian, et al.
Published: (2026)

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

Winning in the Limit: Average-Case Committee Selection with Many Candidates
by: Lin, Yifan, et al.
Published: (2026)

On complete classes of valuated matroids
by: Husić, Edin, et al.
Published: (2021)

On the Weighted Top-Difference Distance: Axioms, Aggregation, and Approximation
by: Aveni, Andrea, et al.
Published: (2024)

Distortion of Metric Voting with Bounded Randomness
by: Cai, Ziyi, et al.
Published: (2026)