Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Complete information

Related publications (12)

An Iterative Adaptive Dynamic Programming Approach for Macroscopic Fundamental Diagram-Based Perimeter Control and Route Guidance

Nikolaos Geroliminis

Macroscopic fundamental diagrams (MFDs) have been widely adopted to model the traffic flow of large-scale urban networks. Coupling perimeter control and regional route guidance (PCRG) is a promising strategy to decrease congestion heterogeneity and reduce ...

Informs2024

Safe multi-agent deep reinforcement learning for joint bidding and maintenance scheduling of generation units

Olga Fink

This paper proposes a safe reinforcement learning algorithm for generation bidding decisions and unit maintenance scheduling in a competitive electricity market environment. In this problem, each unit aims to find a bidding strategy that maximizes its reve ...

2023

Imputation of missing information in worldwide patent data

Gaétan Jean A de Rassenfosse

We present a general method for imputing missing information in the Worldwide Patent Statistical Database (PATSTAT) and make the resulting datasets publicly available. The PATSTAT database is the de facto standard for academic research using patent data. C ...

2021

Data-Driven Inverse Optimization with Incomplete Information

Daniel Kuhn, Peyman Mohajerin Esfahani, Soroosh Shafieezadeh Abadeh, Grani Adiwena Hanasusanto

In data-driven inverse optimization an observer aims to learn the preferences of an agent who solves a parametric optimization problem depending on an exogenous signal. Thus, the observer seeks the agent's objective function that best explains a historical ...

2018

Prolonging the Hide-and-Seek Game: Optimal Trajectory Privacy for Location-Based Services

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Carmela González Troncoso, Reza Shokri

Human mobility is highly predictable. Individuals tend to only visit a few locations with high frequency, and to move among them in a certain sequence reflecting their habits and daily routine. This predictability has to be taken into account in the design ...

2014

Non-Cooperative Location Privacy

Jean-Pierre Hubaux, Julien Freudiger

In mobile networks, authentication is a required primitive for most security protocols. Unfortunately, an adversary can monitor pseudonyms used for authentication to track the location of mobile nodes. A frequently proposed solution to protect location pri ...

Ieee Computer Soc2013

Optimal process plan selection in networked based manufacturing using game-theoretic approach

Naoufel Cheikhrouhou

This paper proposes a scheme for generating optimal process plans for multi jobs in a networked based manufacturing system. Networked manufacturing offers several advantages in the current competitive atmosphere such as reducing short manufacturing cycle t ...

2012

Protecting Location Privacy: Optimal Strategy against Localization Attacks

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Carmela González Troncoso, Reza Shokri

The mainstream approach to protecting the location-privacy of mobile users in location-based services (LBSs) is to alter the users' actual locations in order to reduce the location information exposed to the service provider. The location obfuscation algor ...

2012

Strategy construction for parity games with imperfect information

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

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

Jean-Pierre Hubaux, Julien Freudiger

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

Anypath routing

Henri Julien Dubois-Ferrière

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. A well-known instance is with unreliable wireless links, where the probability that at least one node out ofnreceives a packet increas ...

EPFL2006

The dynamics of mergers and acquisitions

Erwan Morellec

This paper presents a dynamic model of takeovers based on the stock market valuations of merging firms. The model incorporates competition and imperfect information and determines the terms and timing of takeovers by solving option exercise games between b ...

2005