Solving oligopolistic equilibrium problems with convex optimization
European Journal of Operational Research(2020)
摘要
•General approach to solve imperfect partial equilibrium problems as convex optimization problems.•Construct convex problems with identical Karush–Kuhn–Tucker conditions as a Cournot oligopoly.•The approach generalizes to conjectural variation models, stochastic models, etc.•Dramatic reductions in both model development and solution times.•Solve partial equilibrium models orders of magnitude faster than the state-of-the-art.
更多查看译文
关键词
Convex programming,Partial equilibrium problems,Complementarity problems,Cournot oligopoly,Conjectural variation
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要