Online trading as a secretary problem
E Koutsoupias, P Lazos - … , SAGT 2018, Beijing, China, September 11-14 …, 2018 - Springer
Algorithmic Game Theory: 11th International Symposium, SAGT 2018, Beijing …, 2018•Springer
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.
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.
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.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果