Search results for "Consensus algorithm"

showing 2 items of 12 documents

Convergence Analysis of Distributed Set-Valued Information Systems

2016

This paper focuses on the convergence of information in distributed systems of agents communicating over a network. The information on which the convergence is sought is not rep- resented by real numbers, as often in the literature, rather by sets. The dynamics of the evolution of information across the net- work is accordingly described by set-valued iterative maps. While the study of convergence of set-valued iterative maps is highly complex in general, this paper focuses on Boolean maps, which are comprised of arbitrary combinations of unions, intersections, and complements of sets. For these important class of systems, we provide tools to study both global and local convergence. A distr…

boolean dynamic systems0209 industrial biotechnologyClass (set theory)Geographic information systemTheoretical computer scienceBinary encoding boolean dynamic systems con- sensus algorithms convergence cooperative systems distributed information systems set-valued dynamic maps.consensus algorithms02 engineering and technologyBoolean algebraSet (abstract data type)symbols.namesakecooperative systems020901 industrial engineering & automationSettore ING-INF/04 - AutomaticaConvergence (routing)0202 electrical engineering electronic engineering information engineeringInformation systemElectrical and Electronic EngineeringMathematicsReal numberconvergencebusiness.industryset-valued dynamic mapsComputer Science Applications1707 Computer Vision and Pattern Recognitiondistributed information systemsComputer Science ApplicationsLocal convergenceControl and Systems EngineeringsymbolsBinary encoding; boolean dynamic systems; consensus algorithms; convergence; cooperative systems; distributed information systems; set-valued dynamic maps; Electrical and Electronic Engineering; Control and Systems Engineering; Computer Science Applications1707 Computer Vision and Pattern RecognitionBinary encoding020201 artificial intelligence & image processingbusinessIEEE Transactions on Automatic Control
researchProduct

Distributed n-player approachability via time and space average consensus

2012

Abstract In this paper we consider repeated coalitional games with transferable utilities (TU) over networks. Namely, we consider a set of n players that have to distribute among themselves a vector of rewards (one for each player). In our network version there is no coordinator allocating the rewards, but the agents have to agree on a common time-averaged vector by updating the local estimates of the reward vector. The common time-averaged reward vector has to approach a suitable constraint set, called core of the game, that guarantees that no agents benefit from quitting the grand coalition. We propose a doubly (over time and space) averaging distributed algorithm. At every iteration, eac…

game theoryComputer Science::Computer Science and Game TheoryMathematical optimizationSpacetimeReward-based selectionconsensus algorithmsGeneral Medicinecontrol optimization game theoryApproachabilitySet (abstract data type)Constraint (information theory)Core (game theory)Order (business)Distributed algorithmnetwork systemMathematicsIFAC Proceedings Volumes
researchProduct