On the probability of correct selection by distributed voting in stochastic optimization

DOI10.1007/S10957-004-1725-3zbMATH Open1097.91030OpenAlexW2051204636MaRDI QIDQ1781871FDOQ1781871

Authors: Niranjan Chakravarthy 

Publication date: 9 June 2005

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-004-1725-3

Recommendations

• scientific article; zbMATH DE number 4050993
• ADVANCES IN DISTRIBUTED OPTIMIZATION USING PROBABILITY COLLECTIVES
• On the Influence of Bias-Correction on Distributed Stochastic Optimization
• A distributed selection algorithm and its expected communication complexity
• scientific article; zbMATH DE number 1149796
• On probabilistic distributed strategies
• Distributed online bandit optimization under random quantization
• Distributed estimation of distribution algorithms for continuous optimization: how does the exchanged information influence their behavior?
• Optimal randomized algorithm for the density selection problem
• Distributed Stochastic Optimization in Networks With Low Informational Exchange

zbMATH Keywords

Distributed algorithms

Mathematics Subject Classification ID

Stochastic programming (90C15) Voting theory (91B12)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems
• On the convergence rate of ordinal comparisons of random variables

Cited In (2)

• A distributed voting scheme to maximize preferences
• On the probability of correct selection in ordinal comparison over dynamic networks

This page was built for publication: On the probability of correct selection by distributed voting in stochastic optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781871)