Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol (Q2942668): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963228229 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1405.5975 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:04, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol |
scientific article |
Statements
Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol (English)
0 references
11 September 2015
0 references
competitive ratio
0 references
optimal protocol
0 references
combinatorial auction
0 references
online auction
0 references
dual program
0 references
