Games with Non-Probabilistic Uncertainty
- Author(s): LEE, JI WOONG
- Advisor(s): Walrand, Jean
- et al.
The thesis studies games with non-probabilistic uncertainty about some parameters that affect the rewards of the players. The goal is to understand whether players should be optimistic or pessimistic in such situations.
The first chapter provides a brief overview of the standard solution concepts in Game Theory.
The second chapter proposes a model where the players are strategic in choosing their attitude (degree of optimism), instead of having an intrinsic risk aversion. The idea is that Alice may be able to take advantage of Bob's pessimism, in which case Bob should not be pessimistic. The chapter presents a few examples of two-player non-cooperative games where the agents have a dominant attitude (e.g., optimism), regardless of the unknown private information of the opponent. The chapter also analyses a Cournot duopoly game where each firm has confidential knowledge of its production cost. In the symmetric case, it is shown that pessimism is never a dominant attitude. Finally, the chapter defines a robust attitude and the price of uncertainty, and analyzes them in the Cournot duopoly game.
The third chapter studies a simple wireless network with two relay nodes that cooperate to forward information to a common destination. For a range of success probabilities, only the node with the largest success probability should relay packets to avoid collisions at the destination. However, the success probability of a node is known initially only to that node. To improve the performance of the network, the nodes exchange link state messages through a control channel that is not fully reliable. The chapter studies a protocol where each node tries to protect the performance against the worst possible choice of the other node. The performance of that protocol does not converge as the relays exchange more and more link state messages. Essentially, the relay nodes use an excess of caution. The chapter studies another protocol where each relay node ignores the possible states of knowledge of the other node. The throughput of this less cautious protocol converges to the maximum possible value.