國立虎尾科技大學 |

Essays on Applications of Networks and Discrete Optimization.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Essays on Applications of Networks and Discrete Optimization./
作者:	Lin, Mingqian.
面頁冊數:	1 online resource (174 pages)
附註:	Source: Dissertations Abstracts International, Volume: 84-12, Section: B.
Contained By:	Dissertations Abstracts International84-12B.
標題:	Finance. -
電子資源:	click for full text (PQDT)
ISBN:	9798379717155

Essays on Applications of Networks and Discrete Optimization.
Lin, Mingqian.

Essays on Applications of Networks and Discrete Optimization. - 1 online resource (174 pages)

Source: Dissertations Abstracts International, Volume: 84-12, Section: B.

Thesis (Ph.D.)--Princeton University, 2023.

Includes bibliographical references

This dissertation examines novel applications of network and discrete optimization models in three settings: 1) a social network analysis of stock prices; 2) personnel planning for large, client-centric service organizations; and 3) identifying regimes in financial time series by formal discrete quadratic programming models. In each case, the overall purpose is to improve performance as compared with traditional techniques, while addressing practical concerns regarding data and solution constraints.The first chapter presents a graphical network approach for analyzing the temporal structure of financial markets with a focus on temporal stock price movements. Three unsupervised learning algorithms are linked to construct the network over several time periods. A derived investment strategy generate performance with lower volatility than alternative strategies. The resulting graphs give insights into the dynamic patterns in stock prices relative to each other and to the market.The second chapter introduces a flexible personnel planning framework for large service sector organizations with a client-centric focus, such as concierge banks and wealth management firms. The approach is to approximate the problem as a two-stage network optimization model, rather than solving an integer linear program for the full organization. We demonstrate that the network approach provides a practical and flexible tool for decisions involving assigning the key bank employees to clients. In particular, the model improves efficiency by reducing superfluous connections while maintaining a balanced workload and importantly, generating a higher quality-of-service for the firm's clients. The system is designed to allow a close interaction between the decision makers and the network optimization solver.The third chapter investigates the discovery of regimes in financial markets by means of the recent research on non-parametric jump models. Rather than solving the jump model with a heuristic combination of the k-means clustering algorithm and dynamic programming (a type of coordinate decent), we construct a formal discrete quadratic program and develop a candidate driven approximate approach. Here the candidate model greatly improves solution efficiency, while generating solutions that are close to the jump model. Applications of the proposed model are shown in both the case of the discrete and the continuous jump models.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798379717155Subjects--Topical Terms:

559073
Finance.
Subjects--Index Terms:

Discrete optimizationIndex Terms--Genre/Form:

554714
Electronic books.

Essays on Applications of Networks and Discrete Optimization.
LDR:03844ntm a2200409K 4500 001 1141566
005 20240318062641.5
006 m o d
007 cr mn ---uuuuu
008 250605s2023 xx obm 000 0 eng d
020 $a 9798379717155
035 $a (MiAaPQ)AAI30490248
035 $a AAI30490248
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Lin, Mingqian. $3 1465424
245 1 0 $a Essays on Applications of Networks and Discrete Optimization.
264 0 $c 2023
300 $a 1 online resource (174 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 84-12, Section: B.
500 $a Advisor: Mulvey, John M.
502 $a Thesis (Ph.D.)--Princeton University, 2023.
504 $a Includes bibliographical references
520 $a This dissertation examines novel applications of network and discrete optimization models in three settings: 1) a social network analysis of stock prices; 2) personnel planning for large, client-centric service organizations; and 3) identifying regimes in financial time series by formal discrete quadratic programming models. In each case, the overall purpose is to improve performance as compared with traditional techniques, while addressing practical concerns regarding data and solution constraints.The first chapter presents a graphical network approach for analyzing the temporal structure of financial markets with a focus on temporal stock price movements. Three unsupervised learning algorithms are linked to construct the network over several time periods. A derived investment strategy generate performance with lower volatility than alternative strategies. The resulting graphs give insights into the dynamic patterns in stock prices relative to each other and to the market.The second chapter introduces a flexible personnel planning framework for large service sector organizations with a client-centric focus, such as concierge banks and wealth management firms. The approach is to approximate the problem as a two-stage network optimization model, rather than solving an integer linear program for the full organization. We demonstrate that the network approach provides a practical and flexible tool for decisions involving assigning the key bank employees to clients. In particular, the model improves efficiency by reducing superfluous connections while maintaining a balanced workload and importantly, generating a higher quality-of-service for the firm's clients. The system is designed to allow a close interaction between the decision makers and the network optimization solver.The third chapter investigates the discovery of regimes in financial markets by means of the recent research on non-parametric jump models. Rather than solving the jump model with a heuristic combination of the k-means clustering algorithm and dynamic programming (a type of coordinate decent), we construct a formal discrete quadratic program and develop a candidate driven approximate approach. Here the candidate model greatly improves solution efficiency, while generating solutions that are close to the jump model. Applications of the proposed model are shown in both the case of the discrete and the continuous jump models.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Finance. $3 559073
653 $a Discrete optimization
653 $a Network analysis
653 $a Network optimization
653 $a Personnel planning
653 $a Portfolio optimization
653 $a Regime identification
655 7 $a Electronic books. $2 local $3 554714
690 $a 0796
690 $a 0508
690 $a 0454
710 2 $a Princeton University. $b Operations Research and Financial Engineering. $3 1182940
710 2 $a ProQuest Information and Learning Co. $3 1178819
773 0 $t Dissertations Abstracts International $g 84-12B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30490248 $z click for full text (PQDT)