نتایج جستجو برای: nash equilibrium lost welfare bidding strategy genetic algorithm iran wholesale electricity

تعداد نتایج: 1950362  

2012
Nicolas Lopez Carlos Ituarte Jose F. Espiritu

In the present paper, and agent based model is developed to balance the electric storage in a Hybrid Power Grid, where each house (end user) is modeled as an agent that can choose to store/release electricity at given times in order to tail the demand minimizing its own cost. The overall interaction of the agents causes the demand curve to change according to the decisions taken by the agents i...

M. BAKHSHOODEH S.H. MOOSAVI

ABSTRACT- Iran achieved its self-sufficiency goal in wheat production a few years ago, perhaps at the expense of decreasing the production of other grains specially barley as stated by critics in the country. Considering the dependency of wheat and barley markets on each other, policy preference functions were estimated separately for each market. Incorporating political weights, a game theory ...

2008
Tahir Mukhtar

This study evaluates the impacts of the trade liberalization under Doha Round on basmati rice in Pakistan using a partial equilibrium model. Price integration analysis shows that there is a stable long-run relationship between farm gate price and wholesale price and between wholesale price and world price of basmati and non-basmati rice. Direction of influence is from world price to wholesale p...

Journal: :Economic Theory 2023

Abstract We study multistage centralized assignment systems to allocate scarce resources based on priorities in the context of school choice. characterize schools’ capacity-priority profiles under which an additional stage may improve student welfare when deferred acceptance algorithm is used at each stage. If profile acyclic , then no prefers any subgame-perfect Nash equilibrium (SPNE) outcome...

2014
Artur Czumaj Michail Fasoulakis Marcin Jurdzinski

The ε-well-supported Nash equilibrium is a strong notion of approximation of a Nash equilibrium, where no player has an incentive greater than ε to deviate from any of the pure strategies that she uses in her mixed strategy. The smallest constant ε currently known for which there is a polynomial-time algorithm that computes an ε-well-supported Nash equilibrium in bimatrix games is slightly belo...

2004
Anette Boom

Investments in Generating Capacities between a monopolist and two competing firms are compared where the firms invest in their capacity and fix the retail price while electricity demand is uncertain. A unit price auction determines the wholesale electricity price when the firms compete. They know the level of demand when they bid their capacities. Total capacities can be larger or smaller with ...

2006
Spyros C. Kontogiannis Panagiota N. Panagopoulou Paul G. Spirakis

Nash [13] introduced the concept of Nash equilibria in non-cooperative games and proved that any game possesses at least one such equilibrium. A well-known algorithm for computing a Nash equilibrium of a 2-player game is the Lemke-Howson algorithm [11], however it has exponential worst-case running time in the number of available pure strategies [15]. Recently, Daskalakis et al [4] showed that ...

2003
Sevan G. Ficici Jordan B. Pollack

One problem associated with coevolutionary algorithms is that of forgetting, where one or more previously acquired traits are lost only to be needed later. We introduce a new coevolutionary memory mechanism to help prevent forgetting that is built upon game-theoretic principles, specifically Nash equilibrium. This “Nash memory” mechanism has the following properties: 1) It accumulates a collect...

Journal: :CoRR 2014
Mireille Bossy Nadia Maïzi Odile Pourtallier

In this paper, we analyze Nash equilibria between electricity producers selling their production on an electricity market and buying CO2 emission allowances on an auction carbon market. The producers’ strategies integrate the coupling of the two markets via the cost functions of the electricity production. We set out a clear Nash equilibrium on the power market that can be used to compute equil...

2014
Patricia Bouyer Nicolas Markey Daniel Stan

We study mixed-strategy Nash equilibria in multiplayer deterministic concurrent games played on graphs, with terminal-reward payoffs (that is, absorbing states with a value for each player). We show undecidability of the existence of a constrained Nash equilibrium (the constraint requiring that one player should have maximal payoff), with only three players and 0/1-rewards (i.e., reachability o...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید