{"id":{"repo_id":"nus","oai_identifier":"oai:scholarbank.nus.edu.sg:10635/309680"},"canonical_url":"https://search.dev.ndltd.org/etd/nus/oai:scholarbank.nus.edu.sg:10635/309680","repository":{"repo_id":"nus","name":"National University of Singapore","base_url":"https://scholarbank.nus.edu.sg/oai/request"},"display":{"title":"RISK- AND AMBIGUITY-AVERSE OPTIMIZATION MADE MORE TRACTABLE AND LESS CONSERVATIVE","abstract":"This thesis builds on the recent developments in distributionally robust optimization and satisficing and proposes how robust decisions under uncertainty can be efficiently made when the decision maker exhibits risk aversion, ambiguity aversion and regret aversion. Theoretically, we develop a new regret-based robust satisficing framework and devise an upper confidence bound algorithm to tackle two-stage optimization and online learning, respectively. The thesis is complemented by several practical case studies revolving around inventory management, monopoly pricing and portfolio selection.","abstract_html":"This thesis builds on the recent developments in distributionally robust optimization and satisficing and proposes how robust decisions under uncertainty can be efficiently made when the decision maker exhibits risk aversion, ambiguity aversion and regret aversion. Theoretically, we develop a new regret-based robust satisficing framework and devise an upper confidence bound algorithm to tackle two-stage optimization and online learning, respectively. The thesis is complemented by several practical case studies revolving around inventory management, monopoly pricing and portfolio selection.","abstract_has_math":false,"creators":["XUE YILIN"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024-06-20","date_published":"2024-06-20","updated_at":"2026-07-24T03:33:09Z","subjects":["regret minimization","online learning","satisficing","distributionally robust optimization","Robust optimization"],"languages":[],"rights":[],"rights_urls":["https://scholarbank.nus.edu.sg/bitstreams/0df0cae7-70f4-4268-bc18-c4ca5ea3c26b/download"],"identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["XUE YILIN"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.issued","label":"Date","values":["2024-06-20"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://scholarbank.nus.edu.sg/handle/10635/309680"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["regret minimization","online learning","satisficing","distributionally robust optimization","Robust optimization"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["https://scholarbank.nus.edu.sg/bitstreams/0df0cae7-70f4-4268-bc18-c4ca5ea3c26b/download"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://scholarbank.nus.edu.sg/bitstreams/7e8294ad-e995-4553-a518-8e59084517d8/download"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis builds on the recent developments in distributionally robust optimization and satisficing and proposes how robust decisions under uncertainty can be efficiently made when the decision maker exhibits risk aversion, ambiguity aversion and regret aversion. Theoretically, we develop a new regret-based robust satisficing framework and devise an upper confidence bound algorithm to tackle two-stage optimization and online learning, respectively. The thesis is complemented by several practical case studies revolving around inventory management, monopoly pricing and portfolio selection."]},{"key":"dc:format.checksum.md5","label":"Dc Format Checksum Md5","values":["9f3c6f2aa8f96291ef77b0a18484521d","a76864ad92427f7ae249a74fb0ea3bcf","fa24ddcf3d10daca52dd19f8be63de16"]},{"key":"dc:title","label":"Title","values":["RISK- AND AMBIGUITY-AVERSE OPTIMIZATION MADE MORE TRACTABLE AND LESS CONSERVATIVE"]}]}],"canonical_facts":{"dc:creator":["XUE YILIN"],"dc:date.issued":["2024-06-20"],"dc:description.abstract":["This thesis builds on the recent developments in distributionally robust optimization and satisficing and proposes how robust decisions under uncertainty can be efficiently made when the decision maker exhibits risk aversion, ambiguity aversion and regret aversion. Theoretically, we develop a new regret-based robust satisficing framework and devise an upper confidence bound algorithm to tackle two-stage optimization and online learning, respectively. The thesis is complemented by several practical case studies revolving around inventory management, monopoly pricing and portfolio selection."],"dc:format.checksum.md5":["9f3c6f2aa8f96291ef77b0a18484521d","a76864ad92427f7ae249a74fb0ea3bcf","fa24ddcf3d10daca52dd19f8be63de16"],"dc:identifier.uri":["https://scholarbank.nus.edu.sg/bitstreams/7e8294ad-e995-4553-a518-8e59084517d8/download"],"dc:relation.isreferencedby":["https://scholarbank.nus.edu.sg/handle/10635/309680"],"dc:rights":["https://scholarbank.nus.edu.sg/bitstreams/0df0cae7-70f4-4268-bc18-c4ca5ea3c26b/download"],"dc:subject":["regret minimization","online learning","satisficing","distributionally robust optimization","Robust optimization"],"dc:title":["RISK- AND AMBIGUITY-AVERSE OPTIMIZATION MADE MORE TRACTABLE AND LESS CONSERVATIVE"],"dc:type":["Thesis"]},"updated_at":"2026-07-24T03:33:09Z"}