Publication

Border Games in Cellular Networks

Publications associées (21)

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

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

Optimization and equilibrium problems with discrete choice models

Stefano Bortolomiol

Many transportation markets are characterized by oligopolistic competition. In these markets customers, suppliers and regulators make decisions that are influenced by the preferences and the decisions of all other agents. In particular, capturing and under ...

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

Improving Railway Track Coverage with mmWave Bridges: A Measurement Campaign

Ruben Merz, Andreas Peter Burg, Adrian Schumacher

Bringing cellular capacity into modern trains is challenging because they act as Faraday cages. Building a radio frequency (RF) corridor along the railway tracks ensures a high signal-to-noise ratio and limits handovers. However, building such RF corridors ...

ASSOC COMPUTING MACHINERY2021

Informational frictions in financial markets

Erik Hapnes

This thesis consists of three chapters on informational frictions in financial markets. The chapters analyze problems related to markets' ability to guide real investment, and what drives liquidity. Both problems are important to ensure efficient resource ...

EPFL2021

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

Dispatch-aware planning of energy storage systems in active distribution network

Sidi-Rachid Cherkaoui, Mario Paolone, Ji Hyun Yi

This paper proposes a procedure for the optimal siting and sizing of energy storage systems (ESSs) within active distribution networks (ADNs) hosting a large amount of stochastic distributed renewable energy resources. The optimization objective is to mini ...

Elsevier2020

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

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

Walrasian Dynamics in Multi-unit Markets

Aris Filos Ratsikas

In a multi-unit market, a seller brings multiple units of a good and tries to sell them to a set of buyers that have monetary endowments. While a Walrasian equilibrium does not always exist in this model, natural relaxations of the concept that retain its ...

AAAI Press2019

Potentials of Negative Emissions in the Design of Climate Agreements

Alain Haurie, Marc Vielle, Frédéric Louis François Babonneau

The aim of this paper is to explore the long-term relevance of negative emissions for the attainment of Paris agreement goals. For this purpose, we extend a game theoretic meta-model used to assess the future of Paris agreement to the time horizon 2100 and ...

2019

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

Michel Bierlaire, Virginie Janine Camille Lurkin, Stefano Bortolomiol

Oligopolistic competition occurs when a small number of operators compete for the same pool of customers. This is often the case in transportation, due to reasons such as external regulations, economies of scale and limited capacity of the infrastructure. ...

2019

Neural-Network Optimized 1-bit Precoding for Massive MU-MIMO

Christoph Studer, Alexios Konstantinos Balatsoukas Stimming

Base station (BS) architectures for massive multi-user (MU) multiple-input multiple-output (MIMO) wireless systems are equipped with hundreds of antennas to serve tens of users on the same time-frequency channel. The immense number of BS antennas incurs hi ...

IEEE2019

Finding Mixed Nash Equilibria of Generative Adversarial Networks

Volkan Cevher, Ya-Ping Hsieh, Chen Liu

We reconsider the training objective of Generative Adversarial Networks (GANs) from the mixed Nash Equilibria (NE) perspective. Inspired by the classical prox methods, we develop a novel algorithmic framework for GANs via an infinite-dimensional two-player ...

2018

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

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

Resource Allocation for Underlaying Device-to-Device Communications Using Maximal Independent Sets and Knapsack Algorithm

Alper Köse

In this paper, we address the resource allocation problem of device-to-device (D2D) communications underlaying orthogonal frequency division multiple access (OFDMA) based cellular systems by exploiting the efficiency that comes from an ensemble of graph th ...

IEEE2018