Campaigning Via LPs: Solving Blotto and Beyond

Simple item page
dc.contributor.advisorHajiaghayi, MohammadTaghien_US
dc.contributor.authorSeddighin, Saeeden_US
dc.contributor.departmentComputer Scienceen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.date.accessioned2019-09-27T05:35:24Z
dc.date.available2019-09-27T05:35:24Z
dc.date.issued2019en_US
dc.description.abstractThe competition between the Republican and the Democrat nominees in the U.S presidential election is known as Colonel Blotto in game theory. In the classical Colonel Blotto game -- introduced by Borel in 1921 -- two colonels simultaneously distribute their troops across multiple battlefields. The outcome of each battlefield is determined by a winner-take-all rule, independently of other battlefields. In the original formulation, the goal of each colonel is to win as many battlefields as possible. The Colonel Blotto game and its extensions have been used in a wide range of applications from political campaigns (exemplified by the U.S presidential election) to marketing campaigns, from (innovative) technology competitions, to sports competitions. For almost a century, there have been persistent efforts for finding the optimal strategies of the Colonel Blotto game, however it was left unanswered whether the optimal strategies are polynomially tractable. In this thesis, we present several algorithms for solving Blotto games in polynomial time and will discuss their applications in practice.en_US
dc.identifierhttps://doi.org/10.13016/cufl-9nms
dc.identifier.urihttp://hdl.handle.net/1903/25001
dc.language.isoenen_US
dc.subject.pqcontrolledComputer scienceen_US
dc.subject.pqcontrolledEconomic theoryen_US
dc.subject.pquncontrolledColonel Blottoen_US
dc.subject.pquncontrolledGame Theoryen_US
dc.subject.pquncontrolledNash Equilibriumen_US
dc.subject.pquncontrolledPolynomial Timeen_US
dc.titleCampaigning Via LPs: Solving Blotto and Beyonden_US
dc.typeDissertationen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Seddighin_umd_0117E_20118.pdf
Size:
4.36 MB
Format:
Adobe Portable Document Format
Download

Collections

UMD Theses and Dissertations
Computer Science Theses and Dissertations