Distributed computation of Pareto solutions in \(n\)-player games
From MaRDI portal
Publication:1352298
DOI10.1007/BF02592144zbMath0868.90142MaRDI QIDQ1352298
Raimo P. Hämäläinen, Harri Ehtamo, Markku Verkama
Publication date: 13 February 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Noncooperative games (91A10) Computational methods for problems pertaining to game theory, economics, and finance (91-08) Distributed algorithms (68W15)
Related Items (7)
Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation ⋮ Analysis of the constraint proposal method for two-party negotiations ⋮ A distributed computation algorithm for solving portfolio problems with integer variables ⋮ Searching for joint gains in multi-party negotiations. ⋮ Constraint proposal method for computing Pareto solutions in multi-party negotiations ⋮ Decentralized method for computing Pareto solutions in multiparty negotiations ⋮ Comment on a decision support approach for negotiation: Software vs. methodology
Cites Work
- Unnamed Item
- Unnamed Item
- Theory of multiobjective optimization
- Distributed algorithms for the computation of noncooperative equilibria
- Relaxation techniques and asynchronous algorithms for on-line computation of non-cooperative equilibria
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Rational Learning Leads to Nash Equilibrium
- A mathematical programming approach for determining oligopolistic market equilibrium
- Iterative Techniques for the Nash Solution in Quadratic Games with Unknown Parameters
- Distributed Computation of Nash Equilibria in Linear-Quadratic Stochastic Differential Games
- A variational inequality approach for the determination of oligopolistic market equilibrium
This page was built for publication: Distributed computation of Pareto solutions in \(n\)-player games
