This paper proposes a novel optimization algorithm Varying Population based Bacterial Foraging Algorithm (VPBFA), to solve optimal bidding strategy in a pool based electricity market. In a power market, Generating Companies (suppliers) participate in the bidding process in order to maximize their profits. Each supplier bid strategically for choosing the bidding coefficients to counter the compe...

This paper investigates utility maximising bidding heuristics for agents that participate in multiple heterogeneous auctions, in which the auction format and the starting and closing times can be different. Our strategy allows an agent to procure one or more items and to participate in any number of auctions. For this case, forming an optimal bidding strategy by global utility maximisation is c...

Virtual bidding provides a mechanism for financial players to participate in wholesale day-ahead (DA) electricity markets. The price difference between DA and real-time (RT) markets creates arbitrage opportunities players. Physical market participants (MP), referred as with physical assets this paper, can also take advantage of virtual but different way, which is further amplify the value their...

The increasing prevalence of auctions as a method of conducting a variety of transactions has promoted interest in modelling bidding behaviours with simulated agent models. The majority of popular research has focused on double auctions, i.e. auctions with multiple buyers and sellers. In this paper we investigate agent models of sealed bid auctions, i.e. single seller auctions where each buyer ...

Auctions are widely used online to conduct commercial transactions. An important feature of online auctions is that even bidders who intend to buy a single object frequently have the opportunity to bid in sequential auctions selling identical objects. This paper studies key features of the optimal bidding strategy, assuming rational, risk-neutral agents with independent private valuations and s...

Agents and market mechanisms are widely elaborated and applied to automate interaction and decision processes among others in robotics, for decentralized control in sensor networks and by algorithmic traders in financial markets. Currently there is a high demand of efficient mechanisms for the provisioning, usage and allocation of distributed services in the Cloud. Such mechanisms and processes...

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...

Combinatorial auctions, which allow agents to bid directly for bundles of resources, are necessary for optimal auction-based solutions to resource allocation problems with agents that have non-additive values for resources, such as distributed scheduling and task assignment problems. We introduce iBundle, the first iterative combinatorial auction that is optimal for a reasonable agent bidding s...