On-line computation of Stackelberg equilibria with synchronous parallel genetic algorithms

On-Line Algorithms for Market Equilibria

We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specifically, we consider on-line algorithms for this problem in which goods are considered on-line, and each good is assigned an irrevocable price. Since exact equilibria will not be found in such a setting, we appeal to the conce...

Analyzing synchronous and asynchronous parallel distributed genetic algorithms

Parallel genetic algorithms (PGAs) have been traditionally used to extend the power of serial GAs, since they often can be tailored to provide a larger efficiency on complex search problems. In a PGA several subalgorithms cooperate in parallel to solve the problem. This high-level definition has leaded to a considerable number of different implementations that preclude direct comparisons and kn...

Algorithms Column: The Computation of Market Equilibria

The market equilibrium problem has a long and distinguished history. In 1874, Walras published the famous “Elements of Pure Economics”, where he describes a model for the state of an economic system in terms of demand and supply, and expresses the supply equals demand equilibrium conditions [62]. In 1936, Wald gave the first proof of the existence of an equilibrium for the Walrasian system, alb...

Direct Bulk-Synchronous Parallel Algorithms

On-Line Adaptive Parallel Prefix Computation

We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower bound for this problem. We introduce a new adaptive algorithm which is based on the on-line recursive coupling of an optimal sequential algorithm and a parallel one, non-optimal but recursive and fine-grain. The coupling relies on ...