Image de couverture de livre

The Popular Dimension of Matchings

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Connor, Frank, Langevin, Louis-Roy, Ndiaye, Ndiamé, Totschnig, Agnès, Vasishta, Rohit, Vetta, Adrian
Format:	Preprint
Publié:	2025
Sujets:	Computer Science and Game Theory Discrete Mathematics Data Structures and Algorithms Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Matrix Rationalization via Partial Orders
par: Totschnig, Agnes, et autres
Publié: (2024)

Six Candidates Suffice to Win a Voter Majority
par: Charikar, Moses, et autres
Publié: (2024)

Approximately Dominating Sets in Elections
par: Charikar, Moses, et autres
Publié: (2025)

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

Stationary Online Contention Resolution Schemes
par: Aminian, Mohammad Reza, et autres
Publié: (2026)

Combinatorial Bernoulli Factories
par: Niazadeh, Rad, et autres
Publié: (2020)

Unbalanced Random Matching Markets with Partial Preferences
par: Potukuchi, Aditya, et autres
Publié: (2024)

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

A Direct Proof of the Short-Side Advantage in Random Matching Markets
par: Mauras, Simon, et autres
Publié: (2025)

Non-Exclusive Notifications for Ride-Hailing at Lyft I: Single-Cycle Approximation Algorithms
par: Ekbatani, Farbod, et autres
Publié: (2026)

Distortion of Metric Voting with Bounded Randomness
par: Cai, Ziyi, et autres
Publié: (2026)

Monotone Randomized Apportionment
par: Correa, José, et autres
Publié: (2024)

Some variations of the secretary problem
par: Agrawal, Sarthak, et autres
Publié: (2026)

Approximately Envy-free and Equitable Allocations of Indivisible Items for Non-monotone Valuations
par: Bilò, Vittorio, et autres
Publié: (2025)

Optimally revealing bits for rejection sampling
par: Langevin, Louis-Roy, et autres
Publié: (2025)

Breaking the Metric Voting Distortion Barrier
par: Charikar, Moses, et autres
Publié: (2023)

Generalized Nash Equilibrium Problems with Mixed-Integer Variables
par: Harks, Tobias, et autres
Publié: (2021)

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems
par: Kevi, Eniko, et autres
Publié: (2024)

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
par: Csáji, Gergely
Publié: (2023)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
par: Ghanbari, Babak, et autres
Publié: (2026)

Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
par: Jeronimo, Fernando Granha, et autres
Publié: (2022)

The Complexity of Homomorphism Reconstruction Revisited
par: Gervens, Timo, et autres
Publié: (2026)

On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings
par: Kanaya, Yuga, et autres
Publié: (2025)

A Faster Isomorphism Test for Graphs of Small Degree
par: Grohe, Martin, et autres
Publié: (2018)

On constrained intersection representations of graphs and digraphs
par: Cicalese, Ferdinando, et autres
Publié: (2025)

Construction of orientable sequences in $O(1)$-amortized time per bit
par: Gabric, Daniel, et autres
Publié: (2024)

Total Matching and Subdeterminants
par: Ferrarini, Luca, et autres
Publié: (2023)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
par: Bencs, Ferenc, et autres
Publié: (2024)

The Strong Birthday Problem Revisited
par: Tripathy, Chijul B.
Publié: (2025)

Reconfiguration of List Colourings
par: Cambie, Stijn, et autres
Publié: (2025)

Parameterized complexity of isometric path partition: treewidth and diameter
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
par: Ghanbari, Babak, et autres
Publié: (2025)

On the Enumeration of all Unique Paths of Recombining Trinomial Trees
par: Torres, Ethan, et autres
Publié: (2025)

Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
par: Ingels, Florian, et autres
Publié: (2026)

Induced Cycles of Many Lengths
par: Chudnovsky, Maria, et autres
Publié: (2026)

Approximating maximum-size properly colored forests
par: Bai, Yuhang, et autres
Publié: (2024)

Problems on Group-labeled Matroid Bases
par: Hörsch, Florian, et autres
Publié: (2024)

$α_i$-Metric Graphs: Hyperbolicity
par: Dragan, Feodor F., et autres
Publié: (2024)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
par: Deák, Bence, et autres
Publié: (2026)

Rainbow Arborescence Conjecture
par: Bérczi, Kristóf, et autres
Publié: (2024)