Publication

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

Publications associées (60)

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

On the Optimal Placement of Mix Zones

Jean-Pierre Hubaux, Julien Freudiger, Reza Shokri

In mobile wireless networks, third parties can track the location of mobile nodes by monitoring the pseudonyms used for identification. A frequently proposed solution to protect the location privacy of mobile nodes suggests to change pseudonyms in regions ...

Springer2009

Self-Organized Anonymous Authentication in Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Julien Freudiger, Maxime Raya

Pervasive communications bring along new privacy challenges, fueled by the capability of mobile devices to communicate with, and thus "sniff on", each other directly. We design a new mechanism that aims at achieving location privacy in these forthcoming mo ...

2009

A Distortion-based Metric for Location Privacy

Jean-Pierre Hubaux, Murtuza Jadliwala, Julien Freudiger, Reza Shokri

We propose a novel framework for measuring and evaluating location privacy preserving mechanisms in mobile wireless networks. Within this framework, we first present a formal model of the system, which provides an efficient representation of the network us ...

2009

A Hamilton-Jacobi Formulation for Cooperative Control of Multi-Agent Systems

Denis Gillet, Sylvain Rudaz, Hajir Roozbehani

Coordination of autonomous non-point agents is studied in this work. Interactions between vehicles together with their internal dynamics have been modeled as a continuous, unconstrained differential game. In particular, collision prediction is shown to be ...

2009

Alpaga: A Tool for Solving Parity Games with Imperfect Information

Laurent Doyen

Alpaga is a solver for two-player parity games with imperfect information. Given the description of a game, it determines whether the first player can ensure to win and, if so, it constructs a winning strategy. The tool provides a symbolic implementation o ...

2009

Evolving Teams of Cooperating Agents for Real-Time Strategy Game

Pawel Lichocki

We apply gene expression programing to evolve a player for a real-time strategy (RTS) video game. The paper describes the game, evolutionary encoding of strategies and the technical implementation of experimental framework. In the experimental part, we com ...

Springer-Verlag2009

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

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

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

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