Concept

Jeu de coordination

Publications associées (51)

Analytical and Machine Learning Methods for the Complete Safe Coordination of Astrobot Swarms

The recent generations of massive spectroscopic surveys aim at the ray collection from a multitude of cosmological targets in the course of observations. For this purpose, astrobots are used to change the configuration of optical fibers from one observatio ...

EPFL2021

The Atomic-Level Structure of Cementitious Calcium Aluminate Silicate Hydrate Determined by NMR

David Lyndon Emsley, Pinelopi Moutzouri

We review our recent paper which resolves the long-standing dilemma of the location and nature of the six-fold coordinated aluminum in calcium aluminate silicate hydrate (C-A-S-H) samples. First principles calculations predict that at high Ca:Si and H2O ra ...

SWISS CHEMICAL SOC2021

Mixed Nash Equilibria in the Adversarial Examples Game

Rafaël Benjamin Pinot

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 ...

2021

Bandit Online Learning of Nash Equilibria in Monotone Games

Maryam Kamgarpour

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 ...

2021

The Atomic-Level Structure of Cementitious Calcium Aluminate Silicate Hydrate

David Lyndon Emsley, Karen Scrivener, Paul Bowen, Pierrick Berruyer, Brennan James Walder, Pinelopi Moutzouri, Aslam Kunhi Mohamed, Jirawan Siramanont, Maya Nicole Harris, Mattia Negroni

Despite use of blended cements containing significant amounts of aluminum for over 30 years, the structural nature of aluminum in the main hydration product, calcium aluminate silicate hydrate (C-A-S-H), remains elusive. Using first-principles calculations ...

AMER CHEMICAL SOC2020

No-Regret Learning in Unknown Games with Correlated Payoffs

Maryam Kamgarpour, Andreas Krause, Ilija Bogunovic

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 ...

Curran Associates, Inc.2019

Courtesy As a Means to Coordinate

Boi Faltings, Panayiotis Danassis

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

Quantifying Commitment in Nash Equilibria

Thomas Alois Weber

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 ...

2019

Learning Generalized Nash Equilibria in a Class of Convex Games

Maryam Kamgarpour

We consider multiagent decision making where each agent optimizes its convex cost function subject to individual and coupling constraints. The constraint sets are compact convex subsets of a Euclidean space. To learn Nash equilibria, we propose a novel dis ...

2019

Walrasian Dynamics in Multi-unit Markets

Aris Filos Ratsikas

In a multi-unit market, a seller brings multiple units of a good and tries to sell them to a set of buyers that have monetary endowments. While a Walrasian equilibrium does not always exist in this model, natural relaxations of the concept that retain its ...

AAAI Press Palo Alto2019

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