{'fraction_non_alphanumeric': 0.0142602495543672, 'fraction_numerical': 0.0, 'mean_word_length': 5.534883720930233, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On Prize Mechanisms in linear quadratic team theory

A distributed linear quadratic decision problem is considered, where several different controllers act as a team, but with access to different measurements. Previous contributions have shown how to state the optimal synthesis as a finite-dimensional convex optimization problem. This paper shows that the dynamic behavior can be optimized by a distributed iterative procedure, without any need for a globally available model or centralized coordination. An illustrative model with three agents is considered.