| LDR | | 00000nam u2200205 4500 |
| 001 | | 000000432688 |
| 005 | | 20200224133755 |
| 008 | | 200131s2019 ||||||||||||||||| ||eng d |
| 020 | |
▼a 9781687913210 |
| 035 | |
▼a (MiAaPQ)AAI13897505 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
| 082 | 0 |
▼a 004 |
| 100 | 1 |
▼a Xu, Pan. |
| 245 | 10 |
▼a Matching Algorithm Design in E-Commerce: Harnessing the Power of Machine Learning via Stochastic Optimization. |
| 260 | |
▼a [S.l.]:
▼b University of Maryland, College Park.,
▼c 2019. |
| 260 | 1 |
▼a Ann Arbor:
▼b ProQuest Dissertations & Theses,
▼c 2019. |
| 300 | |
▼a 96 p. |
| 500 | |
▼a Source: Dissertations Abstracts International, Volume: 81-05, Section: B. |
| 500 | |
▼a Advisor: Dickerson, John |
| 502 | 1 |
▼a Thesis (Ph.D.)--University of Maryland, College Park, 2019. |
| 506 | |
▼a This item must not be sold to any third party vendors. |
| 520 | |
▼a 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 partners), etc. A fundamental challenge is the presence of uncertainty, which manifests in the following two ways. The first is on the arrival of agents in the system, e.g., drivers and riders in ridesharing services, keywords in the Internet advertising, and online workers in crowdsourcing markets. The second is on the outcome of interaction. For example, two users may like or dislike each other after a dating arranged by a match-making firm, a user may click or not click the link of an advertisement shown by an Ad company, to name a few.We are now living in an era of big data, fortunately. Thus, by applying powerful machine learning techniques to huge volumes of historical data, we can often get very accurate estimates of the uncertainty in the system as described above. Given this, the question then is as follows: How can we exploit estimates for our benefits as a matching-policy designer?This dissertation aims to address this question. We have built an AI toolbox, which takes as input the estimates over uncertainty in the system, appropriate objectives (e.g., maximization of the total profit, maximization of fairness, etc.), and outputs a matching policy which works well both theoretically and experimentally on those pre-specified targets. The key ingredients are two matching models: stochastic matching and online matching. We have made several foundational algorithmic progress for these two models. Additionally, we have successfully utilized these two models to harness estimates from powerful machine learning algorithms, and designed improved matching policies for various real matching markets including ridesharing, crowdsourcing, and online recommendation applications. |
| 590 | |
▼a School code: 0117. |
| 650 | 4 |
▼a Computer science. |
| 690 | |
▼a 0984 |
| 710 | 20 |
▼a University of Maryland, College Park.
▼b Computer Science. |
| 773 | 0 |
▼t Dissertations Abstracts International
▼g 81-05B. |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0117 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2019 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T15491838
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
| 980 | |
▼a 202002
▼f 2020 |
| 990 | |
▼a ***1008102 |
| 991 | |
▼a E-BOOK |