Search for maximum points of a vector criterion based on decomposition properties

DOI10.1134/S0081543810060155MaRDI QIDQ643771zbMATH OpenOpenAlexFDO

Authors Nikolaĭ A. Krasovskiĭ, A. M. Tarasyev

Publication date 2 November 2011

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0081543810060155

zbMATH Keywords

dynamic noncooperative gameequilibrium search algorithmsNash equilibriumPareto maximum

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Noncooperative games (91A10) Dynamic games (91A25) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• A decomposition algorithm for finding equilibria in dynamic games
• Analysis of competitive and cooperative solutions in dynamic auction games
• A game model of negotiations and market equilibria
• Adjustment processes for exchange economies and noncooperative games
• scientific article; zbMATH DE number 165423

Cites work

• A cooperative incentive equilibrium for a resource management problem
• scientific article; zbMATH DE number 733955 (Why is no real title available?)
• Ill-posed problems with a priori information
• Learning dynamics in games with stochastic perturbations
• Learning mixed equilibria
• The Prisoner's Dilemma and Dynamical Systems Associated to Non-Cooperative Games

Cited in

(5)

• A game model of negotiations and market equilibria
• Analysis of competitive and cooperative solutions in dynamic auction games
• Proportional economic growth under conditions of limited natural resources
• A decomposition algorithm for finding equilibria in dynamic games
• Asymptotic behavior of solutions in dynamical bimatrix games with discounted indices

This page was built for publication: Search for maximum points of a vector criterion based on decomposition properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643771)