Equilibria on the Day-Ahead Electricity Market

Size: px
Start display at page:

Download "Equilibria on the Day-Ahead Electricity Market"

Transcription

1 Equilibria on the Day-Ahead Electricity Market Margarida Carvalho INESC Porto, Portugal Faculdade de Ciências, Universidade do Porto, Portugal João Pedro Pedroso INESC Porto, Portugal Faculdade de Ciências, Universidade do Porto, Portugal Technical Report Series: DCC Departaento de Ciência de Coputadores Faculdade de Ciências da Universidade do Porto Rua do Capo Alegre, 101/1055, PORTO, PORTUGAL Tel: Fax:

2 Equilibria on the Day-Ahead Electricity Market Margarida Carvalho a,b, João Pedro Pedroso a,b a Faculdade de Ciências, Universidade do Porto, Rua do Capo Alegre, Porto, Portugal b INESC TEC, Rua Dr. Roberto Frias 378, Porto, Portugal Abstract In the energy sector, there has been a transition fro onopolistic to oligopolistic situations pool arkets; each tie ore copanies optiization revenues depend on the strategies of their copetitors. The arket rules vary fro country to country. In this work, we odel the Iberian Day-Ahead Duopoly Market and find exactly which are the outcoes Nash equilibria of this auction using gae theory. Keywords: Duopoly, Nash Equilibria, Day-Ahead Market 1. Introduction Over the last years the way electricity is produced and delivered has changed considerably. Market echaniss were ipleented in several countries and electricity arkets are no longer vertically integrated. Nowadays, in any countries the electricity arkets are based on a pool auction to purchase and sell power. Producing copanies offer electricity in a arket and the buyers subit acquisition proposals. An electricity pool arket is characterized by a single price arket clearing price for electricity paid to all the proposals accepted in the arket. The way in which the arket clearing price is deterined varies fro one country to another: the last accepted offer, the first rejected offer, ultiple unit Vickey see Anderson and Xu 004, Son et al. 004 and Zieran et al The Iberian arket uses the last accepted offer echanis, which sees to provide a copetitive price and an appropriate incentive for investent and new entry. Indeed, ost pool arkets use the last accepted block rule see Son et al To analyze the copanies behavior in the electricity arket, gae theory has been used as a generalization of decision theory see Singh The concept of Nash equilibriu NE for a gae is used as a solution. The NE leads to the strategies that axiize the copanies profit see for exaple Hasan and Galiana 010, Hobbs et al. 000 and Son Eail addresses: argarida.carvalho@dcc.fc.up.pt Margarida Carvalho, jpp@fc.up.pt João Pedro Pedroso

3 and Baldick 004. This eans that in a NE nobody has advantage in oving unilaterally fro it. As stressed in Baldick 006, for a odel to be tractable it ust abstract away fro at least soe of the detail. Solvable electricity arket odels do not use, for exaple, transition constraints. First it is necessary to understand the effect changes have on arket rules or structures. In Anderson and Xu 004, the Australian power arket is considered in detail, as we will do here for the Iberian case. There are soe crucial differences between the forulation in Anderson and Xu 004 and ours, such as the pool auction structure and the deand shape. In this context, the authors of Son et al. 004 analyze the arket equilibria with the first rejected echanis and the pay-as-bid pricing. Here, the aount supplied by each generator is a discrete value; this also differs fro our odel. In Lee and Baldick 003 an electricity arket with three copanies is forulated, and the space of strategies is discretized in order to find a NE. Recently, in an attept to predict arket prices and arket outcoes, ore coplex odels have been used. However, any ties that does not allow the use of analytical studies. Thus, techniques fro evolutionary prograing see Barforoushi et al. 010 and Son and Baldick 004 and atheatical prograing see Hobbs et al. 000 and Pereira et al. 005 have been used in these new odels. In our Iberian arket duopoly odel, we do not consider network constraints. We will provide a detailed application of non cooperative gae theory in our forulation of the electricity arket. To the best of our knowledge, such theoretical treatent has not been considered before. In our forulation, deand elasticity will be a paraeter as this is a realistic approach that only has been considered in the siulation of arkets, but not in a theoretical way. Apart of being the first detailed approach of the Iberian arket, it points out the existence of NE in pure strategies in all the instances of this gae, showing how the NE are conditioned by capacity, production costs and elasticity paraeters. Soe potential properties about the oligopoly case are also highlighted. In Section, the Iberian duopoly arket odel will be presented and the concept of NE will be foralized. In Section 3, soe rearks will be ade which allow us to find the NE in a constructive way. Section 4 concludes this detailed NE classification.. Iberian Duopoly Market Model In this section we will begin by explaining our odel and fixing notation. Then, gae theory will be introduced with the ai of giving us tools to analyze this arket. We set up a odel for a gae with two producing firs, which will represent the players, labeled as Fir 1 and Fir. It is assued that each Fir i owns a generating unit with arginal cost c i and capacity E i > 0. Both firs subit siultaneously a bid to the arket, using a pair q i, p i S i = 0, E i ] 0, b] for Fir i, where q i is the proposal quantity, p i is the bid price and S i is the space of strategies. Fir i s payoff Π i q 1, p 1, q, p is a function that depends on the strategic choices of the rival fir and its own. The deand is a segent P = Q + b characterized by the real constants < 0 and b > 0. It is assued that deand, the firs arginal costs and capacities are known 3

4 EQUILIBRIA ON THE DAY-AHEAD DUOPOLY MARKET 3 b = 1. $/MWh 0.6 Fir 3 supply curve Pd = Fir Fir 1 MWh 100 Qd = Figure.1. Dispatch Figure.1: Econoic Dispatch. Iberian Duopoly Market Model In this section we will begin by explaining our odel and fixing notation. Then, gae theory will be introduced with the ai of giving us tools to analyse this arket. We set up a odel for a gae with two producing firs, which will represent the players, labelled as Fir 1 and Fir. It is assued that each Fir i owns a generating unit with arginal cost ci and capacity Ei > 0. Both firs subit siultaneously a bid in the arket, through a pair qi, pi Si = 0, Ei] 0, b] for fir i, where qi is the proposal quantity, pi is the bid price and Si is the space of strategies. Fir i s payoff Πi q1, p1, q, p is a function that depends on the strategic choices of the rival fir. The deand is a segent P = Q + b characterized by the real constants < 0 and b > 0. It is assued that the deand and firs arginal costs and capacities are known by all agents. These assuptions can be justified by the knowledge of inforation about the technology available for each fir, fuel costs, and precise forecasts of deand. Without loss of generality let c1 < c < b. Once, the arket operator has the firs proposals and the deand, it finds the intersection between the deand representation and the supply curve, which gives the arket clearing price Pd and quantity Qd. For exaple, suppose that = 1, b = 1. and Fir 1 00 bid 90, 0.4, Fir bid 100, 0. and Fir 3 bid 60, 0.6. The Market Operator organizes the proposals by ascending order of prices which gives the supply curve, see Figure.1. Then, the Pd and Qd are found. The accepted bids are the ones in the left side of Qd. by all agents. These assuptions can be justified by the knowledge of inforation on the technology available for each fir, fuel costs, and precise deand forecasts. Without loss of generality c 1 < c < b. Once, the arket operator has the firs proposals and the deand, it finds the intersection between the deand representation and the supply curve, which gives the arket clearing price P d and quantity Q d. For exaple, suppose that = 1, b = 6 and 00 5 Fir 1 bid 90, 0.4, Fir bid 100, 0. and Fir 3 bid 60, 0.6. The Market Operator organizes the proposals by ascending order of prices which gives the supply curve, see Figure.1. Then, P d and Therefore Q d the are revenue found. of fir i is given The by: accepted bids are the ones in the left side of Q d. Therefore the revenue of Fir i is given by: Π i = P d c i g i where g i q i is the accepted quantity in the econoic dispatch. Note that with this structure linear deand and linear production cost the firs profit is concave and thefore the optiu strategies are an extree point or a stationary point. As a tie breaking rule, we proportionally divide the quantities proposed by the firs declaring the sae price, in case the total quantity is not fully required. If the deand segent intersects the supply curve in a discontinuity, all the proposals with prices below the intersection are fully accepted and the arket clearing price is given by the last accepted proposal. Now we are able to define a NE in pure strategies. Definition 1. In a gae with n players a point s NE = s NE 1, s NE,..., s NE n, where s NE i specifies a strategy over the set of strategies of player i, is a Nash Equilibriu if i {1,,..., n}: Π i s NE Π i si, s NE i s i S i where Π i is the utility of player i, S i is his space of strategies and s NE i 4 is s NE except s NE i.

