Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

How Good Are Popular Matchings

From MaRDI portal
Publication:5140718
Jump to:navigation, search

DOI10.4230/LIPIcs.SEA.2018.9zbMath1496.91061arXiv1805.01311OpenAlexW2963295982MaRDI QIDQ5140718

Amit Rawat, Prajakta Nimbhorkar, A. M. Krishnapriya, Meghana Nasre

Publication date: 16 December 2020

Full work available at URL: https://arxiv.org/abs/1805.01311


zbMATH Keywords

bipartite graphspopular matchingshospital residentslower-quotas


Mathematics Subject Classification ID

Matching models (91B68)


Related Items (2)

Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective ⋮ Envy-freeness and relaxed stability: hardness and approximation algorithms


Uses Software

  • GitHub


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • The hospitals/residents problem with lower quotas
  • Size versus stability in the marriage problem
  • ``Almost-stable matchings in the hospitals/residents problem with couples
  • Popular edges and dominant matchings
  • Popularity in the generalized hospital residents setting
  • Popular Matchings
  • Popular Matchings in the Marriage and Roommates Problems
  • Popular Matchings with Lower Quotas
  • A Size-Popularity Tradeoff in the Stable Marriage Problem
  • College Admissions and the Stability of Marriage


This page was built for publication: How Good Are Popular Matchings

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5140718&oldid=19679196"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 14:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki