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 8 of 8 for “"Online matching"”.
-
Competitive algorithms for online matching and vertex cover problems
… has witnessed an explosion of research on the online bipartite matching problem. Surprisingly, its dual problem, online bipartite vertex cover, has never been explicitly studied before. One of the motivation for studying this problem is that it significantly generalizes the classical ski rental …
-
Input Sensitive Analysis of a Minimum Metric Bipartite Matching Algorithm
… in real-time. In this thesis, we consider the online bipartite matching problem where each server can serve exactly one request. In the online minimum metric bipartite matching problem, we are provided with a set of server locations in a metric space. Requests arrive one at a time that have to …
-
Analysis of approximation and uncertainty in optimization
… the average performance of greedy algorithms for online matching on random graphs. In online matching problems, vertices arrive sequentially and reveal their neighboring edges. Vertices may be matched upon arrival and matches are irrevocable. We determine asymptotic matching sizes obtained by a …
-
Generalized sequential assignment problem
… assignment problems due to their applications in online matching markets, asset selling, and organ transplant. This dissertation studies several variations of SSAP by relaxing the main assumptions. The first part assumes that the workers' success rates are random values coming from a known …
-
Primal-Dual Techniques for Online Algorithms and Mechanisms
… one that knows the entire input in advance. An online algorithm, however, processes its input in a serial fashion. In contrast to offline algorithms, an online algorithm works in a local fashion and has to make irrevocable decisions without having the entire input. Online algorithms are often …
-
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 …
-
Advancements in Management Science: Applications to Online Retail, Healthcare, and Non-Profit Fundraising
… dynamic pricing problem commonly faced by online retailers. Customers arrive sequentially to the selling platform, and for each arrival the seller must make an immediate pricing decision for that customer. The seller aims to learn the demand as a function of price and customer covariates …
-
Essays in industrial organization
User data is extensively used for ad targeting on online platforms, and a higher volume of data allows platforms to improve targeting and may incentivize mergers. This research quantifies the impact of data on match quality (measured by average user click rates) in the online advertising industry, …