Cycles in adversarial regularized learning
Regularized learning is a fundamental technique in online optimization, machine learning,
and many other fields of computer science. A natural question that arises in this context is …
and many other fields of computer science. A natural question that arises in this context is …
Rethinking search engines and recommendation systems: a game theoretic perspective
Rethinking search engines and recommendation systems: a game theoretic perspective
Page 1 66 COMMUNICATIONS OF THE ACM | DECEMBER 2019 | VOL. 62 | NO. 12 review …
Page 1 66 COMMUNICATIONS OF THE ACM | DECEMBER 2019 | VOL. 62 | NO. 12 review …
Improved bayes risk can yield reduced social welfare under competition
As the scale of machine learning models increases, trends such as scaling laws anticipate
consistent downstream improvements in predictive accuracy. However, these trends take the …
consistent downstream improvements in predictive accuracy. However, these trends take the …
Competition, alignment, and equilibria in digital marketplaces
Competition between traditional platforms is known to improve user utility by aligning the
platform's actions with user preferences. But to what extent is alignment exhibited in data …
platform's actions with user preferences. But to what extent is alignment exhibited in data …
Product assortment and price competition under multinomial logit demand
The role of assortment planning and pricing in sha** sales and profits of retailers is well
documented and studied in monopolistic settings. However, such a role remains relatively …
documented and studied in monopolistic settings. However, such a role remains relatively …
From duels to battlefields: Computing equilibria of Blotto and other games
In the well-studied Colonel Blotto game, players must divide a pool of troops among a set of
battlefields with the goal of winning a majority. Despite the importance of this game, only a …
battlefields with the goal of winning a majority. Despite the importance of this game, only a …
Competing bandits: The perils of exploration under competition
However, weaker competition incentivizes better exploration algorithms and increases
welfare. We investigate two channels for weakening the competition: stochastic user choice …
welfare. We investigate two channels for weakening the competition: stochastic user choice …
Risk sensitivity of price of anarchy under uncertainty
In game theory, the price of anarchy framework studies efficiency loss in decentralized
environments. Optimization and decision theory, on the other hand, explore tradeoffs …
environments. Optimization and decision theory, on the other hand, explore tradeoffs …
The mysteries of security games: Equilibrium computation becomes combinatorial algorithm design
H Xu - Proceedings of the 2016 ACM Conference on …, 2016 - dl.acm.org
The security game is a basic model for resource allocation in adversarial environments.
Here there are two players, a defender and an attacker. The defender wants to allocate her …
Here there are two players, a defender and an attacker. The defender wants to allocate her …
Competing bandits: Learning under competition
Most modern systems strive to learn from interactions with users, and many engage in
exploration: making potentially suboptimal choices for the sake of acquiring new information …
exploration: making potentially suboptimal choices for the sake of acquiring new information …