Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 14 of 14 for “"Stochastic matching"”.

  1. Stochastic Matching Networks: Theory and Applications to Matching Markets

    … the common operational challenge of dynamically matching customers and servers with each other. In addition to such software-based platforms, recent technological breakthroughs are leading to networked matching platforms that match various virtual or physical entities—for example, matching …

    gatech Repository record for Stochastic Matching Networks: Theory and Applications to Matching Markets (opens in a new tab)

  2. Online Decision-Making in a Randomized Environment: Stochastic Matching and Adaptive Random Graph Processes

    … the thesis, we consider an online version of the stochastic matching problem. The stochastic matching problem is a generalization of the classical maximal matching problem in which the edges are associated with known edge probabilities which model their likelihood of existing. The algorithm must …

    toronto-retro Repository record for Online Decision-Making in a Randomized Environment: Stochastic Matching and Adaptive Random Graph Processes (opens in a new tab)

  3. Decision making under uncertainty

    … this context, ranking, utility maximization, and matching, all involving uncertain datasets. First, we consider the problem of ranking and top-k query processing over probabilistic datasets. By illustrating the diverse and conflicting behaviors of the prior proposals, we contend that a single, …

    maryland Repository record for Decision making under uncertainty (opens in a new tab)

  4. Matching Algorithm Design in E-Commerce: Harnessing the Power of Machine Learning via Stochastic Optimization

    Internet-based matching markets have gained great attention during the last decade, such as Internet advertising (matching keywords and advertisers), ridesharing platforms (pairing riders and drivers), crowdsourcing markets (assigning tasks to workers), online dating (pairing romantically attracted …

    maryland Repository record for Matching Algorithm Design in E-Commerce: Harnessing the Power of Machine Learning via Stochastic Optimization (opens in a new tab)

  5. Stochastic Optimization in Market Design and Incentive Management Problems

    … parties. We formulate these issues into stochastic optimization problems and use a variety of techniques from the theories of applied probability, queueing and dynamic programming.</p><p>First, we study a stochastic matching problem. We consider matching over time with short and …

    duke Repository record for Stochastic Optimization in Market Design and Incentive Management Problems (opens in a new tab)

  6. An ensemble speaker and speaking environment modeling approach to robust speech recognition

    … for a new testing environment based on a stochastic matching criterion. A series of techniques is proposed to further improve the original ESSEM approach on both offline and online phases. For the offline phase, we focus on methods to enhance the construction and coverage of the …

    gatech Repository record for An ensemble speaker and speaking environment modeling approach to robust speech recognition (opens in a new tab)

  7. Decomposition algorithms for stochastic combinatorial optimization: Computational experiments and extensions

    … in computer science and operations research are stochastic combinatorial optimization (SCO) problems. SCO deals with a class of combinatorial optimization models and algorithms in which some of the data are subject to significant uncertainty and evolve over time, and often discrete decisions need …

    arizona-thes Repository record for Decomposition algorithms for stochastic combinatorial optimization: Computational experiments and extensions (opens in a new tab)

  8. Stochastic Assignment with Expiration

    This thesis introduces a capacitated online stochastic bipartite matching problem, where offline nodes may be matched multiple times and expire at unknown stochastic times. This problem is PSPACE hard; thus we first focus on the subproblem where each offline node can be matched at most once and aim …

    rice Repository record for Stochastic Assignment with Expiration (opens in a new tab)

  9. Fairness and Uncertainty in Graph Matching

    Graph matching is a fundamental computational problem with a broad range of applications across different domains, including resource allocation, e-commerce, kidney exchange, ad placement, and ride-sharing. While the classical maximum matching problem is well-understood, many real-world …

    maryland Repository record for Fairness and Uncertainty in Graph Matching (opens in a new tab)

  10. ALGORITHMS FOR MARKETS: MATCHING AND PRICING

    … auctions. The second contribution is designing matching algorithms for markets in which money often plays little to no role (i.e., matching markets). Auctions have become the standard method of allocating resources in monetary markets, and when it comes to multi-unit auctions …

    maryland Repository record for ALGORITHMS FOR MARKETS: MATCHING AND PRICING (opens in a new tab)

  11. Pricing and Matching Shared Rides

    … The key challenge lies in designing pricing and matching policies that effectively balance platform profitability, rider accessibility, and system efficiency. This research aims to address this challenge through three interconnected research works.The first work tries to address the problem from …

    washington Repository record for Pricing and Matching Shared Rides (opens in a new tab)

  12. Large-Scale Optimization for On-Demand Transportation Platforms and E-Commerce Supply Chains

    … Chapter 2 studies a dynamic non-bipartite stochastic matching problem, where nodes appear following a type-specific independent distribution and wait in the system for a given sojourn time. This problem is motivated by applications in ride-sharing and freight transportation marketplaces. We …

    gatech Repository record for Large-Scale Optimization for On-Demand Transportation Platforms and E-Commerce Supply Chains (opens in a new tab)

  13. Design and Analysis of Stochastic Processing and Matching Networks

    Stochastic Processing Networks (SPNs) and Stochastic Matching Networks (SMNs) play a crucial role in various engineering domains, encompassing applications in Data Centers, Telecommunication, Transportation, and more. As these networks become increasingly complex and integral to modern systems, …

    gatech Repository record for Design and Analysis of Stochastic Processing and Matching Networks (opens in a new tab)

  14. Assignment problems and their application in economics

    … problem studied in this thesis is a two-stage stochastic matching problem in both online and oine versions. In this work, which is presented in Chapter 2 of this thesis, a coordinator tries to benet by having access to the statistics of the future price discounts which can be completely …

    maryland Repository record for Assignment problems and their application in economics (opens in a new tab)