Publications associées à Perfect information

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

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, Mina Montazeri

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

Exploring policy change through agent-based simulation

Raphaël Klein

Policymaking is a complex process that has been studied using policy process theories almost exclusively. These theories have been built using a large number of qualitative cases. Such methods are useful for theory building but remain limited for theory ex ...

EPFL2021

Wasserstein Distributionally Robust Learning

Soroosh Shafieezadeh Abadeh

Many decision problems in science, engineering, and economics are affected by uncertainty, which is typically modeled by a random variable governed by an unknown probability distribution. For many practical applications, the probability distribution is onl ...

EPFL2020

Three Problems of Liquidity under Asymmetric Information

Sylvain Jean Pascal Carré

This thesis develops models for three problems of liquidity under asymmetric information. In the chapter "Disclosures, Rollover Risk, and Debt Runs" I build a model of dynamic debt runs without perfect information in order to understand the impact of asset ...

EPFL2019

Data-Driven Inverse Optimization with Incomplete Information

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Peyman Mohajerin Esfahani, 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

Belief as a Wise Wager : the Neural Representation of Uncertainty, Surprise and Confidence Across Cognitive and Perceptual Domains

Leyla Loued-Khenissi

From the moment we wake up in the morning to the day's ebb when we settle in to sleep, we are bound to the task of decision-making. Some of these decisions barely register in our consciousness, if at all, while others, less shy, take a more prominent place ...

EPFL2018

Game-theoretic Models of Web Credibility

Karl Aberer

Research on Web credibility assessment can significantly benefit from new models that are better suited for evaluation and study of adversary strategies. Currently employed models lack several important aspects, such as the explicit modeling of Web content ...

ACM2012

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

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

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

Blind Audiovisual Separation based on Redundant Representations

Pierre Vandergheynst, Gianluca Monaci, Rémi Gribonval, Anna Llagostera Casanovas

In this work we present a method to perform a complete audiovisual source separation without need of previous information. This method is based on the assumption that sounds are caused by moving structures. Thus, an efficient representation of audio and vi ...

2008

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

Locating Mobile Nodes with EASE: Learning Efficient Routes from Encounter Histories Alone

Martin Vetterli, Matthias Grossglauser

Routing in large-scale mobile ad hoc networks is challenging because all the nodes are potentially moving. Geographic routing can partially alleviate this problem, as nodes can make local routing decisions based solely on the destinations' geographic coord ...

2006

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