5 Our task is to classify all the NE in this odel when players choose their actions deterinistically. This is a hard task because the classical approach of reaction functions is inadequate, since the payoff functions are non-continuous. During this work, besides the NE, it was observed that ɛ-equilibria are also likely to be arket outcoes. Definition. In a gae with n players a point s NEɛ = s NEɛ 1, s NEɛ,..., s NEɛ n, where s NEɛ i specifies a strategy over the set of strategies of player i, is an ɛ-equilibriu if i {1,,..., n} and for a real non-negative paraeter ɛ: Π i s NE ɛ Πi si, s NEɛ i ɛ si S i. In our duopoly case, ɛ is infinitesial and just one of the firs has an ɛ advantage in changing its strategy. Thus, we also found ɛ-equilibria. 3. Nash Equilibria Classification The goal of this section is to describe Nash equilibria that ay arise in the duopoly case, characterizing Nash equilibria in ters of the paraeters: c 1, c, E 1, E, and b. For that purpose, we first eliinate soe cases where there cannot be NE. Recall the assuption c 1 < c < b. Lea 3. In the duopoly arket odel no Nash equilibriu in pure strategies has a tie in the proposals prices, which eans that p 1 = p. Proof. In the tied case both firs bid p 1 = p = P d which iplies Π tied Q d 1 = P d c 1 q 1 and Π tied = P d c q 1 + q q new 1 = q Q d q 1 + q with q 1 + q > Q d. Note that if q 1 + q = Q d, the firs proposals are totally accept. If P d < c 1, then Π tied 1 < 0 an thus, Fir 1 has incentive to change its strategy to p 1 = c 1, since its payoff will increase to zero. If P d = c 1 < c, then Π tied < 0, thus Fir has incentive to change its behavior as Fir 1 did in the previous case. If P d > c 1, Fir 1 has stiulus to choose p new 1 < P d = p and { E 1 if E 1 < P d b P d b ε otherwise with ε > 0 infinitesial. The reason is that with this new choice Fir 1 has an accepted quantity g 1 = q1 new Pd b Q > q d 1 q 1 +q = q 1 q 1 +q and the arket clearing price is aintained, up to an infinitesial quantity. Therefore, revenue of Fir 1 increased. Since there is always at least one fir that benefits fro changing its behavior unilaterally, this cannot be an equilibriu. 5

6 Note that this lea can be easily generalized for the oligopoly case, as long as the arginal costs are different for all firs. We have just eliinated fro the possible set of NE the cases with a tie in prices. Another particular situation occurs when the deand intersects the supply curve in a discontinuity. This possibility can also be discarded fro the potential NE. Lea 4. In the duopoly arket odel, a Nash equilibriu in pure strategies always intersects the supply curve. Proof. Let us prove the lea by contradiction. In the duopoly arket odel, suppose that there is an equilibriu such that the deand curve intersects the supply curve in a discontinuity. It suffices to note that the fir with the last proposal being accepted takes advantage increasing the price of this proposal unilaterally up to the intersection point, because the arket clearing price increases and the arket clearing quantity is aintained. Therefore, this leads to a contradiction, since it was assued that there was an equilibriu. Potential equilibria will have: Fir 1 onopolizing the arket with P d = p 1 < p = c, Fir 1 deciding P d = p 1 > p or Fir deciding P d = p > p 1. Fir never onopolizes the arket since it is the less copetitive copany c > c 1. The proposition below suarizes the interesting strategies in an equilibriu, that is, the potential equilibria. In the following sections we will evaluate under which conditions they are an equilibriu. Proposition 5. In the duopoly arket odel the equilibria have 1. Fir 1 deciding the arket clearing price and both firs producing; this eans P d = p 1 > p, in which case Fir plays the largest possible quantity, as long as p 1 reains greater than c, and Fir 1 ay play: a the duopoly optiu q 1 1 b q, p 1 = c 1+b+q stationary point; b the duopoly optiu q 1 = E 1, p 1 = E 1 + q + b extree point;. Fir 1 onopolizing; which eans P d = p 1 < p = c and in this case Fir 1 ay play: stationary point; a the onopoly optiu q 1 1 b, p 1 = c 1+b b the onopoly optiu q 1 = E 1, p 1 = E 1 + b extree point; c a price close to Fir s arginal cost q 1 ε b,, p 1 = c ε or equivalently q 1 = c b ε, p 1 < c for ε > 0 arbitrary sall; ; 3. Fir deciding the arket clearing price and both firs producing; this eans P d = p > p 1, in which case Fir 1 plays the largest possible quantity, as long as P d = p, and Fir ay play: a the duopoly optiu q b q 1, p = c +b+q 1 stationary point; b the duopoly optiu q = E, p = E + q 1 + b extree point. 6

7 Proof. Let us start with the siplest case: Consider an equilibriu with P d = p 1 < p = c. The optial strategy in the onopoly case is: p1 b axiize Π 1 q 1, p 1 = p 1 c 1 A stationary point is at subject to p 1 0, b] Π 1 p 1 = 0 p 1 = c 1 + b with Π 1 < 0, q p 1 p 1 b = c 1 b E 1 1 and c 1+c < c. When E 1 < c 1 b the onopoly optiu is an extree point: q 1 = E 1 and p 1 = E 1 + b. Therefore, Fir 1 s best strategy is one of the just derived if c > E 1 + b > c 1+b. Otherwise, for Fir 1 to onopolize, it has to bid a price below c. In this case, the strategy with the highest payoff is q 1 ε b, p 1 = c ε, for ε arbitrarily sall. To ake this bid Fir 1 s capacity ust satisfy E 1 ε b. Equivalently, Fir 1 could bid q 1 b ε, p 1 < c, allowing Fir to decide P d = c, but Fir s participation in the arket would be as sall as ε. 1 Considerer an equilibriu with P d = p 1 > p. In this case, Fir is playing a quantity bid as high as possible, as long as p 1 > c. Now, we just have to see which is the best strategy for Fir 1 when P d = p 1 > p which iplies q < p 1 b : p1 b axiize Π 1 q 1, p 1, q, p = q p 1 c 1 A stationary point is at Π 1 p 1 subject to p 1 0, b] = 0 p 1 = c 1 + b + q which iplies q 1 q = c 1 b q or if E 1 < c 1 b q p 1 = E 1 + q + b extree point. The bid quantity for Fir akes sense since once P d = p 1 is fixed Fir s profit increases with q. 3 Copletely analogous to the above case. p 1 b In Figure 3.1, the above proposition is suarized. Using this proposition, we will copute the conditions in which the above equilibria exist; this eans that neither of the firs will have advantage in unilaterally oving fro the chosen strategies. Note that g 1 = c 1 b and p 1 = c 1+b is the onopoly optiu. Therefore, we will use these two values to start our equilibria classification. Figure 3. represents the initial division of the space of paraeters which will allow us to start a classifying the equilibria that ay occur in this arket. Before the coputation of equilibria, we prove the following theore. 7

8 54 CHAPTER 4. IBERIAN MARKET MODEL Potential equilibria Fir 1 onopolizes Both firs participate in the arket EQUILIBRIA ON THE DAY-AHEAD DUOPOLY MARKET 7 Paraeters c1, c, E1, E,, b Case a: The onopoly optiu is a stationary point. Case b: The onopoly optiu is an extree point. Fir 1 decides Pd = p1 > p Fir decides Pd = p > p1 E1 < c1 b E1 1 b Case c: The duopoly optiu is a stationary point. Case d: The duopoly optiu is an extree point. Case e: The duopoly optiu is a stationary point. c1+b Both firs participate in the arket c1+b < c Fir 1 produces at full capacity c1+b Fir becoes copetitive c1+b < c Fir 1 onopolizes Figure 4.3: Potential equilibria. Figure 3.1: Potential equilibria. which iplies q1 p 1 b c1 b q q = or if E1 < c1 b q p 1 = E1 + q + b extree point. The bid quantity for Fir akes sense since once Pd = p 1 is fixed Fir s profit increases with q. Strategies 3.4. Fir 1: s NE 1 = Figure 3.1. Decision tree Figure 3.: Decision tree. ] c1 b q1, E1, c1 + b Theore 3 Copletely analogous 6. to There the above case. is always an equilibriu in the or Iberian duopoly arket odel. The equilibriu is a Nash equilibriu or an ɛ-equilibriu with ɛ infinitesial. 3.1 Fir : s NE = q 0, E], p c, b] 3. Fir : s NE = 0, p 0, b] 3.3 In Figure 4.3, the above proposition is suarized. With these bids, the arket clears with price Pd = c1+b < c and quantity Qd = c1 b. Fir 1 is at onopoly s optiu, and Fir has no influence in the arket. Using this proposition, we will copute the conditions in which the above equilibria 3.. Fir 1 produces at full capacity: E1 < Proof. exist; this eanssuppose that neither of the that firs will there have advantage is aninalgorith unilaterally ovinga which given the proposals firs c1 b q and 1, c1+b p 1 <, c. q, p, fro the chosen strategies. Recall fro the last section that g1 = c1 b c1+b and p1 = is was able the onopoly to output optiu. Thus the we will strictly use these twobest values toreaction start our equilibria for each of Letthe. us start by considering Therefore, E1 + b < Ac, 1 ie, qfir 1, p cannot 1, q enter, p in the = arket with classification. Figure 4.4 represents the initial division of the space of paraeters positive profit. Note that c b c1 b < E1 <. In this case, 1 will onopolize the electricity arket, although its capacity is less than the optiu c1 b. The Nash equilibriu q which 1, p will 1 and A q 1, p 1, q, p = q allow us to start a classification of the equilibria that, p ay are the bids that axiize the profit for Fir 1 and occur in this is given by: Fir arket., respectively, given q 1, p 1, q, p. Strategies 3.5. Our goal is to prove that if we iteratively apply algorith A for Firsoe 1: s NE 1 = initial E1, E1 + b proposals, 3.4 it will find a fixed point of A. This is A 1 q 1, p 1, q, p = q 1, p 1 Fir and : seeaequation q 1 3., por 1 3.3, q, p = q, p, which is an equilibriu of the gae. Let the initial bids be q 1, p 1, q, p = E 1, p 1, E, c, where p 1 is the best bid price for Fir 1 such that it is lower than c. Reeber, as entioned in Proposition 5, that in an equilibriu the firs bid their entire production capacity. Applying A 1 E 1, p 1, E, c, we can obtain: 1. A 1 E 1, p 1, E, c = E 1, p 1, eaning that Fir 1 is already aking its best proposal according to Fir s strategy. Now, we apply A E 1, p 1, E, c to see if Fir has advantage in increasing its price bid. a If A E 1, p 1, E, c = E, c, then E 1, p 1, E, c is a fixed point of A and thus it is an equilibriu. Case of Proposition 5 describes this situation. b If A E 1, p 1, E, c = E, p, where p is equal to the one described in case 3 of Proposition 5, then E 1, p 1, E, p is an equilibriu. Fir 1 does not have advantage in changing fro p 1 to the price of case 1 in Proposition 5, since if it has, Fir 1 had done that in the previous step.. A 1 E 1, p 1, E, c = E 1, p 1, where p 1 is equal to the one of case 1 in Proposition 5. Fir 1 had advantage in increasing its price bid to p 1. Coputing A E 1, p 1, E, c we obtain: 8

