Cover Image

On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kanaya, Yuga, Takazawa, Kenjiro
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria
by: Takazawa, Kenjiro
Published: (2024)

The Popular Dimension of Matchings
by: Connor, Frank, et al.
Published: (2025)

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

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

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

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

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

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

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

M-convexity of the minimum-cost packings of arborescences
by: Takazawa, Kenjiro
Published: (2018)

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

A two-player version of the assignment problem
by: Galliot, Florian, 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)

Approximately Dominating Sets in Elections
by: Charikar, Moses, et al.
Published: (2025)

Six Candidates Suffice to Win a Voter Majority
by: Charikar, Moses, et al.
Published: (2024)

Stationary Online Contention Resolution Schemes
by: Aminian, Mohammad Reza, et al.
Published: (2026)

Combinatorial Bernoulli Factories
by: Niazadeh, Rad, et al.
Published: (2020)

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

Liberata -- Graph Scientometrics for a Share Based System of Academic Publishing
by: Zhang, Han, et al.
Published: (2026)

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

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)

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

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)

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

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)

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)

Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
by: Csáji, Gergely
Published: (2024)

Popular Maximum-Utility Matchings with Matroid Constraints
by: Csáji, Gergely, et al.
Published: (2024)

Unbalanced Random Matching Markets with Partial Preferences
by: Potukuchi, Aditya, et al.
Published: (2024)