서브메뉴
검색
Essays on Applications of Networks and Discrete Optimization- [electronic resource]
![Essays on Applications of Networks and Discrete Optimization - [electronic resource]](/Users/Baul/Images/book.png)
Essays on Applications of Networks and Discrete Optimization- [electronic resource]
상세정보
- 자료유형
- 학위논문파일 국외
- 최종처리일시
- 20240214100431
- ISBN
- 9798379717155
- DDC
- 658
- 저자명
- Lin, Mingqian.
- 서명/저자
- Essays on Applications of Networks and Discrete Optimization - [electronic resource]
- 발행사항
- [S.l.]: : Princeton University., 2023
- 발행사항
- Ann Arbor : : ProQuest Dissertations & Theses,, 2023
- 형태사항
- 1 online resource(174 p.)
- 주기사항
- Source: Dissertations Abstracts International, Volume: 84-12, Section: B.
- 주기사항
- Advisor: Mulvey, John M.
- 학위논문주기
- Thesis (Ph.D.)--Princeton University, 2023.
- 사용제한주기
- This item must not be sold to any third party vendors.
- 초록/해제
- 요약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.
- 일반주제명
- Finance.
- 키워드
- Network analysis
- 기타저자
- Princeton University Operations Research and Financial Engineering
- 기본자료저록
- Dissertations Abstracts International. 84-12B.
- 기본자료저록
- Dissertation Abstract International
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008240612s2023 us |||||||||||||||c||eng d■001000016932226
■00520240214100431
■006m o d
■007cr#unu||||||||
■020 ▼a9798379717155
■035 ▼a(MiAaPQ)AAI30490248
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a658
■1001 ▼aLin, Mingqian.
■24510▼aEssays on Applications of Networks and Discrete Optimization▼h[electronic resource]
■260 ▼a[S.l.]:▼bPrinceton University. ▼c2023
■260 1▼aAnn Arbor :▼bProQuest Dissertations & Theses, ▼c2023
■300 ▼a1 online resource(174 p.)
■500 ▼aSource: Dissertations Abstracts International, Volume: 84-12, Section: B.
■500 ▼aAdvisor: Mulvey, John M.
■5021 ▼aThesis (Ph.D.)--Princeton University, 2023.
■506 ▼aThis item must not be sold to any third party vendors.
■520 ▼aThis 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.
■590 ▼aSchool code: 0181.
■650 4▼aFinance.
■653 ▼aDiscrete optimization
■653 ▼aNetwork analysis
■653 ▼aNetwork optimization
■653 ▼aPersonnel planning
■653 ▼aPortfolio optimization
■653 ▼aRegime identification
■690 ▼a0796
■690 ▼a0508
■690 ▼a0454
■71020▼aPrinceton University▼bOperations Research and Financial Engineering.
■7730 ▼tDissertations Abstracts International▼g84-12B.
■773 ▼tDissertation Abstract International
■790 ▼a0181
■791 ▼aPh.D.
■792 ▼a2023
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T16932226▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
■980 ▼a202402▼f2024
