Distributed computation of Pareto solutions in n-player games

  title={Distributed computation of Pareto solutions in n-player games},
  author={Markku Verkama and Harri Ehtamo and Raimo P. H{\"a}m{\"a}l{\"a}inen},
  journal={Math. Program.},
The problem of computing Pareto optimal solutions with distributed algorithms is considered in n-player games. We shall first formulate a new geometric problem for finding Pareto solutions. It involves solving joint tangents for the players' objective functions. This problem can then be solved with distributed iterative methods, and two such methods are presented. The principal results are related to the analysis of the geometric problem. We give conditions under which its solutions are Pareto… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS
14 Citations
18 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 14 extracted citations


Publications referenced by this paper.
Showing 1-10 of 18 references

Hfimfilfiinen, On distributed computation of Pareto solutions for two decision makers

  • H. Ehtamo, R M. Verkama
  • IEEE Transactions on Systems. Man, and…
  • 1996

and A . L . Soyster , A mathematical programming approach for determining oligopolistic market equilibrium

  • H. D. Sherali Murphy
  • Econontetrica
  • 1993

Decision support for negotiations, PhD

  • J. Teich
  • Dissertation, State University of New York…
  • 1991

Game Theol 3, wi#z Applications to I'2conomics, 2nd ed

  • J. W. Friedman
  • 1991

Distributed computation of Nash equilibria in linear-quadratic stochastic differential games

  • T. Baar, S. Li
  • SIAM Journal on Control at[d Optimization
  • 1989

Distributed relaxation-type algorithms for noncooperative gaines, in: Proceedings of the IE4C Symposiuns on Dynamic Modelling and Control ~[ National Economies

  • T. Baar
  • 1989

Ba~ar, Distributed algorithms for the computation of noncooperative equilibria, Automatica

  • T. S. Li
  • 1987

Similar Papers

Loading similar papers…