Analysis of competitive and cooperative solutions in dynamic auction games

DOI10.1007/978-3-030-23699-1_5MaRDI QIDQ2008300zbMATH OpenOpenAlexFDO

Authors Nikolay A. Krasovskii, A. M. Tarasyev

Publication date 25 November 2019

Full work available at URL https://doi.org/10.1007/978-3-030-23699-1_5

zbMATH Keywords

decomposition search algorithmdynamic gamesNash equilibriumPareto maximum

Mathematics Subject Classification ID

Dynamic games (91A25) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• A decomposition algorithm for finding equilibria in dynamic games
• Search for maximum points of a vector criterion based on decomposition properties
• Mechanism for shifting Nash equilibrium trajectories to cooperative Pareto solutions in dynamic bimatrix games
• Set of Nash-type equilibria in auction-type games
• Algorithmic Applications in Management

Cited in

(8)

• A decomposition algorithm for finding equilibria in dynamic games
• Analysis of a class of decentralized dynamical systems: rapid convergence and efficiency of dynamical quantized auctions
• scientific article; zbMATH DE number 5788419 (Why is no real title available?)
• Game theoretic analysis of maximum cooperative purchasing situations
• Mechanism for shifting Nash equilibrium trajectories to cooperative Pareto solutions in dynamic bimatrix games
• Coasian dynamics in repeated English auctions
• Analysis of Decentralized Quantized Auctions on Cooperative Networks
• Search for maximum points of a vector criterion based on decomposition properties

This page was built for publication: Analysis of competitive and cooperative solutions in dynamic auction games

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