Publications associées (34)

Breaking Blockchain Rationality with Out-of-Band Collusion

Bryan Alexander Ford, Verónica del Carmen Estrada Galiñanes, Louis-Henri Manuel Jakob Merino, Haoqian Zhang, Mahsa Bastankhah

Blockchain systems often rely on rationality assumptions for their security, expecting that nodes are motivated to maximize their profits. These systems thus design their protocols to incentivize nodes to execute the honest protocol but fail to consider ou ...
Cham2024

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

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

Learning to Play Sequential Games versus Unknown Opponents

Maryam Kamgarpour, Andreas Krause, Ilija Bogunovic

We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We seek to design strategies for the learner to successfully interact with the opponent. While most previous approaches consider k ...
Curran Associates, Inc.2020

A disaggregate choice-based approach to find epsilon-equilibria of oligopolistic markets

Michel Bierlaire, Virginie Janine Camille Lurkin, Stefano Bortolomiol

We present a general framework to find epsilon-equilibrium solutions of oligopolistic markets in which demand is modeled at the disaggregate level using discrete choice models. Consumer choices are modeled according to random utility theory, and the choice ...
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

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

A Robust Resolution of Newcomb's Paradox

Thomas Alois Weber

Newcomb's problem is viewed as a dynamic game with an agent and a superior being as players. Depending on whether or not a risk-neutral agent's confidence in the superior being, as measured by a subjective probability assigned to the move order, exceeds a ...
2016

Optimal Retail in a Sharing Economy

Thomas Alois Weber

The emerging sharing economy is fueled by products that some consumers buy new. This paper introduces an overlapping-generations model to analyze consumers' consumption choices and the equilibrium in the sharing market. We derive a retailer's optimal prici ...
IEEE Computer Society, Washington, DC2016

Reachability-based Control Synthesis for Power System Stability

Maryam Kamgarpour

We present a nonlinear reachability framework for control of power system transients. The power system consists of synchronous generators, coupled by transmission lines and controlled HVDC links. The approach consists of characterisation of the region of a ...
2016

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.