On the Probability of Correct Selection by Distributed Voting in Stochastic Optimization

H. S. Chang
Additional contact information
H. S. Chang: Sogang University

Journal of Optimization Theory and Applications, 2005, vol. 125, issue 1, No 12, 240 pages

Abstract: Abstract This note presents a lower bound on the probability of correct selection for a weighted plurality voting with a single sample performance in approximately solving stochastic optimization problems. It is shown that the lower bound increases exponentially with the number of distributed sampling agents under some condition.

Keywords: Distributed algorithms; voting; stochastic optimization (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-004-1725-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:125:y:2005:i:1:d:10.1007_s10957-004-1725-3

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-004-1725-3

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().