Publications related to Finding Mixed Nash Equilibria of Generative Adversarial Networks

Related publications (28)

A gentle introduction and tutorial on Deep Generative Models in transportation research

Deep Generative Models (DGMs) have rapidly advanced in recent years, becoming essential tools in various fields due to their ability to learn data distributions and generate synthetic data. Their importance in transportation research is increasingly recogn ...

2025

Optimal matching for ridesharing systems with endogenous and flexible user participation

Nikolaos Geroliminis, Zhenyu Yang

The performance of ridesharing systems is intricately entwined with user participation. To characterize such interplay, we adopt a repeated multi-player, non-cooperative game approach to model a ridesharing platform and its users’ decision-making. Users re ...

2025

Neuroscience-inspired computer vision and language modeling for behavior analysis

Shaokai Ye

Measuring animal behaviors is a crucial task in a range of scientific applications. Modern approaches with deep neural networks calls for developing solutions that solve a wide range of vision and language tasks. This ubiquitous need for understanding beha ...

EPFL2025

One-Pass Generation of Multivariate Time Series through Conditional Multivariate Modeling

Florent Evariste Forest

In recent years, exploring deep generative models for generating time series has garnered significant interest within the research community. These models have found wide-ranging applications in areas such as data augmentation, scenario simulation, and the ...

Institute of Electrical and Electronics Engineers Inc.2024

Label-Efficient Deep Learning Methods for Event Detection, Object Segmentation and Cell Tracking in Biological Microscopy Images

Benjamin Tobias Gallusser

Microscopy is one of the essential tools to quantify and advance our understanding of living systems. Modern digital microscopes enable measurements at unprecedented spatiotemporal scale, so automated processing methods are required to complete tasks such ...

EPFL2024

Equilibria in Network Constrained Energy Markets

Leonardo Massai

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

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

Efstratios Panteleimon Skoulakis

In this paper we provide a novel and simple algorithm, Clairvoyant Multiplicative Weights Updates (CMWU), for convergence to \textit{Coarse Correlated Equilibria} (CCE) in general games. CMWU effectively corresponds to the standard MWU algorithm but where ...

2022

Essays in Empirical Asset Pricing

Alexis Arilès Marchal

This thesis consists of three applications of machine learning techniques to empirical asset pricing. In the first part, which is co-authored work with Oksana Bashchenko, we develop a new method that detects jumps nonparametrically in financial time series ...

EPFL2022

Quantum Convolutional Circuits For Earth Observation Image Classification

Su Yeon Chang

The amount of study on Quantum Machine Learning (QML) is increasing extensively due to its potential advantages in terms of representational power and computational resources. These advances suggest a possibility to extend its usage into the context of Ear ...

IEEE2022

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

Robust Multidimensional Pricing: Separation without Regret

Daniel Kuhn, Napat Rujeerapaiboon, Cagil Kocyigit

We study a robust monopoly pricing problem with a minimax regret objective, where a seller endeavors to sell multiple goods to a single buyer, only knowing that the buyer's values for the goods range over a rectangular uncertainty set. We interpret this pr ...

2022

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

On Risk Reduction in Kelly Betting Using the Conservative Expected Value

Daniel Kuhn, Napat Rujeerapaiboon

The celebrated Kelly betting strategy guarantees, with probability one, higher long-run wealth than any other causal investment strategy. However, on the way to its long-term supremacy, this strategy has a notable downfall: it typically displays high varia ...

2018

Defect segmentation for multi-illumination quality control systems

Pascal Fua, Engin Türetken, Siavash Arjomand Bigdeli, David Honzátko

Thanks to recent advancements in image processing and deep learning techniques, visual surface inspection in production lines has become an automated process as long as all the defects are visible in a single or a few images. However, it is often necessary ...

2021

Symmetric Subgame-Perfect Equilibria in Resource Allocation

Boi Faltings, Ludek Cigler

We analyze symmetric protocols to rationally coordinate on an asymmetric, efficient allocation in an infinitely repeated N-agent, C-resource allocation problems, where the resources are all homogeneous. Bhaskar proposed one way to achieve this in 2-agent, ...

AI Access Foundation2014

A Continuum of Commitment

Thomas Alois Weber

We examine a generic three-stage game for two players with alternating moves, where the first player can choose the level of adjustment cost to be paid in the last period to modify the action she announced in the first period. In the resulting continuum of ...

2014

Convergence without Convexity: Sampling, Optimization, and Games

Ya-Ping Hsieh

Many important problems in contemporary machine learning involve solving highly non- convex problems in sampling, optimization, or games. The absence of convexity poses significant challenges to convergence analysis of most training algorithms, and in some ...

EPFL2020

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

Multi-Agent Learning for Resource Allocation Problems

Ludek Cigler

We analyze resource allocation problems where N independent agents want to access C resources. Each resource can be only accessed by one agent at a time. In order to use the resources efficiently, the agents need to coordinate their access. We focus on dec ...

EPFL2013

Distributional Robustness in Mechanism Design

Cagil Kocyigit

Mechanism design theory examines the design of allocation mechanisms or incentive systems involving multiple rational but self-interested agents and plays a central role in many societally important problems in economics. In mechanism design problems, agen ...

EPFL2020