Algorithms for maximum social welfare of online random trading

DOI10.1016/J.DAM.2023.12.002MaRDI QIDQ6558686zbMATH OpenFDO

Authors Xujin Chen, Xiaodong Hu, Chenhao Wang, Xiaoying Wu, Mengqi Zhang

Publication date 20 June 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

online algorithmscompetitive ratiosecretary problemrandom intermediation

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Trade models (91B60)

Recommendations

• Online trading as a secretary problem
• Online algorithms for market clearing
• Competitive algorithms for unbounded one-way trading
• Competitive algorithms for unbounded one-way trading
• scientific article; zbMATH DE number 2119762

Cites work

• scientific article; zbMATH DE number 3383344 (Why is no real title available?)
• A Knapsack Secretary Problem with Applications
• A multiple-choice secretary algorithm with applications to online auctions
• Algorithms for Secretary Problems on Graphs and Hypergraphs
• An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
• An optimal truthful mechanism for the online weighted bipartite matching problem
• Approximating gains-from-trade in bilateral trading
• Concentration inequalities for sampling without replacement
• Efficient mechanisms for bilateral trading
• Improved algorithms and analysis for secretary problems and generalizations
• Matroids, secretary problems, and online mechanisms
• Online market intermediation
• Online matching and ad allocation
• Online trading as a secretary problem
• SBBA: a strongly-budget-balanced double-auction mechanism
• Secretary Problems via Linear Programming
• The matroid secretary problem for minor-closed classes and random matroids

This page was built for publication: Algorithms for maximum social welfare of online random trading

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558686)