Publication

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

Publications associées (35)

Reaching Correlated Equilibria Through Multi-agent Learning

Boi Faltings, Ludek Cigler

Many games have undesirable Nash equilibria. For exam- ple consider a resource allocation game in which two players compete for an exclusive access to a single resource. It has three Nash equilibria. The two pure-strategy NE are effi- cient, but not fair. ...
2011

Strategy construction for parity games with imperfect information

Laurent Doyen

We consider two-player parity games with imperfect information in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., to determine the winning regions of players and corresponding ...
2010

A union of incoherent spaces model for classification

Pierre Vandergheynst, Karin Schnass

We present a new and computationally efficient scheme for classifying signals into a fixed number of known classes. We model classes as subspaces in which the corresponding data is well represented by a dictionary of features. In order to ensure low miscla ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

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

Strategy Construction for Parity Games with Imperfect Information

Laurent Doyen

We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e. to determine the winning regions of players and corresponding winning strategi ...
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

Spectrum Sharing Games of Infrastructure-Based Cognitive Radio Networks

Jean-Pierre Hubaux, Ghazale Hosseinabadi

The IEEE 802.22 standard is the first proposed standard for the cognitive radio networks in which a set of base stations (BSs) make opportunistic spectrum access to provide wireless access to the customer-premise equipments (CPE) within their cells in wire ...
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

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

Border Games in Cellular Networks

Jean-Pierre Hubaux, Mark Felegyhazi, Mario Cagalj, Diego Dufour

In each country today, cellular networks operate on carefully separated frequency bands. This separation is imposed by the regulators of the given country to avoid interference between these networks. But, the separation is only valid within the borders of ...
2007

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.