Algorithms for maximum social welfare of online random trading
type: Item
instance of: scholarly article
title: Algorithms for maximum social welfare of online random trading
author: Xujin Chen
author: Xiaodong Hu
author: Chenhao Wang
author: Xiaoying Wu
author: Mengqi Zhang
published in: Discrete Applied Mathematics
publication date: 2024-06-20T00:00:00Z
Mathematics Subject Classification ID: 91B60
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 7868449
zbMATH Keywords: online algorithms
zbMATH Keywords: competitive ratio
zbMATH Keywords: secretary problem
zbMATH Keywords: random intermediation
MaRDI profile type: Publication
cites work: Improved algorithms and analysis for secretary problems and generalizations
cites work: A Knapsack Secretary Problem with Applications
cites work: Q2934624
cites work: Concentration inequalities for sampling without replacement
cites work: Approximating Gains-from-Trade in Bilateral Trading
cites work: Secretary Problems via Linear Programming
cites work: Q5653410
cites work: Online Market Intermediation
cites work: The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids
cites work: An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
cites work: A multiple-choice secretary algorithm with applications to online auctions
cites work: Algorithms for Secretary Problems on Graphs and Hypergraphs
cites work: Online trading as a secretary problem
cites work: Online matching and ad allocation
cites work: Efficient mechanisms for bilateral trading
cites work: An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem
cites work: SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism
DOI: 10.1016/J.DAM.2023.12.002
description: scientific article; zbMATH DE number 7868449