Conference item
Online trading as a secretary problem
- Abstract:
- 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 objectives: welfare and gain-from-trade.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 501.1KB, Terms of use)
-
- Publisher copy:
- 10.1007/978-3-319-99660-8_18
Authors
- Publisher:
- Springer
- Host title:
- Algorithmic Game Theory
- Journal:
- Lecture Notes in Computer Science More from this journal
- Volume:
- 11059
- Pages:
- 201-212
- Series:
- Lecture Notes in Computer Science
- Publication date:
- 2018-08-27
- DOI:
- ISSN:
-
1611-3349, 0302-9743
- ISBN:
- 9783319996592
- Pubs id:
-
pubs:919073
- UUID:
-
uuid:732d1d6c-5181-4fd8-9873-74db8019ddd9
- Local pid:
-
pubs:919073
- Source identifiers:
-
919073
- Deposit date:
-
2019-04-16
- ARK identifier:
Terms of use
- Copyright holder:
- Springer Nature
- Copyright date:
- 2018
- Notes:
- © Springer Nature Switzerland AG 2018. This paper has been presented at th International Symposium on Algorithmic Game Theory (SAGT), 11-14 September 2018, Beijing, China. This is the accepted manuscript version of the article. The final version is available online from Springer at: https://doi.org/10.1007/978-3-319-99660-8_18
If you are the owner of this record, you can report an update to it here: Report update to this record