Online trading as a secretary problem
We consider the online problem in which an intermediary trades identical items with a sequence of n buyers and n sellers, each of unit demand. We assume that the values of the traders are selected by an adversary and the sequence is randomly permuted. We give competitive algorithms for two objective...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
Springer
2018
|