OpenAlex
PricingAboutJobs
Log inGet started
Work

Computational Complexity of k -stable Matchings

HTML

Year: 2024
Type: article
Source: ACM Transactions on Economics and Computation
DOI: 10.1145/3708507
Authors: Haris Aziz, Gergely Csáji, Ágnes Cseh
Institutions: UNSW Sydney, ELTE Centre for Economic and Regional Studies, Hungarian Research Network, University of Bayreuth
Language: English

Topic: Game Theory and Voting Systems
Subfield: Economics and Econometrics
Field: Economics, Econometrics and Finance
Domain: Social Sciences

Open Access status: closed

Funders: Hungarian Scientific Research Fund, Magyar Tudományos Akadémia, Nemzeti Kutatási, Fejlesztési és Innovaciós Alap
OpenAlex ID: W4405375760
FWCI: 0.354
Cites: 47
Cited by: 1
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