Concept

Jeu de coordination

Publications associées (51)

Crowd Dynamics in Internal Crowdsourcing: Insights From Challenges in Management Higher Education

This article aims to study crowd dynamics in small teams. In particular we are specifically interested to internal crowdsourcing as a venue for innovation and new ideas production, questioning the difference with regard to other cooperative models based, e ...

2019

Finding Mixed Nash Equilibria of Generative Adversarial Networks

Volkan Cevher, Ya-Ping Hsieh, Chen Liu

We reconsider the training objective of Generative Adversarial Networks (GANs) from the mixed Nash Equilibria (NE) perspective. Inspired by the classical prox methods, we develop a novel algorithmic framework for GANs via an infinite-dimensional two-player ...

2018

Exploiting Weak Supermodularity for Coalition-Proof Mechanisms

Maryam Kamgarpour, Orcun Karaca

Under the incentive-compatible Vickrey-Clarke-Groves mechanism, coalitions of participants can influence the auction to obtain higher collective profit. These manipulations were proven to be eliminated if and only if the market objective is supermodular. N ...

IEEE2018

Game theoretic analysis of electricity market auction mechanisms

Maryam Kamgarpour, Orcun Karaca

We consider two prominent mechanisms for the electricity market; the pay-as-bid mechanism, currently applied in certain control reserve markets, and the proposed Vickrey- Clarke-Groves mechanism, an established auction mechanism used in advertising and spe ...

IEEE2017

Overview of the RFX-mod fusion science activity

Yi Zhang, Wilfred Anthony Cooper, Federico Alberto Alfredo Felici, Nicola Vianello, Matteo Vallar, Leonardo Pigatto, Elena Gaio, Alberto Ferro

This paper reports the main recent results of the RFX-mod fusion science activity. The RFX-mod device is characterized by a unique flexibility in terms of accessible magnetic configurations. Axisymmetric and helically shaped reversed-field pinch equilibria ...

Iop Publishing Ltd2017

On aggregative and mean field games with applications to electricity markets

Maryam Kamgarpour, John Lygeros

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

IEEE2016

In a demanding task, three-handed manipulation is preferred to two-handed manipulation

Hannes Bleuler, Mohamed Bouri, Etienne Burdet, Elahe Abdi

Equipped with a third hand under their direct control, surgeons may be able to perform certain surgical interventions alone; this would reduce the need for a human assistant and related coordination difficulties. However, does human performance improve wit ...

Nature Publishing Group2016

Decentralized multi-robot coordination in crowded workspaces

Laleh Makarem

The coordination of multi-robot systems is becoming one of the most important areas of research in robotics, mostly because it is required by numerous complex applications. These applications range from intelligent transportation systems, search and rescue ...

EPFL2015

Symmetric Subgame-Perfect Equilibria in Resource Allocation

Boi Faltings, Ludek Cigler

We analyze symmetric protocols to rationally coordinate on an asymmetric, efficient allocation in an infinitely repeated N-agent, C-resource allocation problems, where the resources are all homogeneous. Bhaskar proposed one way to achieve this in 2-agent, ...

AI Access Foundation2014

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 supergame,” which allows each player to adjust his or her move with a certain probability. The commitment meas ...

EPFL2014

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