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.
Perimeter control schemes proposed to alleviate congestion in large-scale urban networks usually assume perfect knowledge of the accumulation state and inflow demands, both requiring information about the origins and destinations of drivers. Such assumptio ...
To quantify a player's commitment in a given Nash equilibrium of a finite dynamic game, we map the corresponding normal-form game to a "canonical extension," which allows each player to adjust his or her move with a certain probability. The commitment meas ...
We study a robust monopoly pricing problem with a minimax regret objective, where a seller endeavors to sell multiple goods to a single buyer, only knowing that the buyer's values for the goods range over a rectangular uncertainty set. We interpret this pr ...
The "more economic approach" was introduced to antitrust to achieve a more effect-based and theoretically grounded enforcement. However, related to predatory pricing it resulted in systematic over- and under-enforcement: Economic theory does not require do ...
We consider multi-agent decision making, where each agent optimizes its cost function subject to constraints. Agents’ actions belong to a compact convex Euclidean space and the agents’ cost functions are coupled. We propose a distributed payoff-based algor ...
This paper examines a stochastic formulation of the generalized Nash equilibrium problem where agents are subject to randomness in the environment of unknown statistical distribution. We focus on fully distributed online learning by agents and employ penal ...
A linear programming framework is proposed to model distribution network characteristics, and market clearing processes for flexible load and distributed energy resources providing reserve and reactive power compensation. One shows that the Nash equilibriu ...
Newcomb's problem is viewed as a dynamic game with an agent and a superior being as players. Depending on whether or not a risk-neutral agent's confidence in the superior being, as measured by a subjective probability assigned to the move order, exceeds a ...
This work examines a stochastic formulation of the generalized Nash equilibrium problem (GNEP) where agents are subject to randomness in the environment of unknown statistical distribution. Three stochastic gradient strategies are developed by relying on a ...
We study the existence and uniqueness of Nash equilibria for a certain class of aggregative games with finite and possibly large number of players. Sufficient conditions for these are obtained using the theory of variational inequalities together with the ...
