Stochastic pairwise preference convergence in Bayesian agents
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
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 ...
The collective dynamic behavior of large groups of interacting autonomous agents (swarms) have inspired much research in both fundamental and engineering sciences. It is now widely acknowledged that the intrinsic nonlinearities due to mutual interactions c ...
In this paper we analyse transition towards circular economy as a complex adaptive system focusing on the market and behavioural barriers. We investigate the conditions for successful introduction of a new production which is appropriate for a circular eco ...
This thesis addresses challenges in elicitation and aggregation of crowd information for settings where an information collector, called center, has a limited knowledge about information providers, called agents. Each agent is assumed to have noisy private ...
In many scenarios of interest, agents may only have access to partial information about an unknown model or target vector. Each agent may be sensing only a subset of the entries of a global target vector, and the number of these entries can be different ac ...
In this paper we demonstrate how agent-based modelling can be used to understand the emergence of a new infrastructure system, more specifically, a biogas infrastructure in the Netherlands. The innovative element in our modelling approach is the use of MAI ...
We consider an adaptive network made of interconnected agents engaged in a binary decision task. It is assumed that the agents cannot deliver full-precision messages to their neighbors, but only binary messages. For this scenario, a modified version of the ...
We examine the behavior of multiagent networks where information-sharing is subject to a positive communications cost over the edges linking the agents. We consider a general mean-square-error formulation, where all agents are interested in estimating the ...
We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network in which the agents communicate with their neighbors and perform local computation. In the proposed algorithm, each agent can compute and comm ...
In this paper, we present a distributed control strategy, enabling agents to converge onto and travel along a consensually selected curve among a class of closed planar curves. Individual agents identify the number of neighbors within a finite circular sen ...