9 a A E 1, p 1, E, c = E, c. Fir keeps its bid which iplies that E 1, p 1, E, c is an equilibriu. b A E 1, p 1, E, c = E, p, where p is equal to the one of case 3 in Proposition 5. Since A, and in particular A, only changes to bids that strictly increase profit, we can conclude for this case that p 1 < p. By Proposition 5, p 1, is the best strategy to Fir 1 when it decides on P d and Fir is biding a price lower than p 1. Therefore, A 1 E 1, p 1, E, p = E 1, p 1 which eans that E 1, p 1, E, p is an equilibriu. In AppendixI the existence of equilibria is proven, but using a erge of the cases presented in the following sections and algebraic arguents Fir 1 onopolizes: E 1 1 b and c 1+b < c Fir 1 onopolizes the arket, which eans that its capacity is high enough, and its arginal cost low enough, to keep Fir out of the arket. This is the case a of Figure 3.1. In this case, the Nash equilibriu is given by: Strategies 7. ] Fir 1: s NE c1 b 1 = q 1, E 1, c 1 + b 3.1 or Fir : s NE = q 0, E ], p c, b] 3. Fir : s NE = 0, p 0, b] 3.3 With these bids, the arket clears with price P d = c 1+b < c and quantity Q d = c 1 b Fir 1 is at the onopoly s optiu, and Fir has no influence on the arket. 3.. Fir 1 produces at full capacity: E 1 < c 1 b and c 1+b < c We are going to have cases b, e and d of Figure 3.1 as equilibria. Let us start by considering that E 1 + b < c, eaning that, Fir cannot enter the arket with positive profit. Note that c b < E 1 < c 1 b. In this case, Fir 1 will onopolize the electricity arket, although its capacity is lower than the optiu c 1 b. The Nash equilibriu is given by:. Strategies 8. Fir 1: s NE 1 = E 1, E 1 + b 3.4 Fir : see Equations 3. or 3.3 9

10 As before, Fir 1 does not have an incentive to change its strategy, as this will ean that q 1, p 1 = E 1, E 1 + b is not an optiu. Let us now consider E 1 + b. Fir 1 cannot onopolize the arket and, in this case, the arginal cost of Fir is lower than the onopoly price E 1 + b, i.e., E 1 + b. Moreover, in an equilibriu for this case, Fir 1 never decides the price, that is., P d = p > p 1. Otherwise, by Proposition 5, if P d = p 1 > p, Fir 1 would be bidding the duopoly optiu price P d = p 1 = c 1+b+q requiring: p 1 = c 1 + b + q > c but this would iply a negative quantity for Fir, which is absurd: q < c c 1 b < 0. The inequality c c 1 b < 0 is equivalent to c > c 1+b, which holds by assuption. Therefore, we discarded the possibility of Fir 1 deciding P d = p 1 > p case c of Figure 3.1. The cases d and e in Figure 3.1 reain as potential NE, which we will discuss below. Suppose that Fir 1 s bidding price is p 1 < c p = P d. The best reaction for Fir is the duopoly optiu in Proposition 5: p = c +b+q 1 and the corresponding quantity is q b q 1. Indeed p : p = c + b + q 1 + b + E 1 E 1 + b therefore, the bid price p akes sense, since p > c. Furtherore, Fir 1 bids q1 = E 1 and p 1 < c, otherwise it would have advantage in increasing its quantity and this would not be an equilibriu. Fir does not have incentive to change its ove q b E 1, p = c +b+e 1, as this is the optiu stationary point when p 1 < c. In order to have an equilibriu, neither of the firs can benefit fro unilaterally changing their behavior. When Fir decides P d = p > p 1, this fir will not benefit fro changing its behavior, because that would ean decreasing the price p, p 1 > p, and this does not increase Fir s profit, since p 1 is lower than c. May Fir 1 be encouraged to reconsider its strategy? In other words, would Fir 1 be interested in increasing price p 1? The answer is no, because as we have seen at the beginning: if Fir 1 picks the price P d = p 1 > p it will be p 1 = c 1+b+q but p 1 < c p. Therefore, now we just have to distinguish the duopoly optiu as a stationary point and the duopoly optiu as an extree point: In the case E b E 1, Fir s optiu is a stationary point. As we assue E 1 + b > c, Fir 1 is not onopolizing, and the Nash Equilibriu is given by 10

11 Strategies 9. Fir 1: s NE 1 = E 1, p 1 0, c 3.5 ] Fir : s NE c b E 1 = q, E, c + b + E For E 1 + b = c and ε, ε > 0 arbitrary sall, the equilibriu is given by Strategies 10. Fir 1: s NE 1 = E 1 ε, p 1 0, c 3.7 Fir : s NE = q ε, E ], c 3.8 In the case E < c b E 1 both firs bid at full capacity. Here, Fir does not have enough capacity to produce the quantity c b E 1 required, so q = E and p = q 1 + E + b. The best reaction quantity for Fir 1 is q1 = E 1 as before. Fir is playing q = E, p = E 1 + E + b which, by construction, is the best reaction when Fir 1 plays q 1, p 1 = E 1, p 1 < c. These strategies are a Nash equilibriu. Strategies 11. Fir 1: s NE 1 = E 1, p 1 0, E 1 + E + b] 3.9 Fir : s NE = E, E 1 + E + b 3.10 Clearly, we can invert the prices of each fir, reaching the Nash equilibriu: Strategies 1. Fir 1: s NE 1 = E 1, E 1 + E + b 3.11 Fir : s NE = E, p 0, E 1 + E + b] 3.1 The conclusions of this section are suarized in the decision tree of Figure Fir becoes copetitive: E 1 1 b and c 1+b In this case, we will have cases c, b and e of Figure 3.1 as equilibria. 11

12 E 1 < c1 b c1+b and < c E 1 + b < c E 1 + b Fir 1 onopolizes the arket see the NE 3. to 3.4 Both Firs participate in the Market E < c b E1 E b E1 see the NE 3.9, 3.10, 3.11 and 3.1 E 1 + b > c E 1 + b = c see the NE 3.5 to 3.6 see the NE 3.7 to 3.8 Figure 3.3: Equilibria for Section 3.. Figure 3.3: Equilibria for Section Fir 1 decides P d = p 1 > p We are interested in finding under which conditions case c in Figure 3.1 is a NE. Clearly p 1 > c and therefore, we assue p = c. Under the results of Proposition 5, Fir 1 ust be bidding the stationary point p 1 = c 1+b+q and q 1 1 b q. This requires p 1 = c 1+b+q and thus, we ust have q c c 1 b. Siilarly, the quantity produced 8 by Fir 1 c 1 b q ust be positive. This leads to the inequality q c 1 b, which is weaker than the forer one, since b > c > c 1. The best strategy for Fir is: q = { c c 1 b ε if E c 1 b E otherwise Note that the quantity q entioned above is positive as long as c c 1+b, which holds. Therefore, Fir is playing the largest possible quantity, as stated in Proposition 5. For the sake of siplicity, let us first consider the case of Fir 1 playing q1 = c 1 b q, rather than q1 > c 1 b q. Hence, q 1 c 1 b which by assuption is lower than E 1 and therefore, it akes sense to bid this quantity at price p 1. For the profile of strategies s 1 = q1, p 1 and s = q, c to be an equilibriu, it is required that neither fir changes its strategy. If Fir has an incentive to choose another strategy it would be p > p 1. The question now is whether there is a strategy s = q, p such that Π q, p, q1, p 1 > Π q, p, q1, p 1. When Fir increases the price, the best strategy is to choose p = 1

13 c +b+q 1 = b+c 1+c q 4. In order to have p > p 1, the following inequality ust hold q > c c 1 b Inequality 3.14 depends on our instance of the proble. Notice that c c 1 b > c c 1 b, 3 so Inequality 3.14 holds whenever E > c c 1 b. Our goal is to see under which conditions 3 Fir does not change the price to p. In this context, if E c c 1 b then q = E and Fir does not have advantage in 3 picking a strategy different fro E, c. Suppose E > c c 1 b 3 that is larger than b + c1 + c q = 4 ; then p = b+c 1+c q > p 4 1 = c 1+b+q c1 + b + q Π q, c, q 1, p 1 = p b Π q 1, p, q1, p 1 = c q c b + c1 + c q 4b 4. Can this be the case c 1 b q? The answer is no. This proof falls naturally, see in AppendixA. Consequently, we are only interested in the case where q = E c c 1 b. 3 Now, we have to study under which conditions Fir 1 does not have advantage in picking p 1 < p = c. If E 1 < c b then Fir 1 bids p 1 < c and q 1 = E 1. Otherwise, if E 1 b, Fir 1 bids p 1 < c and q 1 = c b ε or p 1 = c ε and q 1 ε b. Obviously in the second case E 1 b the Fir 1 s profit is higher, so we use it to copare with its profit of our possible NE: Π 1 q1, p c1 + b + E c1 b E 1, E, c = c 1 = b + E c 1. 4 So when E 0, in Π 1 q 1, p 1, E, c li ε 0 Π 1 q 1, p 1, E, c see AppendixB. Thus, when Equation 3.15 holds and E 1 b Strategies 13. c 1 b + ] c 1 c c b, c c 1 b 3 we have the equilibriu: ] Fir 1: s NE c1 b E 1 = q 1, E 1, c 1 + b + E

14 E 1 1 b c1+b and Fir 1 decides P d = p 1 > p E 1 < c b E 1 b Fir 1 never onopolizes the arket Fir 1 can onopolize the arket E 1 b+c c 1 9c 1 c E 1 < b+c c 1 9c 1 c c b+4c 1 5 c < b+4c 1 5 A B B < A A B A > B E A E > A E > B E B E A E > A E > B E B see the NE 3.16 to 3.17 No NE under these conditions see the NE 3.16 to 3.17 No NE under these conditions see the NE 3.16 to 3.17 Figure 3.4: Fir 1 decides P d = p 1 > p. Figure 3.4: Fir 1 decides P d = p 1 > p. Fir : s NE = E, p 0, c ] 3.17 Note that we have relaxed Fir s biding price. This is possible because the profits do not depend on it. When E 1 < c b and Equation 3.18 holds and we also have the above equilibriu see 10 Equations 3.16 and c 1 b + ] E 1 c 1 c E 0, in, c c 1 b Let A = c 1 b+ E 1 c 1 c, A = c 1 b+ c 1 c c b and B = c c 1 b. We built the 3 decision tree in Figure 3.4. In order to verify that all the decisions in the tree ake sense, that is, that all the regions in its leafs are non-epty, let us observe the following: c 1 b b+c c 1 9c 1 c when c c 1+b ; b+c c 1 9c 1 c < c b when c ] 4c 1 +b, c 1+b 5. This supports the fact that the decision tree akes sense or, in other words, that decisions do not lead us to epty spaces. Reeber, that we used q1 = c 1 b q. In this case, the capacity of Fir had to be lower than c c 1 b, otherwise, Fir would change its strategy with benefit. 3 14

