Cover Image

Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Matsui, Tomomi, Hamaguchi, Takayoshi
Format:	Preprint
Published:	2016
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Perfect Matchings and Popularity in the Many-to-Many Setting
by: Kavitha, Telikepalli, et al.
Published: (2024)

Critical Relaxed-Stable Matchings with Ties in the Many-to-Many Setting
by: Nasre, Meghana, et al.
Published: (2023)

Optimal Capacity Modification for Stable Matchings with Ties
by: Ranjan, Keshav, et al.
Published: (2024)

FlexFlood: Efficiently Updatable Learned Multi-dimensional Index
by: Hidaka, Fuma, et al.
Published: (2024)

Fast Construction of Partitioned Learned Bloom Filter with Theoretical Guarantees
by: Sato, Atsuki, et al.
Published: (2024)

A Characterization of List Regression
by: Pabbaraju, Chirag, et al.
Published: (2024)

Robust Popular Matchings
by: Bullinger, Martin, et al.
Published: (2024)

Layered List Labeling
by: Bender, Michael A., et al.
Published: (2024)

RIP Linked List
by: Sonntag, Benoît, et al.
Published: (2023)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
by: Dalirrooyfard, Mina, et al.
Published: (2023)

Nearly Optimal List Labeling
by: Bender, Michael A., et al.
Published: (2024)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
by: Nanta, Jiratchaphat, et al.
Published: (2025)

List Update with Delays or Time Windows
by: Azar, Yossi, et al.
Published: (2023)

Listing 6-Cycles in Sparse Graphs
by: Williams, Virginia Vassilevska, et al.
Published: (2024)

Matching Composition and Efficient Weight Reduction in Dynamic Matching
by: Bernstein, Aaron, et al.
Published: (2024)

Transposition is Nearly Optimal for IID List Update
by: Coester, Christian
Published: (2026)

Online List Labeling with Near-Logarithmic Writes
by: Seybold, Martin P.
Published: (2024)

Distribution-Free Testing of Decision Lists with a Sublinear Number of Queries
by: Chen, Xi, et al.
Published: (2024)

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
by: Bringmann, Karl, et al.
Published: (2026)

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
by: Kobayashi, Yasuaki, et al.
Published: (2023)

Compressed Set Representations based on Set Difference
by: Gagie, Travis, et al.
Published: (2026)

Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set
by: Saito, Rin, et al.
Published: (2025)

PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
by: Sato, Atsuki, et al.
Published: (2024)

Greedy Dynamic Matching
by: Arnosti, Nick, et al.
Published: (2025)

Cartesian Forest Matching
by: Auvray, Bastien, et al.
Published: (2025)

Caching Connections in Matchings
by: Sadeh, Yaniv, et al.
Published: (2023)

Suffixient Sets
by: Depuydt, Lore, et al.
Published: (2023)

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set
by: Chandrasekaran, Karthekeyan, et al.
Published: (2023)

Sampling List Packings
by: Camrud, Evan, et al.
Published: (2024)

Dynamic Rank, Basis, and Matching
by: Brand, Jan van den, et al.
Published: (2026)

Pattern Matching with Mismatches and Wildcards
by: Bathie, Gabriel, et al.
Published: (2024)

Improved Circular Dictionary Matching
by: Cotumaccio, Nicola
Published: (2025)

Location-Restricted Stable Matching
by: Castro, Garret
Published: (2025)

Approximate Circular Pattern Matching
by: Charalampopoulos, Panagiotis, et al.
Published: (2022)

Edge-weighted Matching in the Dark
by: Huang, Zhiyi, et al.
Published: (2025)

Dynamic Pattern Matching with Wildcards
by: Naeini, Arshia Ataee, et al.
Published: (2026)

Enhanced Graph Pattern Matching
by: Cotumaccio, Nicola
Published: (2024)

Pattern Masking for Dictionary Matching
by: Charalampopoulos, Panagiotis, et al.
Published: (2020)

Quantum Pattern Matching with Wildcards
by: Seddighin, Masoud, et al.
Published: (2025)

Near Uniform Triangle Sampling Over Adjacency List Graph Streams
by: Bishnu, Arijit, et al.
Published: (2024)