Stable matching problem algorithms and instance generator

Thumbnail
View/Open
Publication date
2024-09-20
Creators
Karapetyan, Daniel
Metadata
Show full item record
Description
The implementations of the Deferred Acceptance (DA) and Accelerated Deferred Acceptance (ADA) algorithms, as well as a pseudo-random instance generator for the Stable Matching Problem, used in the following paper: Gregory Z. Gutin, Daniel Karapetyan, Philip R. Neary, Alexander Vickery, Anders Yeo, Speeding up deferred acceptance.
External URI
DOI
Links
Subjects
  • Algorithms
  • Matching theory
  • Deferred Acceptance, Accelerated Deferred Acceptance, Stable Matching Problem, Instance Generator, Gale–Shapley algorithm
  • Computer Sciences::Computer science::Computational science foundations
  • H Social sciences::HB Economic theory
  • Q Science::QA Mathematics::QA 75 Electronic computers. Computer science
Divisions
  • University of Nottingham, UK Campus
Deposit date
2024-09-20
Alternative title
  • Deferred acceptance and accelerated deferred acceptance implementations
Data type
Python code
Funders
  • None
Data collection method
Created by the author
Resource languages
  • en
Publisher
The University of Nottingham
CC-BY
Except where otherwise noted, this item's license is described as Creative Commons by Attribution