Concept

Sequential game

Related publications (10)

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

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

Online Submodular Resource Allocation with Applications to Rebalancing Shared Mobility Systems

Maryam Kamgarpour, Andreas Krause, Ilija Bogunovic

Motivated by applications in shared mobility, we address the problem of allocating a group of agents to a set of resources to maximize a cumulative welfare objective. We model the welfare obtainable from each resource as a monotone DR-submodular function w ...

PMLR2021

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

Deep Convolutional Neural Network for Ultrasound Image Enhancement

Jean-Philippe Thiran, Dimitris Perdios, Marcel Arditi, Adrien Besson, Florian Martinez, Manuel Vonlanthen

The problem of improving image quality in ultrafast ultrasound (US) imaging by means of regularized iterative algorithms has raised a vast interest in the US community. These approaches usually rely on standard image processing priors, such as wavelet spar ...

IEEE2018

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

Modeling an America's Cup Regatta as a Sequential Stochastic Game

Jean-Benoît Rossel

The main objective of this thesis is to model a regatta in the America’s Cup, and more precisely the first leg of the race, where the two competing sailboats have to move upwind. During the race, each crew attempts to be the first to reach the end of this ...

EPFL2013

Non-cooperative behavior in wireless networks

Mark Felegyhazi

Existing cellular networks are centrally managed and require a tremendous initial investment. With the advancement of new wireless technologies, the operators of traditional networks have to face new competition. New technologies make it possible to provid ...

EPFL2007

A Budget-balanced, Incentive-compatible Scheme for Social Choice

Boi Faltings

Many practical scenarios involve solving a social choice problem: a group of self-interested agents have to agree on an outcome that best fits their combined preferences. We assume that each outcome presents a certain utility to an agent and that the best ...

Springer2005

Toward a Formal Model of Fair Exchange, a Game Theoretic Approach

Jean-Pierre Hubaux, Levente Buttyan

A fair exchange protocol is a protocol, in which two (or more) mutually suspicious parties exchange their digital items in a way that neither party can gain an advantage over the other by misbehaving. Many fair exchange protocols have been proposed in the ...

2000

Toward a Formal Model of Fair Exchange - a Game Theoretic Approach

Jean-Pierre Hubaux, Levente Buttyan

2000

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.