東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Robust Design in Game Theory: Bayesian Optimization Approach to Minimax Problems with Equilibrium Constraints.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Robust Design in Game Theory: Bayesian Optimization Approach to Minimax Problems with Equilibrium Constraints./
作者:	Jian, Jianan.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
面頁冊數:	53 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-06, Section: B.
Contained By:	Dissertations Abstracts International83-06B.
標題:	Mathematical programming. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28845157
ISBN:	9798759923725

Robust Design in Game Theory: Bayesian Optimization Approach to Minimax Problems with Equilibrium Constraints.
Jian, Jianan.

Robust Design in Game Theory: Bayesian Optimization Approach to Minimax Problems with Equilibrium Constraints. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 53 p.

Source: Dissertations Abstracts International, Volume: 83-06, Section: B.

Thesis (Ph.D.)--University of Pittsburgh, 2021.

This item must not be sold to any third party vendors.

Modern engineering systems have become increasingly complex due to the integration of human actors and advanced artificial intelligence, both of which can be interpreted as intelligent agents. Game theory is a mathematical framework that provides an explanatory model for systems constituted of those intelligent agents. It postulates that the apparent behavior of a system is an equilibrium resulting from each agent within the system individually optimizing their own objectives. Thus, designing an intelligent system is to identify a configuration such that its equilibrium is desirable with respect to some external criteria. However, equilibria are often not unique and form sets that lack topological properties on which optimization heavily relies on, e.g., convexity, connectedness, or even compactness in some cases. The unsureness nature, i.e., uncertainty, of equilibria also appeals for another common design criterion: robustness. In this context, a robust design should reach worstcase optimality to avoid sensitivity to the eventual outcome among all possible equilibria.In this dissertation, I incorporate both the game theoretical aspect and the robustness requirement of system design using the formulation of minimax problems with equilibrium constraints. The complexity of the problem structure and the non-uniqueness of potential equilibria require a new solution strategy different from traditional gradient based methods. I propose a Bayesian approach which infers the probabilistic belief of the optimality of a design given sampled objective function values. Due to the anisotropic natural of systems of independent agents, I then revisit the original Kushner's Wiener process prior instead of radial basis kernel prior despite their popularity for other global optimization applications. I also derive theoretical results on sample maxima and their locations, develop an effective method to decompose the search space into independent regions, and design necessary adaptations to take into account the equilibrium constraints and minimax objective. Finally, I discuss a few applications of the proposed design framework.

ISBN: 9798759923725Subjects--Topical Terms:

3683785
Mathematical programming.

Robust Design in Game Theory: Bayesian Optimization Approach to Minimax Problems with Equilibrium Constraints.
LDR:03233nmm a2200337 4500 001 2344937
005 20220531062219.5
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798759923725
035 $a (MiAaPQ)AAI28845157
035 $a (MiAaPQ)Pittsburgh41478
035 $a AAI28845157
040 $a MiAaPQ $c MiAaPQ
100 1 $a Jian, Jianan. $3 3683784
245 1 0 $a Robust Design in Game Theory: Bayesian Optimization Approach to Minimax Problems with Equilibrium Constraints.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 53 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-06, Section: B.
500 $a Advisor: Zeng, Bo.
502 $a Thesis (Ph.D.)--University of Pittsburgh, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a Modern engineering systems have become increasingly complex due to the integration of human actors and advanced artificial intelligence, both of which can be interpreted as intelligent agents. Game theory is a mathematical framework that provides an explanatory model for systems constituted of those intelligent agents. It postulates that the apparent behavior of a system is an equilibrium resulting from each agent within the system individually optimizing their own objectives. Thus, designing an intelligent system is to identify a configuration such that its equilibrium is desirable with respect to some external criteria. However, equilibria are often not unique and form sets that lack topological properties on which optimization heavily relies on, e.g., convexity, connectedness, or even compactness in some cases. The unsureness nature, i.e., uncertainty, of equilibria also appeals for another common design criterion: robustness. In this context, a robust design should reach worstcase optimality to avoid sensitivity to the eventual outcome among all possible equilibria.In this dissertation, I incorporate both the game theoretical aspect and the robustness requirement of system design using the formulation of minimax problems with equilibrium constraints. The complexity of the problem structure and the non-uniqueness of potential equilibria require a new solution strategy different from traditional gradient based methods. I propose a Bayesian approach which infers the probabilistic belief of the optimality of a design given sampled objective function values. Due to the anisotropic natural of systems of independent agents, I then revisit the original Kushner's Wiener process prior instead of radial basis kernel prior despite their popularity for other global optimization applications. I also derive theoretical results on sample maxima and their locations, develop an effective method to decompose the search space into independent regions, and design necessary adaptations to take into account the equilibrium constraints and minimax objective. Finally, I discuss a few applications of the proposed design framework.
590 $a School code: 0178.
650 4 $a Mathematical programming. $3 3683785
650 4 $a Airports. $3 689960
650 4 $a Correspondence. $3 1973606
650 4 $a Banach spaces. $3 579190
650 4 $a Mathematical models. $3 522882
650 4 $a Optimization techniques. $3 3681622
650 4 $a Neural networks. $3 677449
650 4 $a Equilibrium. $3 668417
650 4 $a Game theory. $3 532607
650 4 $a Design. $3 518875
650 4 $a Expected values. $3 3563993
650 4 $a Artificial intelligence. $3 516317
650 4 $a Mathematics. $3 515831
650 4 $a Transportation. $3 555912
690 $a 0389
690 $a 0800
690 $a 0405
690 $a 0709
710 2 $a University of Pittsburgh. $3 958527
773 0 $t Dissertations Abstracts International $g 83-06B.
790 $a 0178
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28845157