Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update

Related publications (21)

About
Privacy
Disclaimer

Graph Chatbot

Equilibria in Network Constrained Energy Markets

We study an energy market composed of producers who compete to supply energy to different markets and want to maximize their profits. The energy market is modeled by a graph representing a constrained power network where nodes represent the markets and lin ...

Elsevier2023

Variational Methods For Continuous-Domain Inverse Problems: the Quest for the Sparsest Solution

Thomas Jean Debarre

The goal of this thesis is to study continuous-domain inverse problems for the reconstruction of sparse signals and to develop efficient algorithms to solve such problems computationally. The task is to recover a signal of interest as a continuous function ...

EPFL2022

Mixed Nash Equilibria in the Adversarial Examples Game

Rafaël Benjamin Pinot

This paper tackles the problem of adversarial examples from a game theoretic point of view. We study the open question of the existence of mixed Nash equilibria in the zero-sum game formed by the attacker and the classifier. While previous works usually al ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2021

A Simulation-Based Heuristic to Find Approximate Equilibria with Disaggregate Demand Models

Michel Bierlaire, Virginie Janine Camille Lurkin, Stefano Bortolomiol

Oligopolistic competition occurs in various transportation markets. In this paper, we introduce a framework to find approximate equilibrium solutions of oligopolistic markets in which demand is modeled at the disaggregate level using discrete choice models ...

INFORMS2021

Visual Focus of Attention Estimation in 3D Scene with an Arbitrary Number of Targets

Jean-Marc Odobez, Rémy Alain Siegfried

Visual Focus of Attention (VFOA) estimation in conversation is challenging as it relies on difficult to estimate information (gaze) combined with scene features like target positions and other contextual information (speaking status) allowing to disambigua ...

IEEE COMPUTER SOC2021

Regret Minimization and Separation in Multi-Bidder Multi-Item Auctions

Daniel Kuhn, Napat Rujeerapaiboon, Cagil Kocyigit

We study a robust auction design problem with a minimax regret objective, where a seller seeks a mechanism for selling multiple items to multiple anonymous bidders with additive values. The seller knows that the bidders' values range over a box uncertainty ...

2024

Numerical methods for structural anomaly detection using model order reduction and data-driven techniques

Caterina Bigoni

The objective of this thesis is to provide a mathematical and computational framework for the proactive maintenance of complex systems with a particular application to structural health monitoring (SHM). SHM techniques rely primarily on sensor responses to ...

EPFL2020

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Ali H. Sayed, Kun Yuan

This paper introduces a new algorithm for consensus optimization in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. All decentralized algorithms rely on communications between adjacent nodes. ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Quantifying Commitment in Nash Equilibria

Thomas Alois Weber

To quantify a player's commitment in a given Nash equilibrium of a finite dynamic game, we map the corresponding normal-form game to a "canonical extension," which allows each player to adjust his or her move with a certain probability. The commitment meas ...

2019

A demand-based optimization approach to find market equilibria in oligopolies

Stefano Bortolomiol

Oligopolistic competition occurs often in transportation as well as in other markets due to reasons such as barriers to entry, limited capacity of the infrastructure and external regulations. In transport oligopolies, suppliers are profit maximizers and ta ...

2019

Page 1 of 3