On computing nash equilibria of Borel's Colonel Blotto Game for multiple players including in arbitrary measure spaces
Name
1192483337-MIT.pdf
Size
336.31 KB
Format
Adobe PDF
Checksum (MD5)
32ec84a0ccc2e1e9213f18429ab30ef6
Author(s)
Jayanti, Siddhartha Visveswara.
Advisor(s)
Constantinos Daskalakis.
Date Issued
2020
Publisher
Massachusetts Institute of Technology
Abstract
The Colonel Blotto Problem proposed by Borel in 1921 has served as a widely applicable model of budget-constrained simultaneous winner-take-all competitions in the social sciences. Applications include elections, advertising, research and development, ecology and more. However, the classic Blotto problem and variants that have been studied hereto are only about two-player games on a finite set of discrete battlefields. This thesis extends the classic theory to multiplayer games over arbitrary measureable battlegrounds. Furthermore, it characterizes the symmetric mixed Nash equilibria of a wide array of these generalized Blotto games and provides efficient algorithms to sample from these equilibria; thereby unleashing the potential for quantitative analyses of a multitude of new and significant applications, such as multiparty elections and ideological battles across the surface of the earth.
Description
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, May, 2020
Cataloged from the official PDF of thesis.
Includes bibliographical references (pages 65-69).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.
Persistent DSpace Link
