3 citations · 10 across the 24 of their papers we have counts for
6 papers · 1 filter
Online Learning in Periodic Zero-Sum Games
Tanner Fiez, Ryann Sim, Stratis Skoulakis +2
A seminal result in game theory is von Neumann's minmax theorem, which states that zero-sum games admit an essentially unique equilibrium solution. Classical learning results build…
Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update
Georgios Piliouras, Ryann Sim, Stratis Skoulakis
In this paper, we provide a novel and simple algorithm, Clairvoyant Multiplicative Weights Updates (CMWU) for regret minimization in general games. CMWU effectively corresponds to…
Transaction Fees on a Honeymoon: Ethereum's EIP-1559 One Month Later
Daniël Reijsbergen, Shyam Sridhar, Barnabé Monnot +3
Ethereum Improvement Proposal (EIP) 1559 was recently implemented to transform Ethereum's transaction fee market. EIP-1559 utilizes an algorithmic update rule with a constant learn…
On the Approximability of Multistage Min-Sum Set Cover
Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos +2
We investigate the polynomial-time approximability of the multistage version of Min-Sum Set Cover (), a natural and intriguing generalization of the classical List U…
Efficient Online Learning for Dynamic k-Clustering
Dimitris Fotakis, Georgios Piliouras, Stratis Skoulakis
We study dynamic clustering problems from the perspective of online learning. We consider an online learning problem, called \textit{Dynamic -Clustering}, in which centers a…
Dynamical Analysis of the EIP-1559 Ethereum Fee Market
Stefanos Leonardos, Barnabé Monnot, Daniël Reijsbergen +2
Participation in permissionless blockchains results in competition over system resources, which needs to be controlled with fees. Ethereum's current fee mechanism is implemented vi…