15 It could be possible to find ore general conditions for the Nash equilibriu with Fir 1 deciding P d = p 1 > p. We did not try the strategy q1 > c 1 b q. Note that with bids s 1, s = q1, p 1, q, p = q1 > c 1 b q, c 1+b+q, q, c, Fir 1 only produces the quantity g 1 = c 1 b q. How- ever Fir 1 ay play a quantity q 1 larger than g 1, in order to reduce Fir s incentive in changing the price p. So, our goal is to find a lower bound for q1 when E c 1 b. 3 Let us see how larger q 1 has to be. If Fir increases the price c to p = c +b+q 1 this iplies: c + b + q1 > p 1 = c 1 + b + q q1 < c 1 c and the new quantity dispatched should be positive: + q < c b c +b+q1 b q1 > 0 q1 < c b therefore q1 < c 1 c + q is the strongest condition until now. We still have to add the condition that leads Fir to a higher profit is larger than Π q1, p 1, p b q 1, p c + b + q = 1 Π q 1, p 1, q, c = q c 1 + b + q c c c b q 1 when q1 < c b+ K, see AppendixC. If q 1 b+ K Fir does not have advantage in changing its strategy. Now, we erely need the conditions for Fir 1 to keep the strategy q1, p 1. Proceeding as before: 1. Let E 1 b. Fir 1 does not change its strategy q 1 > c b+ K, p 1 if q 0, c 1 b + c b c 1 c ] c 1 b c b c 1 c,. Note that and c 1 b c b c 1 c c b c 1 c }{{} <0 c 1 b + c b c 1 c > c c 1 b < c c 1 }{{} >0 < c c 1 b 15

16 thus The Nash equilibriu is given by: c + c 3c 1 + b c 1 b c 1 > 0 c ] c 1, c 1 + b q = E c 1 b + c b c 1 c. Strategies 14. Fir 1: s NE 1 = q 1, c 1 + b + E c b + ] K with q 1, E Fir : see Equation Let E 1 < c b. Fir 1 does not change its strategy if q 0, c 1 b + E 1 c 1 c ] c 1 b E 1 c 1 c,. Note that: and c 1 b E 1 c 1 c c 1 b + E 1 c 1 c > c c 1 b < c c 1 b c c 1, c 1 E 1 ] and c 1 E 1 > c 1 c 1 b = c 1 + b c 1, c ] 1 + b c 1, c 1 E 1 ] thus for q = E < c 1 b + E 1 c 1 c we have the Nash equilibriu of 3.19 and The decision tree is in Figure

17 E 1 1 b c1+b and and E c1 b 3 Fir 1 decides P d = p 1 > p E 1 < c b E 1 b E A E 1 b+ K E > A E 1 < c b+ K E > A E A See the NE 3.19 and 3.17 No NE under these conditions No NE under these conditions see the NE 3.19 and Conclusions 5. Acknowledgents Figure 3.5: Fir 1 decides P d = p 1 > p. Figure 3.5: Fir 1 decides P d = p 1 > p Fir 1 onopolizes This work was supported by a INESC Porto fellowship in the setting of the Optiization Now we areinterunit goingline. to establish the conditions that ake Fir 1 onopolize the arket as an equilibriu case b in Figure 3.1. Here, the arket outcoe is an ɛ-equilibriu. AppendixA. Fir changes its strategy Notice that in this case, p 1 < c otherwise, Fir would have advantage in participating in the arket and it is required E Assue that E 1 1 b, c1+b and E > c c1 b 3, and that Fir 1 is playing q1 = c1 b q, p 1 = c1+b+q. By Equation 3.13, since E > c c1 b 3 then q 1 b c 1 b < c 1 b, otherwise the deand is > c c1 b 3. Let us prove that Fir will change not intersecteditsby strategy Firq, p1 s = cbid. to q Hence = p b the q 1, p = best bid b+c1+c q for 4 : Fir 1 is q 1, p 1 = c ε b, c ε with ε > 0. Fir bids q, p Π= qe, p, q, c 1, p. 1 < ΠAny q, p other, q1, p strategy fro Fir leads to the 1 sae or less profit. q c 1 + b + q c < 1 16 b + c 1 c q q c b c 1 3 for this reason, Fir has benefit in odifying its strategy. 1. Consider E b. If 9 Fir 1 chooses p q + 3q c 1 + b c > c c 1 +, the b c produced quantity is zero, and < 0 therefore, Fir 1 will not choose to ake a bid different fro p 1 = c ε. Hence the equilibriu is: Strategies 15. Fir 1: s NE 1 = q1 1 c ε b ], E 1, c ε 3.0 or Strategies 16. Fir : s NE = E, c 3.1 Fir 1: s NE c b 1 = ε, p 1 c 1, c ε] 3. Fir : see Equation

18 . Consider E < c b. Then Fir 1 can bid p 1 > c, producing a non zero quantity. If Fir 1 has incentive to change its strategy it will be to: c1 b E q 1, p 1 =, c 1 + b + E. However, for this new bid to ake sense, we need p 1 = c 1 + b + E > c, which depends on the instance of our proble. Reark: c c 1 b < c b c > c 1. Using this the following cases are possible. a Consider E < c c 1 b p 1 = c 1+b+E > c. Is p1 b Π 1 E c1 + b + E c1 b E, p 1, E, c = c 1 higher than li ε 0 Π 1 c ε b c b, c ε, E, c = c c 1 Not when Equation 3.3 holds see AppendixD for a proof. c 1 b + ] c 1 c c b E, c c 1 b. 3.3 Hence, the equilibriu is given by: Strategies 17. Fir 1: see Equation 3.0? or Strategies 18. Fir : see Equation 3.1 Fir 1: see Equation 3. Fir : see Equation 3.1 b Consider E c 1 b p 1 = c 1+b+E c. In this case, Fir 1 does not have stiulus to change its behavior and hence, the equilibriu is given by Equations 3.0 to 3.. Let B = c c 1 b Since, with the assuptions of this section, c b tree akes sense.. We have the decision tree of Figure 3.6 corresponding to this case. A yields, the decision 18 c 1 b

19 E 1 1 b c1+b and Fir 1 onopolizes E b See the NE 3.0 to 3. E 1 b E c1 b E < c b E 1 < c b No NE under these conditions E < c c1 b See the NE 3.0 to 3. E A See the NE 3.0 to 3. E < A No NE under these conditions Figure 3.6: Fir 1 onopolizes. AppendixB. Fir 1 does not change its strategy Assue that E 1 1 b, c1+b, E c c1 b 3 and E 1 b, and that Fir is playing q = E, p = c. Let us prove in which conditions Fir 1 does not change its strategy q 1 = c1 b E, p 1 = c1+b+e to q1 = c ε b, p 1 = c ε : c1 b+ c bc1 c Figure 3.6: Fir 1 onopolizes Fir decides P d = p > p 1 Finally, we will search for equilibria where Fir decides the arket clearing price, in Π 1 q1, p 1, q, p li Π 1 q 1, p 1, q ε 0, p other words, p 1 < p = P d case d and e of Figure 3.1. b + E c 1 Note that we have to ipose E c b 1 < c b, due to the fact that if E li c c 1 4 ε 0 ε 1 b, Fir 1 has incentive to onopolize the arket 1 since it has sufficient b c 1 + E b c 1 + E 4 capacity c for that purpose. So, b c c 1 > 0 we consider c 1 b E 1 < c b. E 1 4 E 1 b c b c 1 c b Let us assue p 1 < c. Fro Proposition 5, the best c strategy c 1 = for 0 Fir is p = c +b+q1 and q b q1, where q 1 = E 1. E = c 1 b ± c b c 1 c For this strategy there are the following requireents the price of the duopoly optiu In what follows it is study this solution: akes sense and Fir has the production capacity of playing the stationary point of the c1 b c bc1 c > c1 b+ c bc1 c < ; duopoly optiu: 1. p = c +b+e 1 E 1 c b, which holds by our assuption;. E b E 1 < 0 c 1 c c b > b c1 c 1 c c b > b c1 4 c +c c 1 + b c 1 b b c1 4 > 0, note that c +c c 1 + b c 1 b b c1 4 = 0 c = c1+b thus, 0 c1 b+ c bc1 c c1 b c bc1 c which depends on the instance of our proble. We have to study each of these cases. ; 1. Suppose E b E 1, then Fir plays the stationary optiu q b E 1, p = c + b + E 1 14 and Fir 1 E 1, p 1 < c. Obviously Fir will not have incentive in reconsidering another proposal, but Fir 1 ay have advantage in choosing a higher price p 1 = c 1+b+q > p, such that Π 1 q1, p 1 < c, q, p < Π p1 b 1. Is p1 = c 1+b+q c +b+e 1? q, p 1 > p, q, p 19 > p =

20 c 1 + b + q > c + b + E 1 q < c c 1 + E 1 which depends on the instance of our proble. Thus, these cases have to be considered separately: a Suppose c b E 1 c 1 +E 1 E 1 c 1 c b. However, E b c 1 c b c 3 1+b, which by assuption does not hold. So this case never happens. b Suppose E 1 > c 1 c b and q 3 = c b E 1, then Fir 1 has benefit in increasing its proposal price since: p1 b Π 1 q, c 1 + b + q, q, p > Π 1 E 1, p 1 < c, q, p 1 c Suppose E 1 > c 1 c b c 1 c b + E 1 > c + b + E 1 c 1 E E 1 c 1 b c. 3, then as we already did before, there is and q > c b E 1 an equilibriu if E 1 b+ K 1, where K 1 = E1+ c b + 4c 1 E 1 : Strategies 19. Fir 1: see Equation 3.5 Fir : s NE c1 b + ] K 1 = q, E, c + b + E Suppose E < c b E 1. In this case q 1, p 1 = E 1, p 1 < c and q, p = E, E 1 + E + b. Fir will not change this behavior, so let us see when Fir 1 has advantage in increasing p 1 to p 1. For the purpose we need and E > c 1 b p 1 = c 1 + b + E > p = E 1 + E + b E > c 1 b E 1 E 1 is true, since E > 0 and c 1 b E 1 0 E 1 1 b. So, p 1 = c 1+b+E > p = E 1 + E + b. Is p1 b Π 1 E, c 1 + b + E, E, p higher than = 1 4 c 1 + b + E Π 1 E 1, p 1 < c, E, p = E 1 E 1 + E + b c 1? Yes, see AppendixE. Therefore Fir 1 has stiulus in changing its strategy. In short, we can suarize this Nash equilibria with the decision tree of Figure

