Publication

Quantifying Commitment in Nash Equilibria

Publications associées (51)

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.

Connectez-vous pour utiliser Chat avec Graph Search

Comparative study of ecohydrological streamflow probability distributions

Andrea Rinaldo, Enrico Bertuzzo, Serena Ceola, Gianluca Botter

We run a comparative study of ecohydrological models of streamflow probability distributions (pdfs), p(Q), derived by Botter et al. (2007a, 2009), against field data gathered in different hydrological contexts. Streamflows measured in several catchments ac ...

American Geophysical Union2010

Predicting Usefulness of Measuring Structures during Load Tests

Ian Smith, James-Alexandre Goulet

This paper presents an approach for model identifiability that builds upon recent research into measurement data interpretation. The objective of this approach is to determine probabilistically to what degree the number of models able to explain a measured ...

2010

Multitype Contact Process on Z: Extinction and Interface

Daniel Rodrigues Valesin

We consider a two-type contact process on Z in which both types have equal finite range and supercritical infection rate. We show that a given type becomes extinct with probability 1 if and only if, in the initial configuration, it is confined to a finite ...

2010

On Non-cooperative Location Privacy: A Game-theoretic Analysis

Jean-Pierre Hubaux, Julien Freudiger, David C. Parkes

In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudonyms used for authentication. A frequently proposed solution to protect locat ...

2009

A quasi-dynamic capacity constrained frequency-based transit assignment model

This paper presents a first approach to dynamic frequency-based transit assignment. As such the model aims to close the gap between schedule-based and frequency-based models. Frequency-based approaches have some advantages compared to schedule-based models ...

Elsevier2008

Fountain codes for piecewise stationary channels

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel s ...

IEEE2008

Annotations of maps in collaborative work at a distance

Mauro Cherubini

This thesis inquires how map annotations can be used to sustain remote collaboration. Maps condense the interplay of space and communication, solving linguistic references by linking conversational content to the actual places to which it refers. This is a ...

EPFL2008

An integrated adaptive model for overheating risk prediction

Darren Robinson, Frédéric Haldi

Based on the results from a field survey campaign, this article describes three new developments which have been integrated to provide a comprehensive basis for the evaluation of overheating risk in offices. Firstly, a set of logistic regression equations ...

2008

Game Theoretic Considerations for the Gaussian Multiple Access Channel

Bixio Rimoldi, Vojislav Gajic

We study the behavior of users in a classical Additive White Gaussian Noise Multiple Access Channel. We model users as rational entities whose only interest is to maximize their own communication rate, and we model their interaction as a noncooperative one ...

2008

Stochastic limit-average games are in EXPTIME

The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within e in time exponential in a polynomial in the size of the game times polynomial in logarithmic in 1/epsilon, for all epsilon > 0. ...

2008