Image de couverture de livre

Course Allocation with Credits via Stable Matching

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Rodríguez, José, Manlove, David
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Stable Matching with Deviators and Conformists
par: Glitzner, Frederik, et autres
Publié: (2026)

A Minimax Perspective on Almost-Stable Matchings
par: Glitzner, Frederik, et autres
Publié: (2026)

Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
par: Glitzner, Frederik, et autres
Publié: (2025)

MATWA: A Web Toolkit for Matching under Preferences
par: Glitzner, Frederik, et autres
Publié: (2024)

Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
par: Glitzner, Frederik, et autres
Publié: (2024)

Packing $K_r$s in bounded degree graphs
par: McKay, Michael, et autres
Publié: (2022)

Operational research approaches and mathematical models for kidney exchange: A literature survey and empirical evaluation
par: Barkel, Mathijs, et autres
Publié: (2025)

Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching
par: Ma, Will
Publié: (2024)

Location-Restricted Stable Matching
par: Castro, Garret
Publié: (2025)

Selection Improvements on the Parallel Iterative Algorithm for Stable Matching
par: Wynn, Scott, et autres
Publié: (2024)

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
par: Hathcock, Daniel, et autres
Publié: (2025)

Envy-freeness in 3D Hedonic Games
par: McKay, Michael, et autres
Publié: (2022)

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling
par: Braverman, Mark, et autres
Publié: (2024)

Cartesian Forest Matching
par: Auvray, Bastien, et autres
Publié: (2025)

A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs
par: Singh, Rajpreet, et autres
Publié: (2025)

Proportionally Fair Matching via Randomized Rounding
par: Duppala, Sharmila, et autres
Publié: (2024)

Online Matching: A Brief Survey
par: Huang, Zhiyi, et autres
Publié: (2024)

Faster Semi-streaming Matchings via Alternating Trees
par: Mitrović, Slobodan, et autres
Publié: (2024)

Stochastic Matching via In-n-Out Local Computation Algorithms
par: Azarmehr, Amir, et autres
Publié: (2024)

Streaming and Communication Complexity of Load-Balancing via Matching Contractors
par: Assadi, Sepehr, et autres
Publié: (2024)

Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
par: Joseph, et autres
Publié: (2023)

An Algorithmic Approach to Address Course Enrollment Challenges
par: Biswas, Arpita, et autres
Publié: (2023)

Approximate Cartesian Tree Matching: an Approach Using Swaps
par: Auvray, Bastien, et autres
Publié: (2023)

Matching Composition and Efficient Weight Reduction in Dynamic Matching
par: Bernstein, Aaron, et autres
Publié: (2024)

Approximate Cartesian Tree Matching with One Difference
par: Auvray, Bastien, et autres
Publié: (2025)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
par: Song, Siwoo, et autres
Publié: (2025)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
par: Assadi, Sepehr, et autres
Publié: (2024)

Cost Preserving Dependent Rounding for Allocation Problems
par: Rohwedder, Lars, et autres
Publié: (2025)

Online Allocation with Concave, Diminishing-Returns Objectives
par: Patton, Kalen
Publié: (2025)

Approximating Optimum Online for Capacitated Resource Allocation
par: Braun, Alexander, et autres
Publié: (2024)

Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching
par: Bucić, Matija, et autres
Publié: (2025)

Distributed Approximate Maximum Matching and Minimum Vertex Cover via Generalized Graph Decomposition
par: Davies-Peck, Peter
Publié: (2026)

Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings
par: V., Vishwa Prakash H., et autres
Publié: (2023)

Greedy Dynamic Matching
par: Arnosti, Nick, et autres
Publié: (2025)

Caching Connections in Matchings
par: Sadeh, Yaniv, et autres
Publié: (2023)

Submodular Max-Min Allocation under Identical Valuations
par: Boehmer, Kimon
Publié: (2026)

Maximum Bipartite Matching in $n^{2+o(1)}$ Time via a Combinatorial Algorithm
par: Chuzhoy, Julia, et autres
Publié: (2024)

Validating a PTAS for Triangle-Free 2-Matching via a Simple Decomposition Theorem
par: Kobayashi, Yusuke, et autres
Publié: (2024)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
par: Łącki, Jakub, et autres
Publié: (2025)