Linear program-based approximation for personalized reserve prices
We study the problem of computing data-driven personalized reserve prices in eager
second price auctions without having any assumption on valuation distributions. Here, the …
second price auctions without having any assumption on valuation distributions. Here, the …
DeepFP for finding Nash equilibrium in continuous action spaces
Finding Nash equilibrium in continuous action spaces is a challenging problem and has
applications in domains such as protecting geographic areas from potential attackers. We …
applications in domains such as protecting geographic areas from potential attackers. We …
Lp-based approximation for personalized reserve prices
We study the problem of computing data-driven personalized reserve prices in eager
second price auctions without having any assumption on valuation distributions. Here, the …
second price auctions without having any assumption on valuation distributions. Here, the …
Computing stackelberg equilibria of large general-sum games
We study the computational complexity of finding Stackelberg Equilibria in general-sum
games, where the set of pure strategies of the leader and the followers are exponentially …
games, where the set of pure strategies of the leader and the followers are exponentially …
[PDF][PDF] Deep fictitious play for games with continuous action spaces
Fictitious play has been a classic algorithm to solve two-player adversarial games with
discrete action spaces. In this work we develop an approximate extension of fictitious play to …
discrete action spaces. In this work we develop an approximate extension of fictitious play to …
Blotto on the Ballot: A Ballot Stuffing Blotto Game
We consider the following Colonel Blotto game between parties $ P_1 $ and $ P_A. $$ P_1
$ deploys a non negative number of troops across $ J $ battlefields, while $ P_A $ chooses …
$ deploys a non negative number of troops across $ J $ battlefields, while $ P_A $ chooses …
Discrete Colonel Blotto games with two battlefields
D Liang, Y Wang, Z Cao, X Yang - Available at SSRN 3318291, 2019 - papers.ssrn.com
Abstract The Colonel Blotto Game is one of the most classical zero-sum games, with diverse
applications in wars, auctions, political elections and anti-terrorists etc. We consider the …
applications in wars, auctions, political elections and anti-terrorists etc. We consider the …
Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable
In the classical discrete Colonel Blotto game—introduced by Borel in 1921—two colonels
simultaneously distribute their troops across multiple battlefields. The winner of each …
simultaneously distribute their troops across multiple battlefields. The winner of each …
Campaigning via LPs: solving blotto and beyond
S Seddighin - 2019 - search.proquest.com
The competition between the Republican and the Democrat nominees in the US presidential
election is known as Colonel Blotto in game theory. In the classical Colonel Blotto game …
election is known as Colonel Blotto in game theory. In the classical Colonel Blotto game …
Modern Large-Scale Algorithms for Classical Graph Problems
S Behnezhad - 2021 - search.proquest.com
Although computing power has advanced at an astonishing rate, it has been far outpaced by
the growing scale of data. This has led to an abundance of algorithmic problems where the …
the growing scale of data. This has led to an abundance of algorithmic problems where the …