Scalable Multi-agent Coordination and Resource Sharing
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.
In this chapter, we study the socioeconomic issues that can arise in distributed computing environments such as distributed and open, participatory sensing systems. Due to the decentralized nature of such systems, they present many challenges, some of whic ...
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 ...
A constrained informationally efficient market is defined as one in which the price process arises as the outcome of some equilibrium where agents face restrictions on trade. This paper investigates the case of short sale constraints, a setting which, desp ...
We consider settings where a collective intelligence is formed by aggregating information contributed from many independent agents, such as product reviews, community sensing or opinion polls. To encourage participation and avoid selection bias, agents sho ...
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 ...
This work examines the performance of stochastic sub-gradient learning strategies, for both cases of stand-alone and networked agents, under weaker conditions than usually considered in the literature. It is shown that these conditions are automatically sa ...
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 ...
Dynamic resource assignment is a common problem in multi-agent systems. We consider scenarios in which dynamic agents have preferences about assignments and the resources that can be assigned using online auctions. We study the trade-off between the follow ...
Today’s complex online applications often require the interaction of multiple (web) services that belong to potentially different business entities. Interoperability is a core element of such an environment, yet not a straightforward one due to the lack of ...
This paper introduces a method to design observable directed multi-agent networks, that are: 1) either minimal with respect to a communications-related cost function, or 2) idem, under possible failure of direct communication between two agents. An observa ...
