Stochastic Switching Games and Duopolistic Competition in Emissions Markets

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Revised version, 24 pages

Scientific paper

We study optimal behavior of energy producers under a CO_2 emission abatement program. We focus on a two-player discrete-time model where each producer is sequentially optimizing her emission and production schedules. The game-theoretic aspect is captured through a reduced-form price-impact model for the CO_2 allowance price. Such duopolistic competition results in a new type of a non-zero-sum stochastic switching game on finite horizon. Existence of game Nash equilibria is established through generalization to randomized switching strategies. No uniqueness is possible and we therefore consider a variety of correlated equilibrium mechanisms. We prove existence of correlated equilibrium points in switching games and give a recursive description of equilibrium game values. A simulation-based algorithm to solve for the game values is constructed and a numerical example is presented.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Stochastic Switching Games and Duopolistic Competition in Emissions Markets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stochastic Switching Games and Duopolistic Competition in Emissions Markets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stochastic Switching Games and Duopolistic Competition in Emissions Markets will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-128157

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.