Show simple item record

dc.contributor.advisorEksin, Ceyhun
dc.creatorSezer, Furkan
dc.date.accessioned2023-10-12T13:53:28Z
dc.date.available2023-10-12T13:53:28Z
dc.date.created2023-08
dc.date.issued2023-06-07
dc.date.submittedAugust 2023
dc.identifier.urihttps://hdl.handle.net/1969.1/199804
dc.description.abstractInformation design in an incomplete information game involves a designer that influences players’ actions through signals generated from a designed probability distribution to optimize its objective function. For quadratic objective functions, if players have quadratic payoffs that depend on players’ actions and an unknown payoff-relevant state, and signals on the state that follow a Gaussian distribution conditional on the state realization (LQG game), the information design problem is a semi-definite program (SDP). The doctoral research is pursued in three thrusts: analytical and numerical characterization of optimal information design to maximize social welfare and the agreement among players’ action in LQG games, analysis of individual information preferences of agents in LQG network games, and robust optimal information design in LQG games under perturbed utilities. Firstly, it is shown that full information disclosure maximizes social welfare under common payoff state, under homogeneous payoff dependencies, or under public signals. When the objective is to maximize agreement among players’ actions, no information disclosure is optimal. Under joint objective, full information optimality condition on weight of agreement is determined for public information structures and common payoffs. In the second thrust, conditions for which rational agents are expected to benefit from full information are characterized in general network games. In star networks, the central agent benefits more than a peripheral agent from full information unless the competition is strong and the number of peripheral agents is small enough. Numerical simulations of ex-post preferences showed that a risk-averse central agent may prefer no information under strong competition. In the third thrust, we consider the setting where the designer has partial information about players’ payoffs. We develop robust convex programs considering the worst-case realization of players’ payoffs under general perturbations. We obtain optimality conditions of no and full information disclosure based on uncertainty set radius and perturbation shifts under ellipsoid uncertainty. Numerical experiments show that the designer is inclined to reveal less informative signals as its uncertainty about the game increases.
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.subjectInformation Design
dc.subjectConvex Optimization
dc.subjectGame Theory
dc.titleInformation Design in Linear-Quadratic-Gaussian Games
dc.typeThesis
thesis.degree.departmentIndustrial and Systems Engineering
thesis.degree.disciplineIndustrial Engineering
thesis.degree.grantorTexas A&M University
thesis.degree.nameDoctor of Philosophy
thesis.degree.levelDoctoral
dc.contributor.committeeMemberVelez, Rodrigo
dc.contributor.committeeMemberGarcia, Alfredo
dc.contributor.committeeMemberGeunes, Joseph
dc.type.materialtext
dc.date.updated2023-10-12T13:53:29Z
local.etdauthor.orcid0000-0002-5839-7878


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record