21 E 1 1 b c1+b and Fir decides P d = p > p 1 E 1 b+ K1 E b E1 E 1 < c b No NE under these conditions E < c1 b+ K1 E < c b E1 E 1 b No NE under these conditions See the NE 3.5 and 3.4 No NE under these conditions Figure 3.7: Fir decides P d = p > p 1.. Suppose E < c b E1. In this case q1, p 1 = E 1, p 1 < c and q, p = E, E 1 + E + b. Fir will not change this behavior, so let us see when Fir and 1 has c 1+b advantage in increasing p 1 to p 1. For the purpose we need p 1 = c 1 + b + E > p = E 1 + E + b E > c 1 b < c E 1 b and E > c1 b E 1 is true, since E > 0 and higher than Π 1 E 1, p 1 < c, E, p = E 1 E 1 + E + b c 1? Yes, see Appendix AppendixE. Therefore Fir 1 has stiulus in changing its strategy. In short, we can suarize this Nash equilibria with the decision tree of Figure Conclusions 5. Acknowledgents Figure 3.7: Fir decides P d = p > p Both firs participate in the arket: E 1 < c 1 b The NE of this section are going to be the ones fro cases c, d and e of Figure 3.1. Since E 1 < c 1 b, Fir 1 does not have capacity to onopolize the arket. c 1 b E 1 0 E 1 1 b Fir decides P d = p > p 1. We start with the case So, p 1 in which P = c1+b+e > p = E 1 d = + E p > p + b. 1 case e of Figure 3.1. As Proposition 5 Is p1 b Π 1 E, c states, Fir plays the stationary duopoly 1 + b + E optiu, E, p = 1 q, p c b q1 4 c 1 + b =, c +b+q1 and + E q1 will be as large as possible such that: and p = c + b + q1 q1 c b q = c b q1 0 q1 c b This work was supported by a INESC Porto fellowship in the setting of the Optiization Interunit Line. > c b thus q1 = E 1. Note that q > 0, since q = c b E 1 c 1 b = c b c 1 > 0 c 4 4 < b+c 1. An iportant fact is that p = c +b+e1 > c, since this is equivalent to E 1 < c b which is true. On the other hand q E depends on the instance of our = c b E 1 15 proble, so Fir ay have to play the extree point of the duopoly optiu. 1. Suppose E b E 1. Fir 1 plays q 1 = E 1, p 1 < c and Fir plays q = c b E 1, p = c +b+e It is easy to see that Fir does not have advantage in choosing other strategy. Let us see if Fir 1 will change its behavior to p 1 = c 1+c +b E 1. In that case, p 4 1 ust be higher than p : p 1 = c 1 + c + b E 1 4 > c + b + E 1 = p E 1 > c 1 c b 3 and c 1 c b 3 c 1 b, which depends on the instance of our proble. 1

22 a Let E 1 c 1 c b. Then, Fir 1 does not have stiulus in changing its behavior 3 unilaterally. Here, the Nash equilibriu is given by: Strategies 0. Fir 1: see Equation 3.5 b Let E 1 > c 1 c b 3 Fir : see Equation 3.6 p 1 = c 1+c +b E 1 > c +b+e 1 = p 4. We have: Π 1 p1 b q, p 1, q, p which is larger than the profit = 1 16 c + b c 1 E 1 Π 1 E 1, p 1 < c, q, p = E 1 c + b + E 1 c 1 if E 1 c 1 b c. Therefore, Fir 1 has advantage in changing its strategy. 3 However, like we already did in the Section 3.3.3, Fir can pick q > c b E 1 sufficiently large such that Fir 1 does not have advantage in changing its strategy. This case is copletely analogous to the one treated in Section 3.3.3, let K 1 = E1 + c + 4c 1 be 1. If E 1 b+ K 1 we have the Nash equilibriu: Strategies 1. Fir 1: see Equation 3.5 Fir : see Equation 3.4. Suppose E < c b E 1. Here Fir s duopoly optiu is an extree point, q = E, p = E + E 1 + b and q 1 = E 1. Notice that p = E + E 1 + b > c, since both firs are playing saller quantities than the last case the arket clearing price increases when the arket clearing quantity decreases. Clearly, Fir will not change its strategy, but Fir 1 ay have incentive in choosing a higher price p 1 > p and that requires: p 1 = c 1 + b + E > p = E 1 + E + b E 1 > c 1 b E which depends on the instance of our proble. a Let E 1 c 1 b E. Then, Fir 1 will not change its behavior. The Nash equilibriu is given by: Strategies. Fir 1: see Equation 3.9 Fir : see Equation 3.10

