Novshek's trick as a polynomial algorithm

DOI10.1016/J.DAM.2013.05.031zbMath1302.91004OpenAlexW2014407828MaRDI QIDQ741711

Nikolai S. Kukushkin

Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.05.031

zbMATH Keywords

fixed pointpolynomial algorithmadditive aggregationdecreasing best responses

Mathematics Subject Classification ID

Noncooperative games (91A10) Computational methods for problems pertaining to game theory, economics, and finance (91-08)

Related Items (1)

The Selten–Szidarovszky Technique: The Transformation Part

Cites Work

• Unnamed Item
• Unnamed Item
• Best response dynamics in finite games with additive aggregation
• Strategic complements and substitutes, and potential games
• A fixed-point theorem for decreasing mappings
• Aggregative games and best-reply potentials
• A lattice-theoretical fixpoint theorem and its applications
• On the Existence of Cournot Equilibrium
• Equilibrium Points in Nonzero-Sum n-Person Submodular Games
• Monotone Comparative Statics

This page was built for publication: Novshek's trick as a polynomial algorithm