Cycles in adversarial regularized learning

P Mertikopoulos, C Papadimitriou, G Piliouras - Proceedings of the twenty …, 2018 - SIAM
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 …

Rethinking search engines and recommendation systems: a game theoretic perspective

M Tennenholtz, O Kurland - Communications of the ACM, 2019 - dl.acm.org
Rethinking search engines and recommendation systems: a game theoretic perspective
Page 1 66 COMMUNICATIONS OF THE ACM | DECEMBER 2019 | VOL. 62 | NO. 12 review …

Improved bayes risk can yield reduced social welfare under competition

M Jagadeesan, M Jordan… - Advances in Neural …, 2024 - proceedings.neurips.cc
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 …

Competition, alignment, and equilibria in digital marketplaces

M Jagadeesan, MI Jordan, N Haghtalab - Proceedings of the AAAI …, 2023 - ojs.aaai.org
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 …

Product assortment and price competition under multinomial logit demand

O Besbes, D Sauré - Production and Operations …, 2016 - journals.sagepub.com
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 …

From duels to battlefields: Computing equilibria of Blotto and other games

AM Ahmadinejad, S Dehghani… - Mathematics of …, 2019 - pubsonline.informs.org
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 …

Competing bandits: The perils of exploration under competition

G Aridor, Y Mansour, A Slivkins, S Wu - ACM Transactions on Economics …, 2020 - dl.acm.org
However, weaker competition incentivizes better exploration algorithms and increases
welfare. We investigate two channels for weakening the competition: stochastic user choice …

Risk sensitivity of price of anarchy under uncertainty

G Piliouras, E Nikolova, JS Shamma - ACM Transactions on Economics …, 2016 - dl.acm.org
In game theory, the price of anarchy framework studies efficiency loss in decentralized
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 …

Competing bandits: Learning under competition

Y Mansour, A Slivkins, ZS Wu - arxiv preprint arxiv:1702.08533, 2017 - arxiv.org
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 …