23 E 1 < c1 b c1+b and Fir decides P d = p > p 1 E b E1 E < c b E1 E 1 c1 c b 3 See the NE 3.5 to 3.6 E < c1 b+ K1 E 1 > c1 c b 3 E 1 b+ K1 E 1 > c1 b E No NE under these conditions E 1 c1 b E See the NE 3.9 to 3.10 No NE under these conditions See the NE 3.5 and 3.4 Strategies 1. b Let E 1 > c 1 b E. Is higher than Figure 3.8: Fir decides P d = p > p 1. Figure 3.8: Fir decides P d = p > p 1. Fir 1: see Equation 3.9 Fir : see Equation 3.10 b Let E 1 > c1 b E. Is p1 b Π 1 E, c 1 + b + E, E, p higher than p1 b Π 1 E, c 1 + b + E, E, p This is equivalent to solve: This is equivalent to solving: Π 1 E 1, p 1 < c, E, E 1 + E + b? Π 1 E 1, p 1 < c, E, E 1 + E + b? 1 4 c 1 + b + E < E 1 + E + b c 1 E 1 1 E1 + c 1 b E E c 1 b + E < 0 4 c 1 + b + E < E 1 + E + b c 1 E 1 E 1 c 1 b E, so Fir 1 has advantage in changing its strategy. E1 + c 1 b E E c 1 + b + E < 0 Fro the above we reach the decision tree of Figure Conclusions E 1 c 1 b E, 5. Acknowledgents so Fir 1 has advantage in changing its strategy. This work was supported by a INESC Porto fellowship in the setting of the Optiization Interunit Line. Fro the above we reach the decision tree of Figure Fir 1 decides P d = p 1 > p Fir 1 wants to play the stationary point q1, p 1 = requires: c1 b q, c 1+b+q, which { c c 1 b c 1 + b + q thus q ε E c 1 b = E otherwise the instance of our proble. > c q < c c 1 b. Let us note that: c 1 b q E 1 depends on 3

24 1. Suppose E c 1 b, then q = c c 1 b ε. a Let E 1 1 b q = c 1 c ε. Hence, Fir 1 can play q 1, p 1 and Fir can play c c 1 b ε, c. Will Fir 1 decrease the price p 1 < c? This eans: Π 1 E 1, c 1, q, c = c c 1 E 1 li ε 0 Π 1 q 1, p 1, q, c c c 1 E 1 1 c 1 c E 1 1 c. Since E 1 1 b q = c 1 c ε, Fir 1 will change its behavior. b Let E 1 < c 1 c then q 1 = E 1, p 1 = E 1 + q + b and { c b q = E 1 ε E b E 1 E otherwise. If E b E 1, Fir will change its strategy as with the present one, its profit is alost zero and increasing p fro c to p = c +b+e 1 > c E 1 < c b 1 which holds by assuption, Fir s profit is higher: c 4 + b + E 1 > 0. Hence, let E < c b E 1 that iplies q = E. In this case, it is easy to see that Fir 1 does not have advantage in changing its strategy: Π 1 E 1, E 1 + E + b, E, c Π 1 E 1, p 1 < c, E, c E 1 + E + b c 1 E 1 c 1 E 1 E c b E 1 which holds. Now, we are going to see under which conditions Fir does not have incentive to change its behavior. First of all, if Fir changes its strategy, it will be with p = c +b+e 1, requiring p > p 1 = E 1 + E + b E > c b E 1 which depends on our instance. If E > c b E 1, Fir chooses this new strategy, see AppendixF. If E c b E 1, we have the NE: Strategies 3. Fir 1: see Equation 3.11 Fir : see Equation 3.1 4

25 . Suppose E < c c 1 b, which iplies q = E. a Let E 1 1 b E. So, Fir 1 can play q 1, p 1 = q1 1 b E, c 1+b+E. Fir 1 does not have advantage in decreasing the price to p 1 < c when E < c 1 b+ E 1 c 1 c, see AppendixG. Finally, we have to check if Fir has advantage in increasing the price p > p 1. In that case, p = c +b+q1 which requires: p = c + b + q 1 > p 1 = c 1 + b + E q 1 < c 1 c + E. Note that c 1 c + E c 1 b E E c c 1 b. In this way, if E 3 c c 1 b q c + E and we have the NE: Strategies 4. Fir 1: see Equation 3.16 Fir : see Equation 3.17 Let E > c c 1 b c 1 c +E 3 > c 1 b E, thus q 1 need to be q1 < c 1 c +E p = c +b+q1 > p 1 = c 1+b+E. Will this new proposal price for Fir increases its profit? If E 1 > c b+ K, the answer is no see AppendixI and thus we have the following NE: Strategies 5. Fir 1: s NE c b + ] K 1 = q 1, E 1, c 1 + b + E 3.5 Fir : see Equation 3.17 b Let E 1 < c 1 b E, then q 1 = E 1, p 1 = E 1 + q + b and { c b q = E 1 ε E b E 1 E otherwise. If E b E 1 then E 1 b E. Since E 1 < c 1 b E, then c b E < c 1 b E E > c c 1 b and we previously assued E < c c 1 b. Thus E < c b E 1, iplies q = E. Fir 1 does not change its strategy, since: Π 1 E 1, E 1 + E + b, E, c Π 1 E 1, p 1 < c, E, c E + E 1 + b c 1 E 1 Π 1 = c c 1 E 1 E c b E 1 5

26 E 1 < c1 b c1+b and Fir 1 decides P d = p 1 > p E c 1 b E 1 < c 1 c E 1 1 c No NE under E < c b E 1 E b E 1 No NE these conditions E b E 1 No NE under these conditions See the NE 3.11 and 3.1 E < c b E 1 under these conditions Figure 3.9: Fir decides P d = p 1 > p. Figure 3.9: Fir 1 decides P d = p 1 > p. 4. Conclusions and the last inequality holds. 5. Acknowledgents Fir does not change its strategy note that c +b+e 1 > E 1 + E + b This work E > was c bsupported E 1 by a INESC Porto fellowship in the setting of the Optiization when E = c b E 1, since Interunit Line. Π E 1, E 1 + E + b, E, c AppendixA. Fir changes its strategy Assue that E 1 1 b, c1+b and > c c1 b 3, and that Fir 1 is playing q1 = c1 b q, p 1 = c1+b+q Π. E 1, E 1 + E + b, p b By Equation 3.13, since E > c c1 b 3 then q > c c1 b E 1, c + b + E 1 3. Let us prove thatfir will change its strategy q, p = c to q = p b q 1, p = b+c1+c q 4 : E + E 1 + b c E 1 Π q, p, q1, p 1 < Π q, p, q1, 4 E 1 + b c p 1 q c 1 + b + q c < 1 16 b + c 1 c q E = c b E 1 9 q + 3q c 1 + b c + 1 c 1 + b c < 0 Thus, for E c b E 1, we have the NE: q c b c Strategies for this reason, Fir has benefit in odifying Fir 1: itssee strategy. Equation 3.11 AppendixB. Fir 1 does not change its strategy Fir : see Equation 3.1 Assue that E 1 1 b, c 1+b, E c c1 b 3 and E 1 b, and that Fir is Proceeding playing q as= before, E, p = we c. have Let us the prove decision in which tree conditions of Figures Fir 1 does not change its strategy q 1 = c1 b E, p 1 = c1+b+e to q1 = c ε b, p 1 = c ε 3.9 and : In AppendixI there are the trees with all the possible equilibria in pure strategies. Π 1 q1, p 1, q, p li Π 1 q 1, p 1, q ε 0, p 6 0

27 Fir 1 decides P d = p 1 > p E c 1 b E 1 < c 1 c E 1 1 c No NE under E < c b E 1 E b E 1 No NE these conditions E b E 1 No NE under these conditions See the NE 3.11 and 3.1 E < c b E 1 under these conditions Figure 3.9: Fir decides d 1. Figure 3.9: Fir 1 decides P d = p 1 > p. 4. Conclusions 5. Acknowledgents E 1 < c1 b c1+b and This work was supported by a INESC Porto fellowship in the setting of the Optiization Interunit Line. Fir 1 decides P d = p 1 > p AppendixA. Fir changes its strategy Assue that E 1 1 b, c1+b and E > c c1 b 3, and that Fir 1 is playing E By Equation 3.13, 1 < since c 1 b E E > c c1 b then q > c c1 b E 1 1 b E its strategy q, p = c to E b E 1 No NE under these conditions See q the NE 3.11 and 3 q = p b 3 q 1, p = b+c1+c q 4 Π q, p, q1, p 1 < Π q, p, q1, p 1 E < c b E 1 E < c c 1 b E > c 1 b+ E 1 c 1 c c 1 + b + q c < 1 16 b + c 1 c q No NE under these conditions q + 3q c 1 + b c + 1 c 1 + b c E c c 1 b < 0 3 q c b c 1 3 for this reason, Fir has benefit in odifying its strategy. q 1 = c1 b q. Let us prove that Fir will change : See the NE 3.16 to 3.17 E 1 < c b+ K E c 1 b+ E 1 c 1 c E > c c 1 b 3 E 1 b+ K, p 1 = c1+b+q. AppendixB. Fir 1 does not change its strategy No NE under these See the NE 3.5 and Assue that E 1 1 b, c 1+b, E c c1 b 3 and E 1 b, and that Fir is playing q = E, p = c. Let Figure us prove in which conditions Fir 1 does not change its strategy q 1 = c1 b E, p 1 = c1+b+e 3.10: decides to q1 = c ε b, p P d = 1 = c ε p 1 > p. Figure 3.10: Fir 1 decides P d = : p 1 > p. Π 1 q 1, p 1, q, p li ε 0 Π 1 q 1, p 1, q, p 0 0 conditions

28 4. Discussion and conclusions In the Iberian duopoly arket odel, the deand and the production costs are linear. As Proposition 5 suggests, there are five types of Nash equilibria. Instances where Fir participates in the arket with infinitesial quantity ε will be considered as a onopoly for Fir 1. When Fir 1 onopolizes the arket in an equilibriu, the selected prices ay be c 1 +b, E 1 + b or c ε, depending on the efficiency/copetitiveness of Fir. For a high arginal cost c, Fir 1 bids the onopoly optiu: p 1 = c 1+b or p 1 = E 1 + b. Furtherore, for c closer to c 1, if Fir s capacity E is large enough, Fir 1 onopolizes bidding p 1 = c ε; otherwise, for a liited capacity E 1, Fir 1 ay prefer to bid a higher price, sharing the arket with Fir. For c even closer to c 1, the arket clearing price in an equilibriu ay be decided by either one of the firs. Fir 1 decides P d, which eans P d = p 1 > p, if the capacity of Fir is liited. The case of Fir deciding P d, eaning P d = p > p 1, is analogous. In soe copetitive situations, there are two NE: one case with P d = p 1 > p and another with P d = p > p 1. By siulating rando instances it was observed that Fir 1 has a high profit in the equilibriu P d = p > p 1, while Fir benefits when P d = p 1 > p and there is no rational way of deciding aong the. We have discretized the space of strategies S 1 and S to copute NE in ixed strategies in these cases. It was observed that a cobination of these two equilibria leads to a new NE in ixed strategies. However, the new equilibriu does not benefit either of the firs coparatively to the pure NE. In conclusion, this work copletely classified the NE that ay occur in a duopoly day-ahead arket. This helps understand the sensitivity of the outcoes to the instances paraeters and the diversity of equilibria that ay arise. Furtherore, it illustrates the rational strategies of each fir. 5. Acknowledgents This work was supported by a INESC TEC fellowship in the setting of the Optiization Interunit Line. References Anderson, E. J., Xu, H., 004. Nash equilibria in electricity arkets with discrete prices. Matheatical Methods of Operations Research 60, 15 38, /s URL Baldick, R., nov Coputing the Electricity Market Equilibriu: Uses of arket equilibriu odels. In: Power Systes Conference and Exposition, 006. PSCE IEEE PES. pp Barforoushi, T., Moghadda, M., Javidi, M., Sheikh-El-Eslai, M., nov Evaluation of Regulatory Ipacts on Dynaic Behavior of Investents in Electricity Markets: A 8

Outperforming the Competition in Multi-Unit Sealed Bid Auctions

Outperforming the Competition in Multi-Unit Sealed Bid Auctions Outperforing the Copetition in Multi-Unit Sealed Bid Auctions ABSTRACT Ioannis A. Vetsikas School of Electronics and Coputer Science University of Southapton Southapton SO17 1BJ, UK iv@ecs.soton.ac.uk

More information

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis

Soft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES

More information

Electricity Day-Ahead Markets: Computation of Nash Equilibria

Electricity Day-Ahead Markets: Computation of Nash Equilibria Electricity Day-Ahead Markets: Computation of Nash Equilibria Margarida Carvalho margarida.carvalho@dcc.fc.up.pt João Saraiva jsaraiva@fe.up.pt João Pedro Pedroso jpp@fc.up.pt Faculdade de Ciências, Universidade

More information

List Scheduling and LPT Oliver Braun (09/05/2017)

List Scheduling and LPT Oliver Braun (09/05/2017) List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)

More information

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,

More information

Uncoupled automata and pure Nash equilibria

Uncoupled automata and pure Nash equilibria Int J Gae Theory (200) 39:483 502 DOI 0.007/s0082-00-0227-9 ORIGINAL PAPER Uncoupled autoata and pure Nash equilibria Yakov Babichenko Accepted: 2 February 200 / Published online: 20 March 200 Springer-Verlag

More information

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies OPERATIONS RESEARCH Vol. 52, No. 5, Septeber October 2004, pp. 795 803 issn 0030-364X eissn 1526-5463 04 5205 0795 infors doi 10.1287/opre.1040.0130 2004 INFORMS TECHNICAL NOTE Lost-Sales Probles with

More information

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

e-companion ONLY AVAILABLE IN ELECTRONIC FORM OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer

More information

Solutions of some selected problems of Homework 4

Solutions of some selected problems of Homework 4 Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next

More information

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay

A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer

More information

1 Identical Parallel Machines

1 Identical Parallel Machines FB3: Matheatik/Inforatik Dr. Syaantak Das Winter 2017/18 Optiizing under Uncertainty Lecture Notes 3: Scheduling to Miniize Makespan In any standard scheduling proble, we are given a set of jobs J = {j

More information

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes Graphical Models in Local, Asyetric Multi-Agent Markov Decision Processes Ditri Dolgov and Edund Durfee Departent of Electrical Engineering and Coputer Science University of Michigan Ann Arbor, MI 48109

More information

1 Bounding the Margin

1 Bounding the Margin COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost

More information

Inspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information

Inspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub

More information

Information Overload in a Network of Targeted Communication: Supplementary Notes

Information Overload in a Network of Targeted Communication: Supplementary Notes Inforation Overload in a Network of Targeted Counication: Suppleentary Notes Tiothy Van Zandt INSEAD 10 June 2003 Abstract These are suppleentary notes for Van Zandt 2003). They include certain extensions.

More information

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay

More information

Revealed Preference and Stochastic Demand Correspondence: A Unified Theory

Revealed Preference and Stochastic Demand Correspondence: A Unified Theory Revealed Preference and Stochastic Deand Correspondence: A Unified Theory Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk

More information

ASSIGNMENT BOOKLET Bachelor s Degree Programme (B.Sc./B.A./B.Com.) MATHEMATICAL MODELLING

ASSIGNMENT BOOKLET Bachelor s Degree Programme (B.Sc./B.A./B.Com.) MATHEMATICAL MODELLING ASSIGNMENT BOOKLET Bachelor s Degree Prograe (B.Sc./B.A./B.Co.) MTE-14 MATHEMATICAL MODELLING Valid fro 1 st January, 18 to 1 st Deceber, 18 It is copulsory to subit the Assignent before filling in the

More information

Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms

Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms Worst-case efficiency ratio in false-nae-proof cobinatorial auction echaniss Atsushi Iwasaki 1, Vincent Conitzer, Yoshifusa Oori 1, Yuko Sakurai 1, Taiki Todo 1, Mingyu Guo, and Makoto Yokoo 1 1 Kyushu

More information

Two-Player Kidney Exchange Game

Two-Player Kidney Exchange Game Two-Player Kidney Exchange Game Margarida Carvalho INESC TEC and Faculdade de Ciências da Universidade do Porto, Portugal margarida.carvalho@dcc.fc.up.pt Andrea Lodi DEI, University of Bologna, Italy andrea.lodi@unibo.it

More information

Revealed Preference with Stochastic Demand Correspondence

Revealed Preference with Stochastic Demand Correspondence Revealed Preference with Stochastic Deand Correspondence Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk Prasanta K. Pattanaik

More information

A Simple Model of Reliability, Warranties, and Price-Capping

A Simple Model of Reliability, Warranties, and Price-Capping International Journal of Business and Econoics, 2006, Vol. 5, No. 1, 1-16 A Siple Model of Reliability, Warranties, and Price-Capping Donald A. R. George Manageent School & Econoics, University of Edinburgh,

More information

On Constant Power Water-filling

On Constant Power Water-filling On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives

More information

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis

Experimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna

More information

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate The Siplex Method is Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010 Abstract In this note we prove that the classic siplex ethod with the ost-negativereduced-cost

More information

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x)

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x) 7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not

