On the probability of correct selection in ordinal comparison over dynamic networks

DOI10.1007/S10957-012-0082-XzbMath1257.90106OpenAlexW2060305031MaRDI QIDQ1935307

Jiaqiao Hu, Hyeong Soo Chang

Publication date: 14 February 2013

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

Full work available at URL: https://doi.org/10.1007/s10957-012-0082-x

zbMATH Keywords

optimizationsimulationdistributed systemconsensusordinal comparison

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Distributed randomized algorithms for probabilistic performance analysis
• Simulation budget allocation for further enhancing the efficiency of ordinal optimization
• A sequential procedure for neighborhood selection-of-the-best in optimization via simulation
• Fast linear iterations for distributed averaging
• Ordinal optimisation and simulation
• On the convergence rate of ordinal comparisons of random variables
• Distributed Subgradient Methods for Multi-Agent Optimization
• Probability Inequalities for Sums of Bounded Random Variables
• Fully sequential indifference‐zone selection procedures with variance‐dependent sampling
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: On the probability of correct selection in ordinal comparison over dynamic networks