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

DOI10.1134/S0081543810060155zbMATH Open1233.91011OpenAlexW1985072543MaRDI QIDQ643771FDOQ643771

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

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

zbMATH Keywords

Nash equilibriumdynamic noncooperative gameequilibrium search algorithmsPareto maximum

Mathematics Subject Classification ID

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

Cites Work

• Learning mixed equilibria
• Title not available (Why is that?)
• A cooperative incentive equilibrium for a resource management problem
• Ill-posed problems with a priori information
• The Prisoner's Dilemma and Dynamical Systems Associated to Non-Cooperative Games
• Learning dynamics in games with stochastic perturbations

Cited In (4)

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

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)