More information

Multi-Dimensional Hegselmann-Krause Dynamics

Multi-Dimensional Hegselmann-Krause Dynamics Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory

More information

Many-to-Many Matching Problem with Quotas

Many-to-Many Matching Problem with Quotas Many-to-Many Matching Proble with Quotas Mikhail Freer and Mariia Titova February 2015 Discussion Paper Interdisciplinary Center for Econoic Science 4400 University Drive, MSN 1B2, Fairfax, VA 22030 Tel:

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

arxiv: v1 [cs.ds] 17 Mar 2016

arxiv: v1 [cs.ds] 17 Mar 2016 Tight Bounds for Single-Pass Streaing Coplexity of the Set Cover Proble Sepehr Assadi Sanjeev Khanna Yang Li Abstract arxiv:1603.05715v1 [cs.ds] 17 Mar 2016 We resolve the space coplexity of single-pass

More information

Tight Information-Theoretic Lower Bounds for Welfare Maximization in Combinatorial Auctions

Tight Information-Theoretic Lower Bounds for Welfare Maximization in Combinatorial Auctions Tight Inforation-Theoretic Lower Bounds for Welfare Maxiization in Cobinatorial Auctions Vahab Mirrokni Jan Vondrák Theory Group, Microsoft Dept of Matheatics Research Princeton University Redond, WA 9805

More information

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds

More information

The impact of online sales on centralised and decentralised dual-channel supply chains

The impact of online sales on centralised and decentralised dual-channel supply chains European J. Industrial Engineering, Vol. 12, No. 1, 2018 67 The ipact of online sales on centralised and decentralised dual-channel supply chains Ilkyeong Moon Departent of Industrial Engineering, Seoul

More information

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering

More information

Interactive Markov Models of Evolutionary Algorithms

Interactive Markov Models of Evolutionary Algorithms Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary

More information

Hybrid System Identification: An SDP Approach

Hybrid System Identification: An SDP Approach 49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The

More information

On the Existence of Pure Nash Equilibria in Weighted Congestion Games

On the Existence of Pure Nash Equilibria in Weighted Congestion Games MATHEMATICS OF OPERATIONS RESEARCH Vol. 37, No. 3, August 2012, pp. 419 436 ISSN 0364-765X (print) ISSN 1526-5471 (online) http://dx.doi.org/10.1287/oor.1120.0543 2012 INFORMS On the Existence of Pure

More information

Chapter 6 1-D Continuous Groups

Chapter 6 1-D Continuous Groups Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:

More information

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and

More information

Deviation from an agreement to set high prices has - a short-term gain: increased profit today - a long-term loss: deviation by the others later on

Deviation from an agreement to set high prices has - a short-term gain: increased profit today - a long-term loss: deviation by the others later on Dynaic oligopoly theory Collusion price coordination Illegal in ost countries - Explicit collusion not feasible - Legal exeptions Recent EU cases - Switchgears approx 750 ill Euros in fines (January 007)

More information

1 Proof of learning bounds

1 Proof of learning bounds COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a

More information

Curious Bounds for Floor Function Sums

Curious Bounds for Floor Function Sums 1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International

More information

3.8 Three Types of Convergence

3.8 Three Types of Convergence 3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to

More information

Regret Matching with Finite Memory

Regret Matching with Finite Memory Regret Matching with Finite Meory Rene Saran Maastricht University, Maastricht, The Netherlands Roberto Serrano Brown University, Providence, U.S.A. IMDEA Social Sciences Institute, Madrid, Spain This

More information

Constrained Consensus and Optimization in Multi-Agent Networks arxiv: v2 [math.oc] 17 Dec 2008

Constrained Consensus and Optimization in Multi-Agent Networks arxiv: v2 [math.oc] 17 Dec 2008 LIDS Report 2779 1 Constrained Consensus and Optiization in Multi-Agent Networks arxiv:0802.3922v2 [ath.oc] 17 Dec 2008 Angelia Nedić, Asuan Ozdaglar, and Pablo A. Parrilo February 15, 2013 Abstract We

More information

Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence

Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence Best Ar Identification: A Unified Approach to Fixed Budget and Fixed Confidence Victor Gabillon Mohaad Ghavazadeh Alessandro Lazaric INRIA Lille - Nord Europe, Tea SequeL {victor.gabillon,ohaad.ghavazadeh,alessandro.lazaric}@inria.fr

More information

Taming the Matthew Effect in Online Markets with Social Influence

Taming the Matthew Effect in Online Markets with Social Influence Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence AAAI-17 Taing the Matthew Effect in Online Markets with Social Influence Franco Berbeglia Carnegie Mellon University fberbegl@andrewcuedu

More information

Optimal Pigouvian Taxation when Externalities Affect Demand

Optimal Pigouvian Taxation when Externalities Affect Demand Optial Pigouvian Taxation when Externalities Affect Deand Enda Patrick Hargaden Departent of Econoics University of Michigan enda@uich.edu Version of August 2, 2015 Abstract Purchasing a network good such

More information

Lecture 21. Interior Point Methods Setup and Algorithm

Lecture 21. Interior Point Methods Setup and Algorithm Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and

More information

Optimum Value of Poverty Measure Using Inverse Optimization Programming Problem

Optimum Value of Poverty Measure Using Inverse Optimization Programming Problem International Journal of Conteporary Matheatical Sciences Vol. 14, 2019, no. 1, 31-42 HIKARI Ltd, www.-hikari.co https://doi.org/10.12988/ijcs.2019.914 Optiu Value of Poverty Measure Using Inverse Optiization

More information

Now multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get:

Now multiply the left-hand-side by ω and the right-hand side by dδ/dt (recall ω= dδ/dt) to get: Equal Area Criterion.0 Developent of equal area criterion As in previous notes, all powers are in per-unit. I want to show you the equal area criterion a little differently than the book does it. Let s

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths

More information

On the Analysis of the Quantum-inspired Evolutionary Algorithm with a Single Individual

On the Analysis of the Quantum-inspired Evolutionary Algorithm with a Single Individual 6 IEEE Congress on Evolutionary Coputation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-1, 6 On the Analysis of the Quantu-inspired Evolutionary Algorith with a Single Individual

More information

A note on the multiplication of sparse matrices

A note on the multiplication of sparse matrices Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani

More information

Applying Genetic Algorithms to Solve the Fuzzy Optimal Profit Problem

Applying Genetic Algorithms to Solve the Fuzzy Optimal Profit Problem JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 8, 563-58 () Applying Genetic Algoriths to Solve the Fuzzy Optial Profit Proble FENG-TSE LIN AND JING-SHING YAO Departent of Applied Matheatics Chinese Culture

More information

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science A Better Algorith For an Ancient Scheduling Proble David R. Karger Steven J. Phillips Eric Torng Departent of Coputer Science Stanford University Stanford, CA 9435-4 Abstract One of the oldest and siplest

More information

Fairness via priority scheduling

Fairness via priority scheduling Fairness via priority scheduling Veeraruna Kavitha, N Heachandra and Debayan Das IEOR, IIT Bobay, Mubai, 400076, India vavitha,nh,debayan}@iitbacin Abstract In the context of ulti-agent resource allocation

More information

PAPER Approach to the Unit Maintenance Scheduling Decision Using Risk Assessment and Evolution Programming Techniques

PAPER Approach to the Unit Maintenance Scheduling Decision Using Risk Assessment and Evolution Programming Techniques 1900 PAPER Approach to the Unit Maintenance Scheduling Decision Using Risk Assessent and Evolution Prograing Techniques Chen-Sung CHANG a), Meber SUMMARY This paper applies the Evolutionary Prograing (EP)

More information

Support Vector Machines MIT Course Notes Cynthia Rudin

Support Vector Machines MIT Course Notes Cynthia Rudin Support Vector Machines MIT 5.097 Course Notes Cynthia Rudin Credit: Ng, Hastie, Tibshirani, Friedan Thanks: Şeyda Ertekin Let s start with soe intuition about argins. The argin of an exaple x i = distance

More information

INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN

INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN V.A. Koarov 1, S.A. Piyavskiy 2 1 Saara National Research University, Saara, Russia 2 Saara State Architectural University, Saara, Russia Abstract. This article

More information

Physically Based Modeling CS Notes Spring 1997 Particle Collision and Contact

