Composite auction method for suppressing unreasonable electricity price spikes in a competitive electricity market

The existence of undesirable electricity price spikes in a competitive electricity market requires an efficient auction mechanism. However, many of the existing auction mechanism have difficulties in suppressing such unreasonable price spikes effectively. A new auction mechanism is proposed to suppress effectively unreasonable price spikes in a competitive electricity market. It optimally combines system marginal price auction and pay as bid auction mechanisms. A threshold value is determined to activate the switching between the marginal price auction and the proposed composite auction. Basically when the system marginal price is higher than the threshold value, the composite auction for high price electricity market is activated. The winning electricity sellers will sell their electricity at the system marginal price or their own bid prices, depending on their rights of being paid at the system marginal price and their offers' impact on suppressing undesirable price spikes. Such economic stimuli discourage sellers from practising economic and physical withholdings. Multiple price caps are proposed to regulate strong market power. We also compare other auction mechanisms to highlight the characteristics of the proposed one. Numerical simulation using the proposed auction mechanism is given to illustrate the procedure of this new auction mechanism.

Multi-threaded Communicating Agents in Qu-Prolog

In this tutorial paper we summarise the key features of the multi-threaded Qu-Prolog language for implementing multi-threaded communicating agent applications. Internal threads of an agent communicate using the shared dynamic database used as a generalisation of Linda tuple store. Threads in different agents, perhaps on different hosts, communicate using either a thread-to-thread store and forward communication system, or by a publish and subscribe mechanism in which messages are routed to their destinations based on content test subscriptions. We illustrate the features using an auction house application. This is fully distributed with multiple auctioneers and bidders which participate in simultaneous auctions. The application makes essential use of the three forms of inter-thread communication of Qu-Prolog. The agent bidding behaviour is specified graphically as a finite state automaton and its implementation is essentially the execution of its state transition function. The paper assumes familiarity with Prolog and the basic concepts of multi-agent systems.