A Note on Solving Discretely-Constrained Nash-Cournot Games via Complementarity

29 Feb 2020  ·  Papageorgiou Dimitri J., Trespalacios Francisco, Harwood Stuart ·

Discretely-constrained Nash-Cournot games have attracted attention as they arise in various competitive energy production settings in which players must make one or more discrete decisions. Gabriel et al. ["Solving discretely-constrained Nash-Cournot games with an application to power markets." Networks and Spatial Economics 13(3), 2013] claim that the set of equilibria to a discretely-constrained Nash-Cournot game coincides with the set of solutions to a corresponding discretely-constrained mixed complementarity problem. We show that this claim is false.

PDF Abstract
No code implementations yet. Submit your code now

Tasks


Datasets


  Add Datasets introduced or used in this paper

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods


No methods listed for this paper. Add relevant methods here