Technical note - assortment planning for two-sided sequential matching markets
Year of publication: |
2022
|
---|---|
Authors: | Ashlagi, Itai ; Krishnaswamy, Anilesh K. ; Makhijani, Rahul ; Saban, Daniela ; Shiragur, Kirankumar |
Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 70.2022, 5, p. 2784-2803
|
Subject: | analysis of algorithms | applications | matchings | networks/graphs | Revenue Management and Market Analytics | utility/preference |
-
Improved online contention resolution for matchings and applications to the gig economy
Pollner, Tristan, (2024)
-
Constrained resource assignments : fast algorithms and applications in wireless networks
Berger, André, (2016)
-
A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
Demeulemeester, Erik, (1992)
- More ...
-
A note on object allocation under lexicographic preferences
Saban, Daniela, (2014)
-
The complexity of computing the random priority allocation matrix
Saban, Daniela, (2015)
-
Analysis and Models of Bilateral Investment Treaties Using a Social Networks Approach
Saban, Daniela, (2012)
- More ...