"Competitive Query Minimization for Stable Matching with One-Sided Uncertainty."

Evripidis Bampis et al. (2024)

> Home

Details and statistics

DOI: 10.4230/LIPICS.APPROX/RANDOM.2024.17

access: open

type: Conference or Workshop Paper

metadata version: 2024-09-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/approx/BampisDEMST24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/BampisDEMST24
Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan:
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. APPROX/RANDOM 2024: 17:1-17:21

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.