Symmetric Subgame-Perfect Equilibria in Resource Allocation
Publications associées (38)
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.
In this paper we provide a novel and simple algorithm, Clairvoyant Multiplicative Weights Updates (CMWU), for convergence to \textit{Coarse Correlated Equilibria} (CCE) in general games. CMWU effectively corresponds to the standard MWU algorithm but where ...
We address online bandit learning of Nash equilibria in multi-agent convex games. We propose an algorithm whereby each agent uses only obtained values of her cost function at each joint played action, lacking any information of the functional form of her c ...
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 ...
Oligopolistic competition occurs in various transportation markets. In this paper, we introduce a framework to find approximate equilibrium solutions of oligopolistic markets in which demand is modeled at the disaggregate level using discrete choice models ...
Oligopolistic competition occurs often in transportation as well as in other markets due to reasons such as barriers to entry, limited capacity of the infrastructure and external regulations. In transport oligopolies, suppliers are profit maximizers and ta ...
In this paper, we introduce a model of a financial market as a multiagent repeated game where the players are market makers. We formalize the concept of market making and the parameters of the game. Our main contribution is a framework that combines game t ...
We investigate the problem of multi-agent coordination under rationality constraints. Specifically, role allocation, task assignment, resource allocation, etc. Inspired by human behavior, we propose a framework (CA^3NONY) that enables fast convergence to e ...
International Foundation for Autonomous Agents and Multiagent Systems2019
The celebrated Kelly betting strategy guarantees, with probability one, higher long-run wealth than any other causal investment strategy. However, on the way to its long-term supremacy, this strategy has a notable downfall: it typically displays high varia ...
This paper tackles the problem of adversarial examples from a game theoretic point of view. We study the open question of the existence of mixed Nash equilibria in the zero-sum game formed by the attacker and the classifier. While previous works usually al ...
We consider the problem of learning to play a repeated multi-agent game with an unknown reward function. Single player online learning algorithms attain strong regret bounds when provided with full information feedback, which unfortunately is unavailable i ...