Collusive game solutions via optimization

DOI10.1007/s10107-005-0622-3zbMath1093.90042MaRDI QIDQ2576729

Yanyan Li

Publication date: 14 December 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0622-3

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

91A10: Noncooperative games

90C26: Nonconvex programming, global optimization

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

91A20: Multistage and repeated games

Related Items

Error bounds of regularized gap functions for nonsmooth variational inequality problems, Regularized gap functions for nonsmooth variational inequality problems, D-gap functions for nonsmooth variational inequality problems

Uses Software

• AMPL
• PATH Solver

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Modeling Language for Mathematical Programming
• An extension of the Nash bargaining problem and the Nash social welfare function
• Convex extensions and envelopes of lower semi-continuous functions
• Evaluating individual market power in electricity markets via agent-based simulation
• The Nash program: Non-convex bargaining problems
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• DC programming: overview.
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• The Bargaining Problem
• Inefficiency of Nash Equilibria
• A Theory of Exit in Duopoly
• Collusion in Multiproduct Oligopoly Games under a Finite Horizon
• The Determination of Price and Output Quotas in a Heterogeneous Cartel
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• The Theory of Max-Min, with Applications