Robust Distributed Averaging: When are Potential-Theoretic Strategies Optimal?
نویسندگان
چکیده
منابع مشابه
When are Distributed Algorithms Robust?
In recent years, numerous distributed algorithms have been proposed which, when executed by a team of dynamic agents, result in the completion of a joint task. However, for any such algorithm to be practical, one should be able to guarantee that the task is still satisfactorily executed even when agents fail to communicate with others or to perform their designated actions correctly. In this pa...
متن کاملWhen are Static Superhedging Strategies Optimal?
This paper deals with the superhedging of derivatives on incomplete markets, i.e. with portfolio strategies which generate payoffs at least as high as that of a given contingent claim. The simplest solution to this problem is in many cases a static superhedge, i.e. a buy-and-hold strategy generating an affine-linear payoff. We study whether a superhedge can be achieved with less initial capital...
متن کاملOptimal Finite-Time Distributed Linear Averaging
A new optimal finite-time distributed linear averaging (OFTDLA) problem is presented in this paper. This problem is motivated from the distributed averaging problem which arises in the context of distributed algorithms in computer science and coordination of groups of autonomous agents in engineering. The aim of the OFTDLA problem is to compute the average of the initial values in finite-time s...
متن کاملAssessing proarrhythmic potential of drugs when optimal studies are infeasible.
Assessing the potential for a new drug to cause life-threatening arrhythmias is now an integral component of premarketing safety assessment. International Conference on Harmonization of Technical Requirements for Registration of Pharmaceuticals for Human Use Guideline (ICH) E14 recommends the "Thorough QT Study" (TQT) to assess clinical QT risk. Such a study calls for careful evaluation of drug...
متن کاملWhen Are Welfare Guarantees Robust?
Computational and economic results suggest that social welfare maximization and combinatorial auction design are much easier when bidders’ valuations satisfy the “gross substitutes” condition. The goal of this paper is to evaluate rigorously the folklore belief that the main take-aways from these results remain valid in settings where the gross substitutes condition holds only approximately. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2016
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2015.2477904