This paper addresses the possibility of capacity withholding by energy producers, who seek to increase the market price and their own profits. The energy market is simulated as an iterative game, where each state game corresponds to an hourly energy auction with uniform pricing mechanism. The producers are modeled as agents that interact with their environment through reinforcement learning (RL...

Strategic bidding in joint energy and spinning reserve markets is a challenging task from the viewpoint of generation companies (GenCos). In this paper, the interaction between energy and spinning reserve markets is modeled considering a joint probability density function for the prices of these markets. Considering pay-as-bid pricing mechanism, the bidding problem is formulated and solved as a...

This paper represents a complete survey on Generation Companies’ (GenCos’) optimal bidding strategy problem in restructured power markets. In this regard after an introduction to competitive electricity markets, concept of optimal bidding strategy is presented. Considering large amount of works accomplished in this area a novel classification is implemented in order to categorize the existing d...

In this paper, the German electricity wholesale market is modeled by individual profit maximizing agents. The agents use a learning approach called “model predictive bidding” to choose bidding curves for the upcoming day which are sent to the spot market. The chosen bidding curves thereby maximize the agents’ expected discounted profits. In contrast to traditional agent learning approaches such...

Unlike perfect competitive markets, in oligopoly electricity markets due to strategic producers and transmission constraints GenCos may increase their own profit through strategic biddings. This paper investigates the problem of developing optimal bidding strategies of GenCos considering participants’ market power and transmission constraints. The problem is modeled as a bi-level optimizati...

Market-based mechanisms such as auctions are being studied as an appropriate means for resource allocation in distributed and multiagent decision problems. When agents value resources in combination rather than in isolation, they must often deliberate about appropriate bidding strategies for a sequence of auctions offering resources of interest. We briefly describe a discrete dynamic programmin...

We consider competition between sellers offering similar items in concurrent online auctions, where each seller must set its individual auction parameters (such as the reserve price) in such a way as to attract buyers. We show that there exists a pure Nash equilibrium in the case of two sellers with asymmetric production costs. In addition, we show that, rather than setting a reserve price, a s...