OpenAlex
PricingAboutJobs
Log inGet started
Work

Quasi-popular matchings, optimality, and extended formulations

HTML

Year: 2020
Type: conference-paper
Source: Symposium on Discrete Algorithms
DOI: 10.5555/3381089.3381109
Authors: Yuri Faenza, Telikepalli Kavitha
Institutions: Columbia University, Tata Institute of Fundamental Research
Language: English

Topic: Game Theory and Voting Systems
Subfield: Economics and Econometrics
Field: Economics, Econometrics and Finance
Domain: Social Sciences
Keywords: popular matchings, stable marriage problem, bicriteria approximation, extension complexity, matching polytope, extended formulations, NP-hardness, hardness of approximation, edge costs

Open Access status: closed
OpenAlex ID: W3001275923
FWCI: 6.929
Cites:
Cited by: 17
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security