Physically Based Modeling CS Notes Spring 1997 Particle Collision and Contact Physically Based Modeling CS 15-863 Notes Spring 1997 Particle Collision and Contact 1 Collisions with Springs Suppose we wanted to ipleent a particle siulator with a floor : a solid horizontal plane which

More information

Lecture October 23. Scribes: Ruixin Qiang and Alana Shine

Lecture October 23. Scribes: Ruixin Qiang and Alana Shine CSCI699: Topics in Learning and Gae Theory Lecture October 23 Lecturer: Ilias Scribes: Ruixin Qiang and Alana Shine Today s topic is auction with saples. 1 Introduction to auctions Definition 1. In a single

More information

MULTIAGENT Resource Allocation (MARA) is the

MULTIAGENT Resource Allocation (MARA) is the EDIC RESEARCH PROPOSAL 1 Designing Negotiation Protocols for Utility Maxiization in Multiagent Resource Allocation Tri Kurniawan Wijaya LSIR, I&C, EPFL Abstract Resource allocation is one of the ain concerns

More information

Stochastic Machine Scheduling with Precedence Constraints

Stochastic Machine Scheduling with Precedence Constraints Stochastic Machine Scheduling with Precedence Constraints Martin Skutella Fakultät II, Institut für Matheatik, Sekr. MA 6-, Technische Universität Berlin, 0623 Berlin, Gerany skutella@ath.tu-berlin.de

More information

Polygonal Designs: Existence and Construction

Polygonal Designs: Existence and Construction Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G

More information

A New Model for Selfish Routing

A New Model for Selfish Routing A New Model for Selfish Routing Thoas Lücking Marios Mavronicolas Burkhard Monien Manuel Rode Abstract In this work, we introduce and study a new, potentially rich odel for selfish routing over non-cooperative

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Notes for EE7C (Spring 018: Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee7c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee7c@berkeley.edu October 15,

More information

CONVERGENCE OF PRICE PROCESSES UNDER TWO DYNAMIC DOUBLE AUCTIONS

CONVERGENCE OF PRICE PROCESSES UNDER TWO DYNAMIC DOUBLE AUCTIONS Journal of Mechanis and Institution Design ISSN: 2399-844X (Print), 2399-8458 (Online) DOI:10.22574/jid.2016.12.001 CONVERGENCE OF PRICE PROCESSES UNDER TWO DYNAMIC DOUBLE AUCTIONS Jinpeng Ma Rutgers University,

More information

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October

More information

Economic Resource Balancing in Plant Design, Plant Expansion, or Improvement Projects

Economic Resource Balancing in Plant Design, Plant Expansion, or Improvement Projects Econoic Resource Balancing in lant Design, lant Expansion, or Iproveent rojects Dan Trietsch MSIS Departent University of Auckland New Zealand --------------------------------------------------------------------------------------------------------

More information

On Fuzzy Three Level Large Scale Linear Programming Problem

On Fuzzy Three Level Large Scale Linear Programming Problem J. Stat. Appl. Pro. 3, No. 3, 307-315 (2014) 307 Journal of Statistics Applications & Probability An International Journal http://dx.doi.org/10.12785/jsap/030302 On Fuzzy Three Level Large Scale Linear

More information

On the Inapproximability of Vertex Cover on k-partite k-uniform Hypergraphs

On the Inapproximability of Vertex Cover on k-partite k-uniform Hypergraphs On the Inapproxiability of Vertex Cover on k-partite k-unifor Hypergraphs Venkatesan Guruswai and Rishi Saket Coputer Science Departent Carnegie Mellon University Pittsburgh, PA 1513. Abstract. Coputing

More information

NET Institute*

NET Institute* NET Institute* www.netinst.org Working Paper #07-5 Septeber 2007 undling and Copetition for Slots Doh-Shin Jeon Universitat Popeu Fabra Doenico Menicucci Università degli Studi di Firenze * The Networks,

More information

An Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control

An Extension to the Tactical Planning Model for a Job Shop: Continuous-Time Control An Extension to the Tactical Planning Model for a Job Shop: Continuous-Tie Control Chee Chong. Teo, Rohit Bhatnagar, and Stephen C. Graves Singapore-MIT Alliance, Nanyang Technological Univ., and Massachusetts

More information

Introduction to Discrete Optimization

Introduction to Discrete Optimization Prof. Friedrich Eisenbrand Martin Nieeier Due Date: March 9 9 Discussions: March 9 Introduction to Discrete Optiization Spring 9 s Exercise Consider a school district with I neighborhoods J schools and

More information

Adapting the Pheromone Evaporation Rate in Dynamic Routing Problems

Adapting the Pheromone Evaporation Rate in Dynamic Routing Problems Adapting the Pheroone Evaporation Rate in Dynaic Routing Probles Michalis Mavrovouniotis and Shengxiang Yang School of Coputer Science and Inforatics, De Montfort University The Gateway, Leicester LE1

More information

Implementing the Wisdom of Waze

Implementing the Wisdom of Waze Ipleenting the Wisdo of Waze Shoshana Vasseran Harvard University svasseran@fas.harvard.edu Michal Feldan Tel Aviv University ichal.feldan@cs.tau.ac.il Avinatan Hassidi Bar Ilan University avinatanh@gail.co

More information

The Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate

The Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate The Siplex and Policy-Iteration Methods are Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye April 20, 2010; revised Noveber 30, 2010 Abstract We prove that the classic

More information

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents

More information

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL

More information

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.

A := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint. 59 6. ABSTRACT MEASURE THEORY Having developed the Lebesgue integral with respect to the general easures, we now have a general concept with few specific exaples to actually test it on. Indeed, so far

More information

Midterm 1 Sample Solution

Midterm 1 Sample Solution Midter 1 Saple Solution NOTE: Throughout the exa a siple graph is an undirected, unweighted graph with no ultiple edges (i.e., no exact repeats of the sae edge) and no self-loops (i.e., no edges fro a

More information

Department of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China

Department of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China 6th International Conference on Machinery, Materials, Environent, Biotechnology and Coputer (MMEBC 06) Solving Multi-Sensor Multi-Target Assignent Proble Based on Copositive Cobat Efficiency and QPSO Algorith

More information

Handout 7. and Pr [M(x) = χ L (x) M(x) =? ] = 1.

Handout 7. and Pr [M(x) = χ L (x) M(x) =? ] = 1. Notes on Coplexity Theory Last updated: October, 2005 Jonathan Katz Handout 7 1 More on Randoized Coplexity Classes Reinder: so far we have seen RP,coRP, and BPP. We introduce two ore tie-bounded randoized

More information

The Methods of Solution for Constrained Nonlinear Programming

The Methods of Solution for Constrained Nonlinear Programming Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained

More information

Distributed Subgradient Methods for Multi-agent Optimization

Distributed Subgradient Methods for Multi-agent Optimization 1 Distributed Subgradient Methods for Multi-agent Optiization Angelia Nedić and Asuan Ozdaglar October 29, 2007 Abstract We study a distributed coputation odel for optiizing a su of convex objective functions

More information

The Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate

The Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate The Siplex and Policy-Iteration Methods are Strongly Polynoial for the Markov Decision Proble with a Fixed Discount Rate Yinyu Ye Departent of Manageent Science and Engineering, Stanford University, Stanford,

More information

Deflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007

Deflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007 Deflation of the I-O Series 1959-2. Soe Technical Aspects Giorgio Rapa University of Genoa g.rapa@unige.it April 27 1. Introduction The nuber of sectors is 42 for the period 1965-2 and 38 for the initial

More information

A Note on Online Scheduling for Jobs with Arbitrary Release Times

A Note on Online Scheduling for Jobs with Arbitrary Release Times A Note on Online Scheduling for Jobs with Arbitrary Release Ties Jihuan Ding, and Guochuan Zhang College of Operations Research and Manageent Science, Qufu Noral University, Rizhao 7686, China dingjihuan@hotail.co

More information

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points

More information

Homework 3 Solutions CSE 101 Summer 2017

Homework 3 Solutions CSE 101 Summer 2017 Hoework 3 Solutions CSE 0 Suer 207. Scheduling algoriths The following n = 2 jobs with given processing ties have to be scheduled on = 3 parallel and identical processors with the objective of iniizing

More information

A Markov Framework for the Simple Genetic Algorithm

A Markov Framework for the Simple Genetic Algorithm A arkov Fraework for the Siple Genetic Algorith Thoas E. Davis*, Jose C. Principe Electrical Engineering Departent University of Florida, Gainesville, FL 326 *WL/NGS Eglin AFB, FL32542 Abstract This paper

More information

Strategic Classification. Moritz Hardt Nimrod Megiddo Christos Papadimitriou Mary Wootters. November 24, 2015

Strategic Classification. Moritz Hardt Nimrod Megiddo Christos Papadimitriou Mary Wootters. November 24, 2015 Strategic Classification Moritz Hardt Nirod Megiddo Christos Papadiitriou Mary Wootters Noveber 24, 2015 arxiv:1506.06980v2 [cs.lg] 22 Nov 2015 Abstract Machine learning relies on the assuption that unseen

More information

The Inferential Complexity of Bayesian and Credal Networks

The Inferential Complexity of Bayesian and Credal Networks The Inferential Coplexity of Bayesian and Credal Networks Cassio Polpo de Capos,2 Fabio Gagliardi Cozan Universidade de São Paulo - Escola Politécnica 2 Pontifícia Universidade Católica de São Paulo cassio@pucsp.br,

More information

Málaga Economic Theory Research Center Working Papers

Málaga Economic Theory Research Center Working Papers Málaga Econoic Theory Research Center Working Papers Unequivocal Majority and Maskin-Monotonicity Pablo Aorós WP 2008-3 March 2008 Departaento de Teoría e Historia Econóica Facultad de Ciencias Econóicas

More information

ASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical

ASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul

More information

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal

More information

arxiv: v1 [math.nt] 14 Sep 2014

arxiv: v1 [math.nt] 14 Sep 2014 ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row

More information

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40

On Poset Merging. 1 Introduction. Peter Chen Guoli Ding Steve Seiden. Keywords: Merging, Partial Order, Lower Bounds. AMS Classification: 68W40 On Poset Merging Peter Chen Guoli Ding Steve Seiden Abstract We consider the follow poset erging proble: Let X and Y be two subsets of a partially ordered set S. Given coplete inforation about the ordering

More information