Pricing of Limit Orders in the Electronic Security Trading System Xetra


 Quentin Stevens
 2 years ago
 Views:
Transcription
1 Pricing of Limit Orders in the Electronic Security Trading System Xetra Li Xihao Bielefeld Graduate School of Economics and Management Bielefeld University, P.O. Box D Bielefeld, Germany April 2004 Abstract In this paper we propose a theoretical framework for the pricing in auctions of limit orders in the Xetra System, the Electronic Security Trading System operated by German Stock Exchange(Gruppe Deutsche Börse). The price determination process is described and the volume maximizing price is formulated with an existence proof for such a price in our theoretical framework. The fundamental trading principles in Xetra are investigated and the price in Xetra, called Xetra Price, is derived from the volume maximizing price. The author wants to thank Dr. Jan Wenzelburger for his patience and precious advice.
2 Pricing of Limit Orders in the Electronic Security Trading System Xetra 1 1 Introduction More and more security transactions are handled through electronic security trading platforms. For example, over 90% security transactions are executed through Xetra System maintained by German Stock Exchange(Deutsche Börse) in Germany. However, it appeals that only a few researches on the pricing mechanism have been done under the background of Xetra and other electronic security trading systems, e.g. Krybus (2001). The pricing mechanism in a stock market has been shown intuitively in Sharpe, Alexander & Bailey (1999), which states the pricing mechanism in a descriptive way without formal formulation. In this paper, we focus on providing a theoretical framework for the pricing mechanism of Xetra. To start up the analysis of the Xetra pricing mechanism we establish a theoretical structure of demand and supply schedules based on the market model distributed by German Stock Exchange (Gruppe Deutsche Börse 2003). 1 Xetra is an orderdriven system. Traders trade the securities by entering order specifications in which traders must specify the name of the security, the size of the order, the period of validity of the order, and the type of the order (e.g. buy or sell, limit order or market order). There are several types of orders which can be handled in Xetra: market orders, limit orders, markettolimit orders, stop orders and iceberg orders. In our paper, we focus on limit orders only. Limit order is a type of order in which a limit price is specified by the traders. A limit order is to be executed at its limit price or better. 2 Traders can enter orders in Xetra to buy or sell securities. Orders to sell securities are called Ask Orders (Asks in short). Orders to buy securities are called Bid Orders (Bids in short). Orders can be traded continuously or by auctions. In our paper we discuss the case of auctions only. The auction process is composed of three parts: the call phase, the price determination phase, and the order book balancing phase. During the call phase, traders enter orders and the Xetra System records all the orders tagged with an index of time priority in order books. There is one corresponding order book for each security. The call phase has a random end after a fixed minimum time period. It is followed by the price determination phase. Within the price determination phase, the Xetra System applies certain matching rules for determining the auction price for each security. With these rules, Xetra System determines a unique auction price as its trading price for each security when trades take place. We call this unique auction price the Xetra Price for each security. After the Xetra price has been 1 There are two language versions of the latest issuing of Market Model Brochure in Xetra 7.0 by German Stock Exchange: the English version and the German version. We use the English version as the basis of the description of the Xetra market model. 2 Orders in the following context are referred to as limit orders unless otherwise stated.
3 Pricing of Limit Orders in the Electronic Security Trading System Xetra 2 determined, the execution of matched orders is informed to each involved trader and confirmed with providing the participants with the complete settlement and transaction data. The order book balancing phase, which is for the securities without market imbalance information, will not be taken place if all bids and asks are fully executed. When not all orders are fully executed, there exists a difference between the aggregate volume of bids and the aggregate volume of asks, which is called surplus in Xetra. In the process of order book balancing, only the trading on the surplus is considered. Traders can enter orders to accept the surplus partially or fully in order to maximize the executable order volume. At the end of the auction process, all orders which were not or only partially executed are forwarded to the next possible trading. 2 Basic Model As described above, in each auction process the Xetra system collects all asks and bids for each security quoted by agents into one order book, and sums up all these bids and asks to determine a unique price called Xetra Price to ensure that the highest executable order volume is achieved and certain matching rules are satisfied with this price. To establish a theoretical framework for the limit order auction process in Xetra, we present the formal description of demand and supply schedules as well as some related definitions. It is assumed that there are finite numbers of securities in Xetra indexed by l {1,..., L}. For some security l, it is assumed that there are I traders with index i {1,..., I} who submit bids and J traders with index j {1,..., J} who submit asks into the corresponding order book during the call phase. I and J are strictly positive finite integers. 3 It is also assumed that each trader submits only one order, therefore, {1,..., I} is also the index set for bids and {1,..., J} for asks. In the price determination phase, Xetra faces the following demand and supply schedules. 2.1 Basic Concepts DemandtoBuy (Bids) Schedule Each bid i can be stated as a pricequantity pair (a i, d i ) and treated as an individual demand function. We define the individual demand function that represents a bid as a step function: L Di : R + R +, p d i 1 A D i (p) (1) 3 I = 0 or J = 0 implies that no trade takes place and no auction price exists. We omit this trivial case and only consider the case when I > 0 and J > 0.
4 Pricing of Limit Orders in the Electronic Security Trading System Xetra 3 where A D i = [0, a i ] and d i > 0 for every i = 1,..., I. 1 A D i (p) is the characteristic function such that: { 1 when p A D i, 1 A D i (p) := 0 when p R + \ A D i. d i is the amount that the agent wants to buy for this security, and a i is the highest price that this agent wants to pay for buying per unit of the security. Any price no higher than a i will trigger this bid to be executed. The aggregate demand function is defined as the sum of the individual demand functions: I Φ D : R + R +, p L D i (p). (2) Without loss of generality, let a I >... > a 2 > a 1 > 0, then we have the following lemma: Lemma 1. For a I >... > a 2 > a 1 > 0, the aggregate demand function Φ D (p) is a nonincreasing function. More specifically, Φ D (p) = i=1 I α i 1 Ai (p) (3) i=0 where α i = I k=i+1 d k, for i = 0, 1,..., I 1, α I = 0; and A 0 = [0, a 1 ], A i = (a i, a i+1 ], for i = 1,..., I 1, A I = (a I, + ). Proof : Since a I >... > a 2 > a 1 > 0, noticing that I i=0 A i = R + and A i A j = i, j {0,..., I} with i j, it is obvious that {A 0,..., A I } is the partition of R +. Considering the value of Φ D (p) on its domain R + is equivalent to considering the value of Φ D (p) on the partition {A 0,..., A I }. p A 0 implies that all bids are executable since A 0 = A D 1 A D 2... A D I. The corresponding aggregate bids volume is α 0 = I k=1 d k. p A i with i = 1,..., I 1 implies that bids from i + 1 to I are executable since A i A D k = for k = 1,..., i and A i A D i+1... A D I. The corresponding aggregate bids volume is α i = I k=i+1 d k with i = 1,..., I 1. p A I implies that no bids can be executable since A i A D k = for k = 1,..., I. The corresponding aggregate bids volume is α I = 0. Therefore, we obtain the specific form of the aggregate demand function. Observing d k > 0 for k = 1,..., I, since α i = I k=i+1 d k for i = 0, 1,..., I 1 and α I = 0, we have: α 0 > α 1 >... > α I = 0. (4) This implies that the aggregate demand function is a nonincreasing function. This proves this lemma.
5 Pricing of Limit Orders in the Electronic Security Trading System Xetra SupplytoSell (Asks) Schedule Each ask j can be stated as a pricequantity pair (b j, s j ) and treated as an individual supply function. We define the individual supply function that represents an ask as a step function which is analogous to the individual demand function: L S j (p) : R + R +, p s j 1 B S j (p) (5) where Bj S = [b j, ) and s j > 0 for every j = 1,..., J. 1 B S j (p) is the characteristic function such that: { 1 when p Bj S, 1 B S j (p) := 0 when p R + \ Bj S. s j is the amount that the agent wants to sell for this security, and b j is the lowest price that this agent wants to sell for each unit of the security. Any price that is no lower than b j will trigger this ask to be executed. The aggregate supply function is defined as: Φ S (p) : R + R +, p J L S j (p). (6) j=1 Without loss of generality, let b J following lemma: >... > b 2 > b 1 > 0, then we have the Lemma 2. For b J >... > b 2 > b 1 > 0, the aggregate supply function Φ S (p) is a nondecreasing function. More specifically, Φ S (p) = J β j 1 Bj (p) (7) j=0 where β 0 = 0, β j = j k=1 s k, for j = 1,..., J; and B 0 = [0, b 1 ), B j = [b j, b j+1 ), for j = 1,..., J 1, B J = [b J, + ). Proof : Since b J >... > b 2 > b 1 > 0, noticing that J j=0 B j = R + and B j B k = j, k {0,..., J} and k j, it is obvious that {B 0,..., B J } is the partition of R +. Considering the value of Φ S (p) on its domain R + is equivalent to considering the value of Φ S (p) on the partition {B 0,..., B J }. p B 0 implies that no asks can be executable since B 0 Bk S = for k = 1,..., J. The corresponding aggregate asks volume is β 0 = 0. p B j with j = 1,..., J 1 implies that asks from 1 to j are executable since B j Bk S = for k = j + 1,..., J, B j B1 S, and B j Bj S... B1 S with j > 1. The corresponding aggregate asks volume is β j = j k=1 s k.
6 Pricing of Limit Orders in the Electronic Security Trading System Xetra 5 p B J implies that all asks are executable. The corresponding aggregate asks volume is β J = J k=1 s k. Therefore, we obtain the specific form of the aggregate supply function. Observing s k > 0 for k = 1,..., J, since β 0 = 0 and β j = j k=1 s k for j = 1,..., J, we have: β J >... > β 1 > β 0 = 0 (8) This implies that the aggregate supply function is a nondecreasing function. Therefore, we have proved this lemma Executable Order Volume and Surplus Let p R +, when the aggregate demand Φ D (p) is greater than the aggregate supply Φ S (p), only part of Φ D (p) can be satisfied while all Φ S (p) could be executed and vice versa. This implies that only the minimum of Φ D (p) and Φ S (p) is executable. Therefore, the executable order volume is defined as the trading volume function: Φ V : R + R +, p min {Φ D (p), Φ S (p)}. (9) The highest executable order volume V max trading volume function defined by: is the maximum value of the V max := max {Φ V (p) p R + }. Notice that the existence of V max is trivial: the image of the trading volume function Φ V is a finite set because the images of Φ D and Φ S have finitely many values. Therefore, V max = max {Φ V (p) p R + } exists. For convenience of notation, we also define the set of volume maximizing prices as Ω := {p R + Φ V (p) = V max }. The excess demand for each p R + is as usual defined by the excess demand function: Φ Z (p) : R + R, p Φ D (p) Φ S (p). (10) The surplus in Xetra is defined as the positive difference between the aggregate demand Φ D (p) and the aggregate supply Φ S (p). The absolute value of the excess demand Φ Z (p) thus is the surplus. 2.2 Price Determination Phase Traders submit their bids and asks during the call phase. When an order enters into the order book, it is labelled with a time tag. Orders are executed by price/time priority in Xetra, thus the time tag attached in each order determines
7 Pricing of Limit Orders in the Electronic Security Trading System Xetra 6 the ranking of execution in the order book. Each order is corresponding to a position in the sequence of execution in the order book. After a minimum time period the call phase stops with a random end. The call phase is followed by the price determination phase. During the price determination phase, the order book is closed. New orders are not allowed to enter. Therefore, the status of the order book is given and fixed in this phase. In other words, all the bids (a i, d i ) i=1,...,i and asks (b j, s j ) j=1,...,j as well as their execution sequence in the order book are given. Given all the bids (a i, d i ) i=1,...,i and asks (b j, s j ) j=1,...,j, the Xetra Price P Xetra derived from the highest executable order volume prices is determined by the pricing mechanism using some specific matching rules. These matching rules are indicated in page 32 of German Stock Exchange (Gruppe Deutsche Börse 2003), which are the following: Rule 1: The auction price is the price with the highest executable order volume and the lowest surplus in the order book. Rule 2: If more than one candidate price satisfies Rule 1, there are two cases: Rule 2.1: If the surplus for the price satisfied with Rule 1 is on the demand side, then the auction price is stipulated according to the highest candidate price. Rule 2.2: If the surplus for the price satisfied with Rule 1 is on the supply side, then the auction price is stipulated according to the lowest candidate price. Rule 3: If more than one candidate price satisfies Rule 1 and Rule 2, a reference price P ref designated by Xetra is included as an additional criterion. 4 There are several cases with the reference price included. Rule 3.1: The auction price is the highest candidate price if the reference price is higher than the highest candidate price. Rule 3.2: The auction price is the lowest candidate price if the reference price is lower than the lowest candidate price. Rule 3.3: The auction price is equal to the reference price if the reference price lies between the highest candidate price and the lowest candidate price. Rule 4: If Rule 1 to Rule 3 fail, there exists no auction price. Notice that Rule 4 implies that there could be no executable order volume in Xetra, in this case V max = 0 and there exists no Xetra Price. First we provide a description of the set of volume maximizing prices in the following proposition: 4 This could be the case of the existence of a surplus of supply for one set of candidate prices and a surplus of demand for another set of candidate prices or the case of no surplus.
8 Pricing of Limit Orders in the Electronic Security Trading System Xetra 7 Proposition 1. If V max > 0, then Ω = [p, p], with p : = max {p R + Φ D (p) V max } (11) p : = min {p R + Φ S (p) V max } (12) Notice that p is the best bid price and p is the best ask price. When the best bid price is greater than the best ask price, that is p p, the order book is crossed and there exists some executable transaction. Analogously, p < p implies an uncrossed order book and no transaction takes place. Proof: In order to establish Proposition 1 the following lemma is needed. Lemma 3. If V max > 0, then p and p are well defined with p p. The proof of Lemma 3 is provided in the appendix. This lemma shows that there exists some strictly positive highest executable order volume only if the order book is crossed. We will show that Ω = [p, p] in two steps: STEP 1: To prove [p, p] Ω Since Φ S (p) is a nondecreasing function and Φ D (p) a nonincreasing function, we have: Φ S (p) Φ S (p) V max for p p, Φ D (p) Φ D (p) V max for p p. By definition of Φ V (p), we thus have: Φ V (p) V max for p [p, p]. Notice that V max = max {Φ V (p) p R + }, thus we have: Φ V (p) = V max when p [p, p]. This shows [p, p] Ω. STEP 2: To prove Ω [p, p] Let p Ω be arbitrary. By the definition of Ω and Φ V (p), we have: Φ V (p) = V max Φ S (p) V max and Φ D (p) V max p p and p p p [p, p] Thus, we have proved that Ω [p, p]. Therefore, from Step 1 and Step 2 we conclude that: Ω = [p, p].
9 Pricing of Limit Orders in the Electronic Security Trading System Xetra 8 Notice that if p = p, Ω is reduced into one point, there exists a unique volume maximizing price. In this case the Xetra Price P Xetra is exactly: P Xetra = p = p. As we can see from Proposition 1, there could be more than one volume maximizing price for V max > 0. Therefore, some specific matching rules have to be applied for stipulating a unique auction price as the Xetra Price from the set of volume maximizing prices [p, p]. Deriving from the matching rules in Xetra, we have the following theorem to describe the price determination process in Xetra under the situation of a strictly positive highest executable order volume: Theorem 1. If V max > 0, then p when Φ Z [p,p] > 0, P Xetra = p when Φ Z [p,p] < 0, max{p, min{p ref, p}} otherwise. (13) Proof: In the case of V max > 0, only Rule 1 to Rule 3 are considered. By Proposition 1, Rule 1 states that Xetra Price must lie in Ω = [p, p], the set of volume maximizing prices. Rule 2.1 implies the Xetra Price is the highest price in Ω when the surplus for any price in Ω is on the demand side. Using excess demand function, Rule 2.1 can be restated as P Xetra = p when Φ Z [p,p] > 0. Analogous to Rule 2.1, Rule 2.2 implies P Xetra = p when Φ Z [p,p] < 0. When the surplus for any price in Ω is not satisfied with Rule 2, reference price P ref is introduced and Rule 3 is considered. Rule 3.1 states that P Xetra = p when P ref p. Rule 3.2 states that P Xetra = p when p P ref. Rule 3.3 states that P Xetra = P ref when p P ref p. Combining Rule 3.1 to Rule 3.3, we have P Xetra = max{p, min{p ref, p}} when the surplus for any price in Ω is not satisfied with Rule 2. Therefore, Rule 1 to Rule 3 indicates P Xetra is described in equation (13). Theorem 1 formalizes the pricing mechanism in Xetra. Given all the bids (a i, d i ) i I and asks (b j, s j ) j J, a unique price P Xetra is determined by this theorem. References Gruppe Deutsche Börse (2003): The Market Model Stock Trading for Xetra, Frankfurt a. M.
10 Pricing of Limit Orders in the Electronic Security Trading System Xetra 9 Krybus, S. (2001): Zum Handelssystem Xetra: Preisbildung, Mengenrationierung und Portfolioentscheidung im XetraAuktionsmodell, Master s thesis, Fakultäten für Mathematik und Wirtschaftswissenschaften, Bielefeld University. Sharpe, W., G. Alexander & J. Bailey (1999): Investments. Prentice Hall, 6 edn. A Appendix A.1 Proof of Lemma 3 We are going to prove Lemma 3 in this appendix. Proof: V max must be equal to some α i0 or some β j0. Therefore, we have two cases: CASE I: Let V max = α i0 > 0: Claim 1: There exists some j {1,..., J} such that β j 1 < α i0 β j. Claim 1 holds with the following argument: Since V max = α i0, there exists some p, such that Φ D ( p) Φ S ( p) and Φ V ( p) = min {Φ D ( p), Φ S ( p)} = Φ D ( p) = α i0 > 0. Let β j = Φ S( p). Notice that j > 0 since β j = Φ S( p) Φ D ( p) = α i0 > 0 = β 0. Let j = min{ j {1,..., J} β j α i0 }. We have β j 1 < α i0 β j since β j 1 < β j. Therefore, by assumption we have proved that claim 1 holds. By the definition of Φ D (p) and Φ S (p), there exists A i0 = (a i0, a i0 +1] corresponding to α i0 and B j = [b j, b j +1) corresponding to β j. In this case, V max = α i0. Noticing that Φ D (p) is a nonincreasing function, equation (11) can be rewritten as: p = max {p Φ D (p) α i0 } p = max{ p p A i0 } p = a i0 +1,
11 Pricing of Limit Orders in the Electronic Security Trading System Xetra 10 and noticing Φ S (p) is a nondecreasing function and α i0 β j from claim 1, equation (12) can be restated as: p = min {p Φ S (p) α i0 } p = min{ p Φ S (p) = β j } p = min{ p p B j } p = b j. Now we need to prove p p, that is to prove a i0 +1 b j. By contradiction, if p < p, that is a i0 +1 < b j. We have A i0 = (a i0, a i0 +1] [0, b j ) since 0 < a i0 < a i0 +1 < b j. Thus, α i0 Φ D (p) p [0,bj ). Also Φ S (p) p [0,bj ) = {β 0, β 1,..., β j 1} since [0, b j ) = B 0 B 1... B j 1. Since β j 1 < α i0 β j and β j 1 >... > β 1 > β 0 = 0, we have α i0 > β j 1 >... > β 0. Thus, by definition of Φ V (p), we have Φ V (p) p [0,bj ) < α i0. Hence, Φ V (p) p Ai0 < α i0 since A i0 [0, b j ). This contradicts V max = α i0 since β j 1 < α i0. CASE II: Let V max = β j0 > 0: Claim 2: There exists some i {0, 1,..., I 1} such that α i +1 < β j0 α i. Claim 2 holds with the following argument: Since V max = β j0, there exists some p, such that Φ S ( p) Φ D ( p) and Φ V ( p) = min {Φ D ( p), Φ S ( p)} = Φ S ( p) = β j0 > 0. Let αĩ = Φ D ( p). Notice that ĩ < I since αĩ = Φ D ( p) Φ S ( p) = β j0 > 0 = α I. Let i = max{ĩ {0, 1,..., I 1} αĩ β j0 }. We have α i +1 < β j0 α i since α i < α i +1. Therefore, by assumption we have proved that claim 2 holds. By the definition of Φ D (p) and Φ S (p), there exists B j0 = (b j0, b j0 +1] corresponding to β j0 and A i = [a i, a i +1) corresponding to α i. In this case, V max = β j0. Noticing that Φ D (p) is a nonincreasing function and α i +1 < β j0 α i from claim 2, equation (11) can be rewritten as: p = max {p Φ D (p) β j0 } p = max{ p Φ D (p) = α i } p = max{ p p A i } p = a i +1,
12 Pricing of Limit Orders in the Electronic Security Trading System Xetra 11 and noticing that Φ S (p) is a nondecreasing function, equation (12) can restated as: p = min {p Φ S (p) β j0 } p = min{ p p B j0 } p = b j0. Now we need to prove p p, that is to prove a i +1 b j0. By contradiction, if p < p, that is a i +1 < b j0, we have B j0 = (b j0, b j0 +1] (a i +1, + ) since a i +1 < b j0 < b j0 +1 < +. Thus, β j0 Φ S (p) p (ai +1,+ ). Also Φ D (p) p (ai +1,+ ) {α i +1,..., α I } since (a i +1, + ) = A i +1 A I. Since α i +1 < β j0 α i and α i +1 >... > α I = 0, we have β j0 > α i +1 >... > α I. Thus, by definition of Φ V (p), we have Φ V (p) p (ai +1,+ ) < β j0. Hence, Φ V (p) p Bj0 < β j0 since B j0 (a i +1, + ). This contradicts V max = β j0 since α i +1 < β j0. From CASE I and CASE II, we have proved Lemma 3.
Microeconomic Foundation of Investment Decisions for Electronic Security Trading Systems
Microeconomic Foundation of Investment Decisions for Electronic Security Trading Systems Inauguraldissertation zur Erlangung des Grades eines Doktors der Wirtschaftsswissenschaften (Dr. rer. pol.) an der
More informationChapter 7. Sealedbid Auctions
Chapter 7 Sealedbid Auctions An auction is a procedure used for selling and buying items by offering them up for bid. Auctions are often used to sell objects that have a variable price (for example oil)
More informationAuction Market System in Electronic Security Trading Platform
Auction Market System in Electronic Security Trading Platform Li ihao Bielefeld Graduate School of Economics and Management Discussion Paper: May 11, 2010 Abstract Under the background of the electronic
More informationSOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the nonnegative
More informationDetermination of the normalization level of database schemas through equivalence classes of attributes
Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,
More informationAPPLICATIONS OF THE ORDER FUNCTION
APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and
More informationIrreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients
DOI: 10.2478/auom20140007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca
More information4. CLASSES OF RINGS 4.1. Classes of Rings class operator Aclosed Example 1: product Example 2:
4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets
More informationOnline and Offline Selling in Limit Order Markets
Online and Offline Selling in Limit Order Markets Kevin L. Chang 1 and Aaron Johnson 2 1 Yahoo Inc. klchang@yahooinc.com 2 Yale University ajohnson@cs.yale.edu Abstract. Completely automated electronic
More informationPermutation Betting Markets: Singleton Betting with Extra Information
Permutation Betting Markets: Singleton Betting with Extra Information Mohammad Ghodsi Sharif University of Technology ghodsi@sharif.edu Hamid Mahini Sharif University of Technology mahini@ce.sharif.edu
More informationMOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu
Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing
More informationDesignated Sponsor Guide. Version 10.0
Guide Version 10.0 Guide Table of Content Page I Table of Content 1 on Xetra... 1 2 Admission requirements for s... 1 3 necessity for continuous trading... 2 3.1 Xetra Liquidity Measure (XLM)... 3 3.2
More informationAlgo Flagging How to meet the regulatory requirements? Member communication on Algo Flagging according to the German HFT Act
Algo Flagging How to meet the regulatory requirements? Member communication on Algo Flagging according to the German HFT Act Version 1.2 March 2014 1 Agenda 1. Motivation 2. Legal background 3. Guidelines
More informationNotes: Chapter 2 Section 2.2: Proof by Induction
Notes: Chapter 2 Section 2.2: Proof by Induction Basic Induction. To prove: n, a W, n a, S n. (1) Prove the base case  S a. (2) Let k a and prove that S k S k+1 Example 1. n N, n i = n(n+1) 2. Example
More informationGambling Systems and MultiplicationInvariant Measures
Gambling Systems and MultiplicationInvariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously
More informationWald s Identity. by Jeffery Hein. Dartmouth College, Math 100
Wald s Identity by Jeffery Hein Dartmouth College, Math 100 1. Introduction Given random variables X 1, X 2, X 3,... with common finite mean and a stopping rule τ which may depend upon the given sequence,
More informationPartitioning edgecoloured complete graphs into monochromatic cycles and paths
arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edgecoloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationx if x 0, x if x < 0.
Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the
More informationProblem Set I: Preferences, W.A.R.P., consumer choice
Problem Set I: Preferences, W.A.R.P., consumer choice Paolo Crosetto paolo.crosetto@unimi.it Exercises solved in class on 18th January 2009 Recap:,, Definition 1. The strict preference relation is x y
More information1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let
Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as
More informationCall Price as a Function of the Stock Price
Call Price as a Function of the Stock Price Intuitively, the call price should be an increasing function of the stock price. This relationship allows one to develop a theory of option pricing, derived
More informationThe MarketClearing Model
Chapter 5 The MarketClearing Model Most of the models that we use in this book build on two common assumptions. First, we assume that there exist markets for all goods present in the economy, and that
More informationChapter 7 ELECTRICITY PRICES IN A GAME THEORY CONTEXT. 1. Introduction. Mireille Bossy. Geert Jan Olsder Odile Pourtallier Etienne Tanré
Chapter 7 ELECTRICITY PRICES IN A GAME THEORY CONTEXT Mireille Bossy Nadia Maïzi Geert Jan Olsder Odile Pourtallier Etienne Tanré Abstract We consider a model of an electricity market in which S suppliers
More information4: SINGLEPERIOD MARKET MODELS
4: SINGLEPERIOD MARKET MODELS Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2015 B. Goldys and M. Rutkowski (USydney) Slides 4: SinglePeriod Market
More informationOn the Efficiency of Competitive Stock Markets Where Traders Have Diverse Information
Finance 400 A. Penati  G. Pennacchi Notes on On the Efficiency of Competitive Stock Markets Where Traders Have Diverse Information by Sanford Grossman This model shows how the heterogeneous information
More informationHomework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
More informationCPC/CPA Hybrid Bidding in a Second Price Auction
CPC/CPA Hybrid Bidding in a Second Price Auction Benjamin Edelman Hoan Soo Lee Working Paper 09074 Copyright 2008 by Benjamin Edelman and Hoan Soo Lee Working papers are in draft form. This working paper
More informationSCORE SETS IN ORIENTED GRAPHS
Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in
More informationAuction Market System in Electronic Security Trading Platform
MPRA Munich Personal RePEc Archive Auction Market System in Electronic Security Trading Platform i Hao Li Department of Economics and Social Sciences (DiSES) 2012 Online at http://mpra.ub.unimuenchen.de/43183/
More informationMultiunit auctions with budgetconstrained bidders
Multiunit auctions with budgetconstrained bidders Christian Borgs Jennifer Chayes Nicole Immorlica Mohammad Mahdian Amin Saberi Abstract We study a multiunit auction with multiple agents, each of whom
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationOnline Appendix to. Stability and Competitive Equilibrium in Trading Networks
Online Appendix to Stability and Competitive Equilibrium in Trading Networks John William Hatfield Scott Duke Kominers Alexandru Nichifor Michael Ostrovsky Alexander Westkamp Abstract In this appendix,
More informationA dynamic auction for multiobject procurement under a hard budget constraint
A dynamic auction for multiobject procurement under a hard budget constraint Ludwig Ensthaler Humboldt University at Berlin DIW Berlin Thomas Giebe Humboldt University at Berlin March 3, 2010 Abstract
More informationRegret and Rejoicing Effects on Mixed Insurance *
Regret and Rejoicing Effects on Mixed Insurance * Yoichiro Fujii, Osaka Sangyo University Mahito Okura, Doshisha Women s College of Liberal Arts Yusuke Osaki, Osaka Sangyo University + Abstract This papers
More informationThe Relative Worst Order Ratio for OnLine Algorithms
The Relative Worst Order Ratio for OnLine Algorithms Joan Boyar 1 and Lene M. Favrholdt 2 1 Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark, joan@imada.sdu.dk
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
More informationA Simple Model of Price Dispersion *
Federal Reserve Bank of Dallas Globalization and Monetary Policy Institute Working Paper No. 112 http://www.dallasfed.org/assets/documents/institute/wpapers/2012/0112.pdf A Simple Model of Price Dispersion
More informationBest Monotone Degree Bounds for Various Graph Parameters
Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationMinimizing the Number of Machines in a UnitTime Scheduling Problem
Minimizing the Number of Machines in a UnitTime Scheduling Problem Svetlana A. Kravchenko 1 United Institute of Informatics Problems, Surganova St. 6, 220012 Minsk, Belarus kravch@newman.basnet.by Frank
More informationLoad balancing of temporary tasks in the l p norm
Load balancing of temporary tasks in the l p norm Yossi Azar a,1, Amir Epstein a,2, Leah Epstein b,3 a School of Computer Science, Tel Aviv University, Tel Aviv, Israel. b School of Computer Science, The
More informationOn an antiramsey type result
On an antiramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider antiramsey type results. For a given coloring of the kelement subsets of an nelement set X, where two kelement
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationThe HenstockKurzweilStieltjes type integral for real functions on a fractal subset of the real line
The HenstockKurzweilStieltjes type integral for real functions on a fractal subset of the real line D. Bongiorno, G. Corrao Dipartimento di Ingegneria lettrica, lettronica e delle Telecomunicazioni,
More informationarxiv:1112.0829v1 [math.pr] 5 Dec 2011
How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly
More informationPACIFIC PRIVATE BANK LIMITED S BEST EXECUTION POLICY (ONLINE TRADING)
PACIFIC PRIVATE BANK LIMITED S BEST EXECUTION POLICY (ONLINE TRADING) 1 INTRODUCTION 1.1 This policy is not intended to create third party rights or duties that would not already exist if the policy had
More informationFairness in Routing and Load Balancing
Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationPage 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.
Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a
More informationDuplicating and its Applications in Batch Scheduling
Duplicating and its Applications in Batch Scheduling Yuzhong Zhang 1 Chunsong Bai 1 Shouyang Wang 2 1 College of Operations Research and Management Sciences Qufu Normal University, Shandong 276826, China
More informationInteger roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
More informationTHE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING
THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING 1. Introduction The BlackScholes theory, which is the main subject of this course and its sequel, is based on the Efficient Market Hypothesis, that arbitrages
More informationMechanisms for Fair Attribution
Mechanisms for Fair Attribution Eric Balkanski Yaron Singer Abstract We propose a new framework for optimization under fairness constraints. The problems we consider model procurement where the goal is
More informationHessisches Ministerium für Wirtschaft, Energie, Verkehr und Landesentwicklung Az.
Hessisches Ministerium für Wirtschaft, Energie, Verkehr und Landesentwicklung Az. Guidelines to the adherence to the requirement of the labelling of trading algorithms ( 16 subpara. 2 no. 3 Exchange Act
More informationNotes from Week 1: Algorithms for sequential prediction
CS 683 Learning, Games, and Electronic Markets Spring 2007 Notes from Week 1: Algorithms for sequential prediction Instructor: Robert Kleinberg 2226 Jan 2007 1 Introduction In this course we will be looking
More informationGROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.
Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the
More informationKolmogorov Complexity and the Incompressibility Method
Kolmogorov Complexity and the Incompressibility Method Holger Arnold 1. Introduction. What makes one object more complex than another? Kolmogorov complexity, or programsize complexity, provides one of
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on realclosed fields These notes develop the algebraic background needed to understand the model theory of realclosed fields. To understand these notes, a standard graduate course in algebra is
More informationSection 3 Sequences and Limits, Continued.
Section 3 Sequences and Limits, Continued. Lemma 3.6 Let {a n } n N be a convergent sequence for which a n 0 for all n N and it α 0. Then there exists N N such that for all n N. α a n 3 α In particular
More informationSEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationMARKET STRUCTURE AND INSIDER TRADING. Keywords: Insider Trading, Stock prices, Correlated signals, Kyle model
MARKET STRUCTURE AND INSIDER TRADING WASSIM DAHER AND LEONARD J. MIRMAN Abstract. In this paper we examine the real and financial effects of two insiders trading in a static Jain Mirman model (Henceforth
More informationThe confidenceprobability semiring Günther J. Wirsching Markus Huber Christian Kölbl
UNIVERSITÄT AUGSBURG The confidenceprobability semiring Günther J. Wirsching Markus Huber Christian Kölbl Report 201004 April 2010 INSTITUT FÜR INFORMATIK D86135 AUGSBURG 2 Copyright c Günther J. Wirsching,
More informationNotes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
More informationResearch Article TwoPeriod Inventory Control with Manufacturing and Remanufacturing under Return Compensation Policy
Discrete Dynamics in Nature and Society Volume 2013, Article ID 871286, 8 pages http://dx.doi.org/10.1155/2013/871286 Research Article TwoPeriod Inventory Control with Manufacturing and Remanufacturing
More informationInterconnection Trading System. Exchange Traded Funds (ETFs) MARKET MODEL DESCRIPTION
Interconnection Trading System Exchange Traded Funds (ETFs) MARKET MODEL DESCRIPTION November 2011 TABLE OF CONTENTS 1. INTRODUCTION 3 1.1. Background 3 2. PRODUCTS 3 2.1. General product description 3
More informationSECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA
SECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA This handout presents the second derivative test for a local extrema of a Lagrange multiplier problem. The Section 1 presents a geometric motivation for the
More informationINDIAN INSTITUTE OF MANAGEMENT CALCUTTA WORKING PAPER SERIES. WPS No. 681/ September 2011
INDIAN INSTITUTE OF MANAGEMENT CALCUTTA WORKING PAPER SERIES WPS No. 681/ September 2011 Pricing InfrastructureasaService for Online Two Sided Platform Providers by Soumyakanti Chakraborty Assistant
More informationCS 522 Computational Tools and Methods in Finance Robert Jarrow Lecture 1: Equity Options
CS 5 Computational Tools and Methods in Finance Robert Jarrow Lecture 1: Equity Options 1. Definitions Equity. The common stock of a corporation. Traded on organized exchanges (NYSE, AMEX, NASDAQ). A common
More informationLecture 11: Sponsored search
Computational Learning Theory Spring Semester, 2009/10 Lecture 11: Sponsored search Lecturer: Yishay Mansour Scribe: Ben Pere, Jonathan Heimann, Alon Levin 11.1 Sponsored Search 11.1.1 Introduction Search
More information5. Factoring by the QF method
5. Factoring by the QF method 5.0 Preliminaries 5.1 The QF view of factorability 5.2 Illustration of the QF view of factorability 5.3 The QF approach to factorization 5.4 Alternative factorization by the
More information2.3 Scheduling jobs on identical parallel machines
2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed
More informationSubsets of Euclidean domains possessing a unique division algorithm
Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness
More informationCS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On wellordering and induction: (a) Prove the induction principle from the wellordering principle. (b) Prove the wellordering
More informationA Propositional Dynamic Logic for CCS Programs
A Propositional Dynamic Logic for CCS Programs Mario R. F. Benevides and L. Menasché Schechter {mario,luis}@cos.ufrj.br Abstract This work presents a Propositional Dynamic Logic in which the programs are
More informationEMPIRICAL MACRO PRODUC TION FUNCTIONS SOME METHODOLOGICAL
 SaBHBBI ^ m v > x S EMPIRICAL MACRO PRODUC TION FUNCTIONS SOME METHODOLOGICAL COMMENTS by Sören Wibe Umeå Economic Studies No. 153 UNIVERSITY OF UMEÅ 1985 ISSN 03481018  1  EMPIRICAL MACRO PR ODUCTION
More informationInduction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition
Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More informationApplied Algorithm Design Lecture 5
Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design
More informationSingle machine parallel batch scheduling with unbounded capacity
Workshop on Combinatorics and Graph Theory 21th, April, 2006 Nankai University Single machine parallel batch scheduling with unbounded capacity Yuan Jinjiang Department of mathematics, Zhengzhou University
More informationTAKEAWAY GAMES. ALLEN J. SCHWENK California Institute of Technology, Pasadena, California INTRODUCTION
TAKEAWAY GAMES ALLEN J. SCHWENK California Institute of Technology, Pasadena, California L INTRODUCTION Several games of Tf takeaway?f have become popular. The purpose of this paper is to determine the
More informationTrading Rules for the Automated Trading System XETRA (Exchange Electronic Trading)
Trading Rules for the Automated Trading System XETRA (Exchange Electronic Trading) 2.1 Trading Rules for the Automated Trading System, XETRA 22 May 2015 Page 1 of 19 I. General 1 Scope of Application (1)
More informationALGORITHMIC TRADING WITH MARKOV CHAINS
June 16, 2010 ALGORITHMIC TRADING WITH MARKOV CHAINS HENRIK HULT AND JONAS KIESSLING Abstract. An order book consists of a list of all buy and sell offers, represented by price and quantity, available
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationCHAPTER 3 Numbers and Numeral Systems
CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationThe degree, size and chromatic index of a uniform hypergraph
The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a kuniform hypergraph in which no two edges share more than t common vertices, and let D denote the
More informationTRADING RULES. A) Trading System
TRADING RULES A) Trading System The Emerge trading platform shall be made available on the capital market segment of NSEIL. The SME trading platform has some unique features as follows: Market Types SME
More informationMATHEMATICS OF FINANCE AND INVESTMENT
MATHEMATICS OF FINANCE AND INVESTMENT G. I. FALIN Department of Probability Theory Faculty of Mechanics & Mathematics Moscow State Lomonosov University Moscow 119992 g.falin@mail.ru 2 G.I.Falin. Mathematics
More informationFI/RU electricity exchange area setup
FI/RU electricity exchange area setup Daily routines at Nord Pool Spot Time (CET) Action 9:30 Transmission capacities published on NPS web Daily at 9:30 CET the relevant TSOs submit the available transmission
More informationWeek 5 Integral Polyhedra
Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory
More informationTiers, Preference Similarity, and the Limits on Stable Partners
Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider
More information