In this paper, the optimal adaptive leader-follower consensus of linear continuous time multi-agent systems is considered. The error dynamics of each player depends on its neighbors’ information. Detailed analysis of online optimal leader-follower consensus under known and unknown dynamics is presented. The introduced reinforcement learning-based algorithms learn online the approximate solution...

 In this research UF cheese pricing is considered and Pegah, Pak, Kaleh, Rouzaneh and Mihan firms’ data, as five main UF cheese competitive firms of Iran in breakfast cheese competitive market, is used. By using these firm’s sales data, production data and price of each ton of UF cheese in nineteen work-periods (each work-period is 6 months), their sales equations are estimated for each work-pe...

One of the most critical problems in distributed systems is Leader Failure. Distributed network becomes unstable without leadership. To solve this problem Leader Election algorithm is executed to give the leadership to other processor. The election process starts when one or more processor discovers that leader has failed, and it terminates when the remaining processors know who the new leader ...

What is the meaning of saying that random variables {X(1), em leader, X(n)} (such as aptitude scores or hypothetical response time components), not necessarily stochastically independent, are selectively influenced respectively by subsets {Gamma(1), em leader, Gamma(n)} of a factor set Phi upon which the joint distribution of {X(1), em leader, X(n)} is known to depend? One possible meaning of t...

Freiman’s theorem asserts, roughly speaking, if that a finite set in a torsion-free abelian group has small doubling, then it can be efficiently contained in (or controlled by) a generalised arithmetic progression. This was generalised by Green and Ruzsa to arbitrary abelian groups, where the controlling object is now a coset progression. We extend these results further to solvable groups of bo...

We study a leader election protocol that we call the Swedish leader election protocol. This name comes from a protocol presented by L. Bondesson, T. Nilsson, and G. Wikstrand (2007). The goal is to select one among n > 0 players, by proceeding through a number of rounds. If there is only one player remaining, the protocol stops and the player is declared the leader. Otherwise, all remaining pla...

Many multi-product firms incur a complexity fixed cost when offering different product lines in different quality tiers relative to the case when offering all products lines in the same quality tier (high or low). Such fixed costs create an interdependency between firms’choices of quality tiers across different product lines, even when demands are independent. We investigate the effects of this...

The commonly used asynchronous bounded delay (ABD) network models assume a fixed bound on message delay. We propose a probabilistic network model, called asynchronous bounded expected delay (ABE) model. Instead of a strict bound, the ABE model requires only a bound on the expected message delay. While the conditions of ABD networks restrict the set of possible executions, in ABE networks all as...

In “Can we elect if we cannot compare” (SPAA’03), Barrière, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the labels of the entities are distinct but mutually incomparable. They study the leader election problem in a distributed mobile environment and they wonder whether there exists an algorithm such that for each distributed mobile environment,...