In a real-time electric power auction, the bids of producers consist of committed supply as a function of price. The bids are submitted under uncertainty, before the demand by the Independent System Operator has been realized. In the Supply Function Equilibrium (SFE), every producer chooses the...

Consider a market where producers submit supply functions to a procurement auction — e.g. an electric power auction — under uncertainty, before demand has been realized. In the Supply Function Equilibrium (SFE), every firm commits to the supply function maximizing his expected profit given...

This paper derives a Supply Function Equilibrium (SFE) of a pay-as-bid auction, also called discriminatory auction. Such an auction is used in the balancing market for electric power in Britain. For some probability distributions of demand a pure-strategy equilibrium does not exist. If demand...

Producers submit committed supply functions to a procurement auction, e.g. an electricity auction, before the uncertain demand has been realized. In the Supply Function Equilibrium(SFE), every firm chooses the bid maximizing his expected profit given the bids of the competitors. In case of...

Most balaning markets of electric power are organized as uniform-price auctions. In 2001, the balancing market of England and Wales switched to a pay-as-bid auction with the intention of reducing wholesale electricity prices. Numerical simultations of an electricity auction model have indicated...

Pareto equilibria in multicriteria games can be computed as the Nash equilibria games, obtained by assigning weights to the separate criteria of a player. To analysts, these weights are usually unknown. This paper therefore proposes ideal equilibria, strategy profiles that are robust against...

In this paper it is shown that the core and the bargaining sets of Davis-Maschler and Zhou coincide in a class of shortest path games.

A set of necessary and sufficient conditions for convexity of a transferable utility game in terms of its decomposition into unanimity games is shown to be minimal: none of the conditions is redundant. The result is used to provide an axiomatization of the Shapley value on the set of convex games.