서브메뉴
검색
Algorithms in Complex Environments
Algorithms in Complex Environments
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20250211152656
- ISBN
- 9798384050841
- DDC
- 004
- 서명/저자
- Algorithms in Complex Environments
- 발행사항
- [Sl] : Cornell University, 2024
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2024
- 형태사항
- 190 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 86-03, Section: B.
- 주기사항
- Advisor: Kleinberg, Jon.
- 학위논문주기
- Thesis (Ph.D.)--Cornell University, 2024.
- 초록/해제
- 요약There are many settings in which we must analyze a complex system to make a decision. Two areas that have touched all our lives over the past few years are the COVID pandemic and the rising influence of social media. Aside from the fact that both the management of infections and content moderation are important, contemporaneous issues, they also have other commonalities. For example, both settings involve a network structure, and making decisions in each setting involves analyzing and optimizing a complex system.This thesis studies problems in managing infections and content moderation on social media. We develop theoretical models for each of these settings, and through analyzing our models, show how algorithms can help make decisions about complex systems. For example, in the case of managing infections, we develop a novel mathematical model of contact tracing and show a reduction from our model to the "branching bandits" problem, a variant of the multi-armed bandits problem. Through analyzing this reduction, we show how to construct optimal policies within our model of contact tracing. In the context of content moderation on social media, we model the relationship between content creators and content consumers as a bipartite graph, where consumers are assigned to different creators. Through analyzing the structure of this graph, we discover a tight bound describing how satisfied consumers will be under a specific assignment.
- 일반주제명
- Computer science
- 일반주제명
- Computer engineering
- 일반주제명
- Electrical engineering
- 키워드
- COVID pandemic
- 키워드
- Social media
- 키워드
- Algorithms
- 기타저자
- Cornell University Computer Science
- 기본자료저록
- Dissertations Abstracts International. 86-03B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008250123s2024 us c eng d■001000017163346
■00520250211152656
■006m o d
■007cr#unu||||||||
■020 ▼a9798384050841
■035 ▼a(MiAaPQ)AAI31487528
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004
■1001 ▼aMeister, Michela Christine Gibb.▼0(orcid)0000-0003-1187-7572
■24510▼aAlgorithms in Complex Environments
■260 ▼a[Sl]▼bCornell University▼c2024
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2024
■300 ▼a190 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 86-03, Section: B.
■500 ▼aAdvisor: Kleinberg, Jon.
■5021 ▼aThesis (Ph.D.)--Cornell University, 2024.
■520 ▼aThere are many settings in which we must analyze a complex system to make a decision. Two areas that have touched all our lives over the past few years are the COVID pandemic and the rising influence of social media. Aside from the fact that both the management of infections and content moderation are important, contemporaneous issues, they also have other commonalities. For example, both settings involve a network structure, and making decisions in each setting involves analyzing and optimizing a complex system.This thesis studies problems in managing infections and content moderation on social media. We develop theoretical models for each of these settings, and through analyzing our models, show how algorithms can help make decisions about complex systems. For example, in the case of managing infections, we develop a novel mathematical model of contact tracing and show a reduction from our model to the "branching bandits" problem, a variant of the multi-armed bandits problem. Through analyzing this reduction, we show how to construct optimal policies within our model of contact tracing. In the context of content moderation on social media, we model the relationship between content creators and content consumers as a bipartite graph, where consumers are assigned to different creators. Through analyzing the structure of this graph, we discover a tight bound describing how satisfied consumers will be under a specific assignment.
■590 ▼aSchool code: 0058.
■650 4▼aComputer science
■650 4▼aComputer engineering
■650 4▼aElectrical engineering
■653 ▼aCOVID pandemic
■653 ▼aSocial media
■653 ▼aNetwork structure
■653 ▼aBranching bandits
■653 ▼aAlgorithms
■690 ▼a0984
■690 ▼a0544
■690 ▼a0464
■71020▼aCornell University▼bComputer Science.
■7730 ▼tDissertations Abstracts International▼g86-03B.
■790 ▼a0058
■791 ▼aPh.D.
■792 ▼a2024
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17163346▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
