Towards Optimal Capacity Segmentation with Hybrid Cloud Pricing


 Lindsay Hardy
 2 years ago
 Views:
Transcription
1 Towards Opimal Capaciy Segmenaion wih Hybrid Cloud Pricing Wei Wang, Baochun Li, and Ben Liang Deparmen of Elecrical and Compuer Engineering Universiy of Torono Torono, ON M5S 3G4, Canada Absrac Cloud resources are usually priced in muliple markes wih differen service guaranees. For example, Amazon EC2 prices virual insances under hree pricing schemes he subscripion opion (a.k.a., Reserved Insances), he payasyougo offer (a.k.a., OnDemand Insances), and an aucionlike spo marke (a.k.a., Spo Insances) simulaneously. There arises a new problem of capaciy segmenaion: how can a provider allocae resources o differen caegories of pricing schemes, so ha he oal revenue is maximized? In his paper, we consider an EC2like pricing scheme wih radiional payasyougo pricing augmened by an aucion marke, where bidders periodically bid for resources and can use he insances for as long as hey wish, unil he clearing price exceeds heir bids. We show ha opimal periodic aucions mus follow he design of m+1price aucion wih seller s reservaion price. Theoreical analysis also suggess he connecions beween periodic aucions and EC2 spo marke. Furhermore, we formulae he opimal capaciy segmenaion sraegy as a Markov decision process over some demand predicion window. To miigae he high compuaional complexiy of he convenional dynamic programming soluion, we develop a nearopimal soluion ha has significanly lower complexiy and is shown o asympoically approach he opimal revenue. I. INTRODUCTION Cloud compuing ransforms a large par of he IT indusry by fulfilling he longheld ambiious vision of compuing as a uiliy. Users pay o access compuing resources delivered over he Inerne, jus as hey pay o use waer and elecriciy. Like oher uiliy providers, many cloud providers charge heir cusomers in a regular payasyougo manner 1], 2], 3], 4], 5], 6], 7]. A provider ses a saic or infrequenly updaed peruni price, and users pay for only wha hey use. Along wih he payasyougo offer, here are wo addiional pricing schemes widely adoped in cloud markes: he subscripion opion 2] and he spo marke 1]. In he former scheme, a user pays a oneime subscripion fee o reserve one uni of resource for a cerain period of ime. A user can use he reserved resource whenever i wans during he subscripion period, under a significanly discouned usage price. The spo marke, on he oher hand, is an aucionlike mechanism. Users periodically submi bids o he provider, who in urn poss a series of spo prices. Users gain resource access and can use he resources for as long as hey wish, unil he spo price rises above heir bids, a which ime hey are rejeced. Insead of exclusively selling compuing services via a Price Payasyougo demand Price Spo marke demand Cloud resources Subscripions Subscripion demand Fig. 1. The capaciy segmenaion problem: how do we allocae resources o each pricing model so ha he revenue is maximized? single pricing channel, many providers use muliple pricing schemes simulaneously o charge for cloud services. For example, boh payasyougo pricing and subscripion opion are offered in 2], 4], 7]. Amazon EC2, on he oher hand, leases virual insances hrough all hree pricing channels 1]. Compared wih leasing cloud resources via a single pricing channel, muliple caegories of pricing sraegies are more aracive o a provider for wo reasons. Firs, wih a combined pricing srucure, he deficiency of one business mode is compensaed by anoher. For example, he demand uncerainy of payasyougo pricing is compensaed by riskfree income from subscripion users bearing longerm usage commimen. Second, he use of muliple pricing caegories expands he marke demand by offering more flexible choices o accommodae differen ypes of users. For example, pricesensiive users who canno afford he payasyougo price now have a chance o gain access o resources by bidding in he spo marke. The coexisence of muliple pricing channels, as illusraed in Fig. 1, raises a new, and challenging, quesion o a provider: wih limied resources available, how do we allocae hem o each pricing channel so ha he overall revenue is maximized? To answer his quesion, in his paper, we consider he problem of capaciy segmenaion wih wo pricing models applied in parallel, i.e., he regular payasyougo offer and periodic aucions. The laer allows users o periodically bid for resources in a sequence of aucions. In each period, a uniform akeiorleavei price is posed o clear he marke. The winners can use he resources for as long as hey wish, unil he clearing price rises above heir bids. The provider s
2 problem is o opimally allocae is resources o he wo pricing channels, based on supply and demand, o maximize he obained revenue. We choose he aforemenioned wo pricing models as building blocks of he capaciy segmenaion problem for wo reasons. Firs, due o he upfron usage commimen borne by users, subscripion demand generaes longerm riskfree income o he provider. In his sense, subscripion requess are more preferred o providers 7] and are always fulfilled a he highes prioriy. We herefore focus only on he remaining wo pricing models. Second, given ha Amazon reveals no deailed informaion on how he spo price is deermined 1], i is unclear how he spo marke is operaed. We hence urn o periodic aucions as hey share similar pricing forms as he EC2 spo marke 1 (i.e., boh are bidbased). To he bes of our knowledge, we are he firs o consider such a capaciy segmenaion problem in cloud markes wih hybrid pricing. We make wo original conribuions in his paper. Firs, we show ha an opimal design for he aucion channel mus follow he form of he m+1price aucion wih seller s reservaion price. Conrary o he wellknown resul ha, in general, bidders end o underbid in a uniformprice aucion (including he m+1price aucion), we show ha, in cloud environmens, however, he m+1price aucion is essenially ruhful wih wodimensional bids. Ineresingly, such ruhfulness is also expeced in he EC2 spo marke. In his case, replacing Amazon s design wih periodic aucions does no change user behaviours, resuling in he same marke response. Second, we formulae he opimal capaciy segmenaion problem as a Markov decision process (MDP). However, opimally solving his MDP wih convenional dynamic programming is compuaionally prohibiive, especially for a large provider wih enormous capaciy. By uilizing some special bounding srucure of he opimizaion problem, we furher develop an approximae soluion ha significanly reduces he compuaional complexiy from O(C 3 ) o O(C 2 ), wih C being he capaciy of he provider. We show ha he proposed approximaion is asympoically opimal as he user demand becomes sufficienly high, which is naurally he case for a large cloud provider. This analyical resul, ogeher wih exensive simulaions, suggess ha he approximaion closely approaches he opimal soluion. The remainder of his paper is organized as follows. In Sec. II, we briefly survey he relaed work. Our model and noaions are inroduced in Sec. III. In Sec. IV, we characerize he revenue obained in he aucion marke, and presen an opimal design wih maximum revenue. We also discuss is connecions o he EC2 spo marke. In Sec. V, we firs presen raionales for he use of muliple pricing models. We hen show ha achieving opimal segmenaion is compuaionally prohibiive. For his reason, we presen an asympoically opimal 1 We emphasize ha periodic aucions are no equivalen o he EC2 spo marke. While spo users are priceakers unaware of how spo prices are produced, aucion bidders, on he oher hand, have full knowledge on pricing deails and can affec he clearing price via sraegic bidding. soluion where he compuaional complexiy is significanly reduced by idenifying some opimizaion srucures in he problem. Exensive simulaion sudies are presened in Sec. VI. Sec. VII concludes he paper. II. RELATED WORK Three pricing models are now widely adoped in cloud markes, i.e., he regular payasyougo offer, he subscripion opion, and he newly invened spo marke. The providers adverise ha having muliple pricing schemes benefis cloud users by lowering heir coss 1], 7]. Exising works also presen some user sraegies o swich beween differen pricing markes o cu he cos 8], 9]. However, lile has been addressed from he cloud provider s perspecive, on how heir resources should be allocaed o differen markes o maximize revenue. Relevan research works in he lieraure include 1], which invesigaes he resource allocaion problem in eiher saic pricing or variable pricing, by solving a saic opimizaion program, and 11], which presens a dynamic aucionbased model for resource allocaions in he grid sysem. None of hese works considers he coexisence of muliple differen pricing markes. We believe he key o solving he capaciy segmenaion problem lies in undersanding he EC2 spo marke. However, since Amazon reveals no deailed pricing informaion, i remains unclear how he spo price is deermined. Despie Amazon s claim ha he price is calculaed based on marke demand and supply 1], some recen works conjecure ha he price is in fac arificially se via some random process 9], 12]. In his paper, we consider periodic uniformprice aucions, as hey share similar pricing forms as he EC2 spo marke. Unlike general uniformprice aucions discussed in economics lieraure 13], 14], in he cloud environmen, parial fulfillmen is no acceped: a bidder is eiher rejeced or having all requesed insances 1] being fulfilled. For his reason, our design avoids he wellknown effec of demand reducion observed in general uniformprice aucions ha bidders have an incenive o bid lower han heir rue values 13], 14] and is proved o be ruhful wih wodimensional bids. We noe ha here exis some works in he lieraure of economics ha discuss a similar resource allocaion problem in he reail marke, where wo pricing channels are used o sell producs, he aucion marke and he regular payasyougo pricing 15], 16]. However, neiher he model nor he analysis applies o he cloud environmen. Firs, heir models are based on sales markes, where resources are sold o cusomers and will never be reclaimed and made available o ohers. In conras, cloud insances are leased o users and can be reused by ohers once he resources are released by previous owners. Second, heir analysis relies on a srong assumpion ha each cusomer is resriced o ask for only one uni of produc, which is clearly no he case for cloud users. We noe ha 15] furher assumes ha he seller capaciy is infinie. I is worh menioning ha opimal periodic aucions have also been sudied in he reail marke in 17], 18], bu he same
3 problems menioned above render hose works inapplicable in cloud markes. III. SYSTEM MODEL Suppose a cloud provider has allocaed a fixed capaciy C for a cerain ype of virual insances, i.e., a any given ime, up o C insances of ha ype can be hosed. All hese insances are leased in wo pricing channels, an aucion marke and a payasyougo marke, simulaneously. We ake discree ime horizons indexed by = 1, 2,... in he following analysis. A. User Model Payasyougo users. The payasyougo marke offers guaraneed services. Users can run heir insances for as long as hey wish, and are charged wha hey used based on a consan regular price p r. In paricular, denoe by i,j he running ime of insance j hosed for user i. User i is hen charged p r i,j for using ha insance. To make he analysis racable, we ake a echnical assumpion ha i,j s are i.i.d. exponenial. In discree seings, his implies ha i,j follows he geomeric disribuion wih p.m.f. P ( i,j = k) = q(1 q) k 1, where q is he probabiliy ha a currenly running insance will be erminaed by is user in he nex period. Therefore, he expeced overall paymen for using one insance is Ep r i,j ] = p r E i,j ] = p r /q. Alhough he i.i.d. exponenial insance running ime is a simple model and pracical user behaviours may no follow his paern, aking his echnical assumpion allows racable analysis and has been shown o give ineresing insighs ino pracical sysems. We also noe ha such exponenial resource usage ime is widely adoped in economics lieraures o analyze renal markes 19], 2]. Because p r is consan, payasyougo users have no purchasing sraegy as he aucion bidders have. We assume here are Rr insance requess received a ime, and if he available capaciy allocaed o he payasyougo marke is below Rr, some users do no receive heir requesed insances. The exac mechanism for user admission (e.g., firscome, firsserved) is unimporan o he problem under consideraion since he same price p r is charged for each insance. Users in he aucion marke. Insances purchased in he aucion marke offer no service guaranees and will be erminaed by he provider whenever he bid has been exceeded by he clearing price. Suppose a ime, here are Na bidders joining he aucion. Each bidder i (1 i Na) wishes o access n i insances and has a maximum affordable price v i, also known as he reservaion price, for using one insance a one period. User i hen submis a wodimensional bid (ri, b i ) requesing ri insances wih a bid price b i. Noe ha user i could sraegically misrepor is bid (i.e., b i v i or ri n i) as long as i is beneficial for her o do so. Afer all bids are colleced, he cloud provider runs he aucion and charges a akeiorleavei clearing price p a o all winners: each user i wih b i > p a (resp. b i < p a) eiher has is new requess fulfilled (resp. rejeced) or has is running insances coninued (resp. erminaed). Those wih b i = p a may or may no be acceped depending on he specific aucion mechanism. The value of p a is calculaed based on some specified mechanism ha is publicly known o all bidders. We herefore define user i s uiliy a ime as follows: { u i(ri, b ni v i) = i ri p a, if b i > p a and ri n i; (1), oherwise. Here, boh n i and v i are privae informaion known only o user i, and are disribued wih join p.d.f. f n,v and c.d.f. F n,v on he suppor 1, n], v]. The user i s problem is o find he opimal bid such ha he uiliy is maximized, i.e., max r i,b u i i (r i, b i ). I is worh menioning ha he aucion described above is subsanially differen from he uniformprice aucion considered in he lieraure of economics 13], 14], as bidders in he laer mechanism accep parial fulfillmen and have differen uiliy funcions oher han (1). B. The Problem of Opimal Capaciy Segmenaion The cloud provider aims o opimally allocae is available capaciy o boh he payasyougo and aucion markes, o maximize is obained revenue. Le he available capaciy a ime be C. In addiion o knowing he exac number of requess in he curren ime slo, we assume ha he provider may predic he demand in he near fuure: i knows he disribuions of Na τ (he user number in he aucion marke) and Rr τ (he oal requess in he payasyougo marke) for τ T = + w, wih w being some predicion window. Noe ha forecasing fuure demand has already been addressed in some lieraure 1], 21]. Given C a ime, denoe by Γ (C ) he maximum expeced aggregae revenue obained from o T. Le γ a (c) and γ r (c) be he revenues of allocaing c insances o he aucion and he regular payasyougo markes, respecively. The problem of opimal capaciy segmenaion is o find he opimal capaciy allocaions o he wo markes such ha he revenue colleced wihin he predicion window is maximized. This can be expressed in he following recursive form: Γ (C { ) = E max γa (Ca) + γ r (C Ca) Ca C + E C +1 Γ +1 (C +1 ) ]}], (2) where Ca is he capaciy allocaed o he aucion marke, and he boundary condiions are Γ T +1 (c) = for all c =, 1,..., C. Since he payasyougo price is infrequenly updaed 1], in his work we consider only he shorer imescale problem of capaciy segmenaion given a fixed p r. Then we have { pr c/q, if c R γ r (c) = r; p r Rr/q, oherwise. Noe ha a discussion on how o opimize p r can be conduced based on he proposed revenue maximizing mehod, bu i addiionally requires knowledge of he ye unknown supplydemand relaion and hence is lef open for fuure research. (3)
4 To deermine he value of C +1 in (2), we noe ha a ime, here are Ca insances allocaed o he aucion marke and C Ca insances held for he payasyougo users. Suppose ha righ before + 1, X of hem are erminaed by payasyougo users and are reurned o he sysem. As a resul, here are C +1 = Ca + X insances being available for new requess a he beginning of + 1. From he assumpion of he exponenial running ime as explained in Sec. IIIA, i is easy o see ha X follows a binomial disribuion wih P (X = k) = B(C Ca, k, q), where B(n, k, q) = ( n k) q k (1 q) n k. We rewrie (2) as Γ (C { ) = E max γa (Ca) + γ r (C Ca) Ca C + E X Γ +1 (C a + X) ]}]. (4) Noe ha he capaciy segmenaion problem is essenially formulaed as a Markov decision process. The cloud provider s problem is o solve (4) o find he opimal capaciy segmenaion poin Ca. I is worh menioning ha he capaciy segmenaion problem saed in (4) is nonrivial: Neiher marke is always more profiable han he oher. In he aucion marke, here may be highbid requess from users sarving for cloud resources, which can drive he aucion price above he regular payasyougo price (i.e., p a > p r ), making he aucion marke more profiable for a provider. Such phenomenon has indeed been observed in he real world: In EC2 pricing, he spo price occasionally exceeds he regular price 1]. A cloud provider has o dynamically segmen is capaciy o maximize is revenue. For now, problem (4) is sill no well defined. One quesion remains: how o design he opimal aucion marke o maximize he revenue γ a (Ca) given Ca insances are allocaed? We answer his quesion in he following secion. IV. OPTIMAL AUCTION DESIGN This secion addresses he quesion raised above. Given an allocaed capaciy C a, wha is he opimal design for he aucion marke described in Sec. III? We invesigae he srucure of he opimal aucion and characerize is revenue γ a (C a). We also discuss is connecions o Amazon EC2 Spo Insances. A. Preliminaries An aucion mechanism M is said o be ruhful if for every bidder, no maer how ohers behave, he opimal bidding sraegy is always o submi is rue bids. In our problem, his means ha for every i, u i (n i, v i ) u i (r i, b i ) for any (r i, b i ). By he Revelaion Principle 22], i suffices o focus only on ruhful aucion designs when revenue is of ineres. Lemma 1 characerizes he revenue of any ruhful aucions by exending he Revenue Equivalence Theorem 23] o he wodimensional domain. The proof is similar o 23] and is given in our echnical repor 24]. Lemma 1: Le v = (v i ) and n = (n i ). Denoe by γ M he revenue of a mechanism M wih wodimensional bids. Then for any ruhful M, we have N ] E n,v γ M ] = E n,v n i φ(v i )x i (n, v). (5) Here, φ(v i ) = v i 1 Fv(vi ni) f v(v i n i), and x i (n, v) akes he value or 1 depending on wheher user i loses or wins, respecively. Lemma 1 grealy simplifies he revenue analysis. I essenially indicaes ha he expeced revenue of a ruhful mechanism only depends on who is o win (i.e., he values of x i s), no wha hey pay (i.e., he value of p a). Besides, by (5), one could explain he value of φ(v i ) as he marginal revenue generaed by aucioning one insance o user i. This is also user i s expeced paymen of using one insance. Therefore, he expeced aucion revenue is calculaed as he sum of paymens colleced from all winning users. We now characerize he revenue of he aucion marke described in Sec. III. Wihou loss of generaliy, suppose bidders are sored in a decreasing order of heir bidding prices, i.e., v 1 v 2 v N a. We have he following proposiion. Proposiion 1: Suppose M is a ruhful aucion offering a uniform akeiorleavei price. Le m be he number of winning bidders 2. Then he expeced revenue of M is characerized as follows: m ] E n,v γ M ] = E n,v n i φ(v i ). (6) Proof: Since he aucion marke offers a uniform akeiorleavei price p a, every winning bidder i mus have v i p a. In his case, he op m bidders win he aucion, i.e., x i = 1 for i = 1, 2,..., m. Subsiuing his o (5) and applying Lemma 1, we see ha he saemen holds. Proposiion 1 essenially indicaes ha maximizing he aucion revenue is equivalen o maximizing he RHS of (6), subjec o he capaciy consrain: max m N a s.. m n i φ(v i ) m n i Ca. For mahemaical convenience, we ake he sandard regulariy assumpion ha φ( ) is increasing. This is no a resricive assumpion, as i generally holds for mos disribuions 23] and is widely adoped in he lieraure 13], 23], 25]. B. Opimal Aucion Marke Problem (7) can be opimally solved by a greedy algorihm: Sequenially accep bidders requess, from he op valued (i.e., he highes φ(v i )) o he boom, unil here is no longer capaciy for more. I suffices o assume ha all requess are posiively valued (φ(v i ) > ), as hose wih φ(v i ) will 2 The value of m depends on n and v. (7)
5 never be fulfilled. The opimal aucion marke, described in Algorihm 1, is designed based on he above process. Algorihm 1 Opimal Aucion Marke wih Capaciy C a 1. if N a r i C a hen 2. All bidders win (m = Na), wih p a = φ 1 () 3. else 4. Top m bidders win, wih p a = b m+1, where m r i Ca < m+1 r i 5. end if We noe ha Algorihm 1 adops he similar design of he canonical m+1price aucion, wih a difference ha a seller has a reservaion price φ 1 (). Though m+1price aucion is ruhful for he case where each bidder requess no more han one uni of he aucioned good 26], i is well known ha in general, he ruhfulness no longer holds when bidders have muliuni demands 13], 14]. However, we show ha for he specific problem considered in his paper, m+1price aucion is wodimensionally ruhful in boh n i and v i. To see his, we require he following lemma. Lemma 2 (Monooniciy): For every bidder i, fix all ohers submissions. Denoe by p a(b i, r i ) he clearing price when i bids (b i, r i ). Then for all b i (resp. r i ), p a(b i, r i ) is increasing w.r.. ri (resp. b i ). Proof: We explain he picorial proof hrough Figs. 2a and 2b. Firs we show ha p a is increasing w.r.. ri, i.e., p a(b i, r i ) p a(b i, r i + ) for all >. I suffices o consider he following wo cases. Case 1: Bidder i loses by requesing ri insances. Noe ha increasing a bidder s reques does no change is ranking (as hey are sored based on heir bid prices). I is easy o verify ha having his bidder requesing more insances, say, ri + insances, resuls in he same clearing price, i.e., p a(b i, r i ) = p a(b i, r i + ). Case 2: Bidder i wins by requesing ri insances. Suppose i now increases is reques by insances. Fig. 2a illusraes he changes of clearing price p a, from which we see ha having a winning bidder requesing more insances essenially raises he clearing price, i.e., p a(b i, r i ) p a(b i, r i + ). We nex prove ha p a is also increases w.r.. b i, i.e., p a(b i, r i ) p a(b i +, r i ) for all >. Sill, i suffices o consider wo cases below. Case 1: Bidder i loses by bidding b i. Suppose i now raises is bid by. We consider wo cases. (1) Bidder i wins by bidding b i +. This is shown in Fig. 2b, from which we see ha he clearing price is raised. (2) Bidder i loses by bidding b i +. In his case, if bidder i s new bid is used as he new clearing price (i.e., p a = b i + ), hen his new price mus be higher han he original one (because is value is updaed). Oherwise, he clearing price p a remains unchanged. In summary, p a(b i, r i ) p a(b i +, r i ) for all >. Case 2: Bidder i wins by bidding b i. In his case, raising he bid price has no effec on he clearing price he laer Bid price r i C a Bid price C a p a Capaciy Bid price r i + C a (a) Increasing ri raises he clearing price. r i b i + b i = p a Capaciy Bid price r i b i + C a (b) Increasing b i raises he clearing price. p a Capaciy p a > b i Capaciy Fig. 2. Effec of demand r i and bid price b i on he clearing price p a. remains unchanged wih he value equal o he m+1h highes bid, i.e., p a(b i, r i ) = p a(b i +, r i ). Lemma 2 reflecs he basic economic principle: Wih he same level of he supply, he marke price rises as he bidders demand increases. This monooniciy eliminaes he incenive of overbooking insances, as saed in Lemma 3. Lemma 3: For every bidder i, here is no advanage o overbook insances, i.e., given b i, u i (r i, b i ) u i (n i, b i ) for all r i > n i. Proof: I suffices o consider he case where bidder i wins by submiing (r i, b i ), wih r i > n i. In his case, b i p a(r i, b i) p a(n i, b i), (8) where he firs inequaliy holds since i wins by bidding (ri, b i ), while he second inequaliy is derived from Lemma 2. This implies ha i also wins by bidding (n i, b i ). As a resul, u i(r i, b i) = n i v i r ip i(r i, b i) n i v i n i p i(n i, b i) = u i(n i, b i). This concludes he proof. Since no user has he incenive o reques fewer insances han acually needed (oherwise, u i (r i, b i ) = because r i < n i ), Lemma 3 essenially indicaes ha users should always ruhfully repor heir n i value. This leads o he ruhfulness saemen as follows. Proposiion 2: Algorihm 1 is wodimensionally ruhful, i.e., u i (n i, v i ) u i (r i, b i ) for all (r i, b i ), i = 1, 2,..., N a. Proof: We consider all possible oucomes of bidding ruhfully or unruhfully. Since every bidder i chooses o ruhfully repor n i, any unruhful submission is of he form (n i, b i ) where b i v i. Suppose he unruhful submission leads o he bidder losing, hen he proposiional saemen rivially holds for b i. Therefore, in he following we only need o consider he case where he unruhful submission leads o he bidder winning. Suppose bidding ruhfully leads o he bidder winning, hen i is easy o verify ha p a(n i, b i ) = p a(n i, v i ) = p, where
6 p is eiher φ 1 () or b m+1, depending on wheher here is sufficien capaciy o accommodae all requess. As a resul, we see u i (n i, v i ) = u i (n i, b i ). On he oher hand, if bidding ruhfully leads o he bidder losing, hen p a(n i, v i ) v i. Since by changing he submission o (n i, b i ) user i wins, we mus have b i > v i. By Lemma 2, p a(n i, b i ) p a(n i, v i ) v i. Hence, u i (n i, b i ) = n i(v i p a(n i, b i )) = u i (n i, v i ). This concludes he proof. Inuiively, given ha all users repor n i ruhfully as dicaed by Lemma 3, he marke can be viewed as a second price aucion in erms of he bid price only, which is wellknown o be ruhful. We poin ou ha he wodimensional ruhfulness of his special case of m+1price aucion in our problem is due o he specific characerisics of cloud markes ha parial fulfillmen is no allowed. The revenue opimaliy of Algorihm 1 follows naurally from he proved ruhfulness (i.e., Proposiion 2): Proposiion 3: Among all mechanisms offering a uniform akeiorleavei price, Algorihm 1 is opimal in erms of revenue maximizaion. Proof: Since Algorihm 1 is ruhful, all bidders bid ri = n i and b i = v i. In his case, Algorihm 1 opimally solves problem (7). By Proposiion 1, his implies ha Algorihm 1 maximizes he revenue among all ruhful aucions offering uniform clearing prices. Due o he Revelaion Principle 22], imposing he ruhfulness o he aucion design does no hur he revenue. We herefore conclude ha he saemen generally holds. C. Opimal Revenue To derive he revenue obained from Algorihm 1, one has o deal wih wo cases, wih or wihou sufficien capaciy o accommodae all profiable requess. To combine boh cases in our subsequen discussion, we arificially inser a virual bidder o he marke, who requess an infinie amoun of insances a a price φ 1 (). Insering a virual bidder has no effec on he aucion resul, bu i significanly simplifies he revenue expression. Based on Algorihm 1, p a = v m+1, and γ a (Ca) m = v m+1 n i, where m n i Ca < m+1 n i. By Proposiion 1, we have Eγ a (Ca)] m = Ev m+1 n i] = E m n iφ(v i )]. Therefore, in expecaion, i is equivalen o wriing m γ a (c) = n i φ(v i ), (9) where m n i c < m+1 n i. In his sense, n i φ(v i ) can be viewed as he marginal revenue generaed by acceping he requess of bidder i. D. Connecions o EC2 Spo Marke I is ineresing o see some connecions beween he aucion marke discussed in his paper and he spo marke adoped by Amazon EC2 Spo Insances 1]. Similar o he aucion marke, spo users periodically submi bids (ri, b i ) o Amazon, requesing ri insances a a price b i. A uniform spo price p s is periodically posed by Amazon o charge he winners, i.e., hose who bid higher han he spo price (b i > p a). All winners can use he insances as long as he price does no rise above heir bids. Though similar in descripion, he pricing of Spo Insances is by no means an aucion marke. Since Amazon has revealed no deailed informaion regarding how he spo price p s is calculaed, here is no way for spo users o know wha p s is going o be, even wih he complee informaion of demand (i.e., oher users bids) and supply (i.e., he amoun of insances offered in he spo marke). This is no he case in a real aucion, where he mechanism deails are publicly known o every paricipan. We now invesigae he opimal bidding sraegy for Spo Insances. Wihou pricing deails, a valid approach for spo users is o view p s as a random variable, wih p.d.f. fs and c.d.f. Fs learned from he price hisory published by Amazon 1]. Suppose he uiliy defined for user i is similar o (1) wih he clearing price p a replaced by he spo price p s, i.e., u i(r i, b i) = { ni v i r i p s, if b i > p s and r i n i;, oherwise. The user s problem is o find he opimal bid so ha is expeced uiliy is maximized, i.e., max r i,b i E p s u i (r i, b i ). Proposiion 4: In he spo marke, he opimal bid for user i is o ruhfully submi (n i, v i ). Proof: Le A be he even ha i wins by bidding b i. Denoe by I X he indicaor funcion of even X. We have Eu i(ri, b i)] = P (A)(n i v i riep s A])I r i n i ] = F s(b i) n i v i r i b i v xf s(x)dx I r i n i. (1) I is easy o see ha bidding ri = n i dominaes all oher sraegies for every b i. Now subsiuing i back o (1) and applying he firsorder opimaliy condiions, we see ha he opimal bid price is v i. This concludes he proof. Inuiively, wihou knowing how he spo price reacs o differen submissions, no user has he incenive o sraegize over is bid. Therefore, by replacing a spo marke wih an aucion marke, he provider would expec he same user behaviour. In oher words, he wo markes are equivalen in erms of he marke reacion. Considering ha boh are of similar pricing srucures (i.e., boh are bidbased), we believe ha he aucion marke offers a good simulaion o he spo marke, and he analysis of he former sheds ligh on he laer. V. OPTIMAL CAPACITY SEGMENTATION Having characerized he revenue for he aucion marke, we are now ready o invesigae he marke segmenaion problem saed in (4). Before delving ino he deailed echnical discussions, we jusify he moivaion of having wo coexising markes by aking a look a he simples scenario where no fuure informaion is available, i.e., he predicion window w is.
7 A. Moivaions for Join Markes When w =, (4) is reduced o a onesho opimizaion problem, i.e., Γ (C { ) = E max γa (Ca) + γ r (C Ca) } ]. (11) Ca C We are no ineresed in solving he problem above as an O(C) soluion rivially exiss (i.e., search all possible C a s o find he opimal segmenaion). Insead, we show ha his simple scenario illusraes wo moivaing facors behind pricing via join markes. Firs, wih he aucion marke, lowvaluaion users whose v i < p r are offered a chance for access o cloud insances. Therefore, having wo markes expands he poenial demand and increases he overall revenue. Second, users wih low olerance o inerrupions are offered an opion o increase heir reques prioriy, as saed below. Proposiion 5: To maximize revenue, he provider always ries o fulfill he requess of hose aucion bidders whose v i p r /q before i acceps any payasyougo requess. Proof: Suppose he provider has sufficien capaciy o fulfill bidder i s requess n i. By Proposiion 1, he marginal revenue of accommodaing bidder i is n i φ(v i ). Now if he provider changes is mind and allocaes hese n i insances o payasyougo users, hen he marginal revenue would be a mos n i p r /q. Noe ha his will no happen if φ(v i ) p r /q, as bidder i s requess bring more marginal revenue o he provider. We herefore conclude he proof by noicing ha v i φ(v i ) p r /q. In oher words, for highvaluaion users, he aucion marke is acually offering guaraneed services wih higher fulfillmen prioriy. Only lowvaluaion users bear he risk of being inerruped. All above jusify he moivaion for using muliple markes: I benefis boh he provider and he users. However, hough Proposiion 5 reveals some basic crieria in allocaing resources, i alone is unable o guaranee he opimal revenue. In fac, opimal capaciy segmenaion is a complicaed problem. The following discussions are argeed for a general seing where shor predicion is available, i.e., w >. B. Complexiy of Opimal Capaciy Segmenaion Since (4) describes an MDP problem, a sandard soluion is numerical dynamic programming via backward inducion. I proceeds by firs simulaing marke demand in he las sage T based on he prediced demand and calculaing he opimal segmenaion made in ha sage. Using his resul, i hen deermines how o segmen he capaciy in sage T 1, based on he prediced marke demand a ha ime. This process made in he curren sage is obained. In each sage τ, for each possible C τ and each demand realizaion (i.e., he aucion requess (n, v) and payasyougo requess Rr τ ), compue (4), which akes O(C 2 ) operaions. Since he compuaion is aken over all C τ =, 1,..., C, he complexiy of onesage calculaion is O(C 3 ). By noing ha only shor predicion is possible coninues backwards unil he opimal segmenaion C a φ( ) δ n m+1 c Capaciy φ( ) δ c Capaciy Fig. 3. The picorial illusraion of he exac aucion revenue γ a(c) and is upper bound γ a(c), shown as he shaded area in he lef and righ figures, respecively. and w is usually small, we see he overall compuaional complexiy of he above process is O(C 3 ). For large providers wih high capaciies, finding exac soluions o (4) is compuaionally inracable. As a ypical example, when C = 1 5, he compuaion above requires O(1 15 ) operaions, which is prohibiive when decisions need o be made in real ime. C. An Asympoically Opimal Soluion The segmenaion decision needs o be made quickly afer he user demand has arrived. In pracice, his is ofen more imporan han pursuing exac opimaliy. Hence, we nex propose an asympoically opimal soluion o (4) ha significanly reduces he compuaional complexiy. In he aucion marke, he bidders requess do no always fi exacly wihin he allocaed capaciy. By (9), if c insances are allocaed o he aucion marke, hen here would be δ = c m n i insances lefover as hese compuing resources are insufficien o accommodae he reques of bidder m + 1, i.e., δ < n m+1. Fig. 3 illusraes his scenario. However, if bidder m + 1 acceps parial fulfillmen, hen hose δ insances would generae δφ(v m+1 ) addiional revenue o he provider. Le γ a ( ) be he revenue obained as if parial fulfillmen were acceped. We have γ a (c) = γ a (c) + δφ(v m+1 ) m = n i φ(v i ) + δφ(v m+1 ). (12) Clearly, γ a is an upper bound of γ a. Fig. 3 gives a picorial illusraion of γ a (c) and γ a (c). The following lemma indicaes ha he upper bound γ a offers a close approximaion o γ a, provided ha he capaciy allocaed o he aucion marke is enormous compared wih a single bidder s requess. Is proof is given in 24]. Lemma 4: If c α n for some α 1, hen γ a (c) (1 1 α ) γ a(c). Now, insead of calculaing he opimal capaciy segmenaion, he provider solves an approximae problem by replacing γ a wih is upper bound γ a in he original problem (4), i.e., Γ (C ) = E max { γa (Ca) + γ r (C Ca) Ca C + E X Γ+1 (C a + X) ]}]. (13)
8 The boundary condiions are Γ T +1 (c) = for all c =, 1,..., C. Le C a be he opimal soluion o (13). Then C a is used as an approximae, subopimal soluion o he original problem (4). In paricular, he provider allocaes C a insances o he aucion marke, generaing revenue Γ (C ) = E γ a ( C a) + γ r (C C a) + E X Γ+1 ( C a + X) ]]. (14) We adop he above subopimal allocaion C a as he approximae soluion o (4) for wo reasons: 1) I closely approaches he opimal revenue, and 2) i conains some opimizaion srucures ha significanly reduce he compuaional complexiy. To see he firs argumen, we show ha as long as he aucion marke has high demand, he proposed approximaion realizes he opimal revenue almos for sure. The following proposiion formalizes his saemen. Is proof is given in Appendix. Proposiion 6: The approximae allocaion is asympoically opimal as he number of bidders ends o infiniy. Formally, Γ (C ) Γ (C ) w.p. 1 for all and C if N a for all. We believe ha he opimaliy condiion N a is no a resricive requiremen in pracice for a large cloud provider, as i always has a huge amoun of users requesing virual insances. In fac, even for cases where here are no oo many users bidding in periodic aucions, he proposed approximaion sill generaes nearopimal revenue for a cloud provider. We laer verify his poin via exensive simulaions in Sec. VI. We now show ha (13) has an imporan opimizaion srucure ha leads o an efficien soluion wihin O(C 2 ). Firs, we see ha γ a ( ) is concave, as saed below. Lemma 5: Given n and v, γ a (c) defined in (12) is concave. Tha is, γ a (c) = γ a (c) γ a (c 1) is decreasing w.r.. c. Lemma 5 suggess he concaviy of Γ ( ) as follows. Lemma 6: For every τ =,..., T, Γ τ (C τ ) is increasing and concave for all C τ =, 1,..., C. This concaviy finally leads o an ineresing srucure described in he following proposiion. Proposiion 7: For every realizaion n and v a ime τ =, + 1,..., T, le Cτ a (C τ ) be he opimal soluion o (13). For all C τ =, 1,..., C, we have C τ a (C τ + 1) 1 C τ a (C τ ) C τ a (C τ + 1). (15) Due o space consrains, he deailed proofs of Lemmas 5 and 6, as well as Proposiion 7, are all given in 24]. Proposiion 7 plays a key role in reducing compuaional complexiy: I indicaes ha previously calculaed resuls can be reused in subsequen compuaions. We herefore carry ou dynamic programming from he las sage T and proceed backwards o. Wihin each sage τ, Γ τ (C τ ) is sequenially compued as C τ = C, C 1,...,. When compuing C τ a (C τ ), TABLE I REVENUE GAP BETWEEN THE APPROXIMATION AND THE UPPER BOUND. λ = 1 λ = 2 λ = 5 Revenue gap.81%.52%.38% insead of exhausively searching he enire soluion space from o C, one only needs o ry wo possible values, C τ a (C τ + 1) and C τ a (C τ + 1) 1, and he one resuling in higher revenue is seleced as C τ a. The enire compuaion only akes O(C 2 ) operaions. In erms of compuaional efficiency, he approximae soluion significanly ouperforms he opimal one, as he oal capaciy of a provider is usually enormous in pracice. As an example, when C = 1 5, he approximaion is 1 5 imes faser han he exac soluion. VI. SIMULATION RESULTS We evaluae he revenue performance of he proposed approximae soluion via exensive simulaions. We adop a ypical scenario where C = 1 5. Tha is, he provider is able o hos up o 1 5 virual insances of a cerain ype simulaneously. We simulae he markes for 1 ime periods. In each period, cloud users arrive ino he sysem following a Poisson process wih inensiy λ, which are hen randomly spli ino he payasyougo and aucion markes wih equal probabiliy. Our evaluaion adops hree demand paerns low, medium, and high, wih λ being 1, 2, and 5, respecively. For he payasyougo marke, each user s demand is modeled by a random variable uniformly disribued in 1, 1], he price p r is normalized o 1, and he insance reurn probabiliy q is aken as.5. For he aucion marke, each bidder i s reques n i is modeled by an i.i.d. random variable uniformly disribued in 1, 1], and is affordable price v i is i.i.d. exponenial wih mean Ev i ] =.5p r =.5. We enable shor predicions and se he predicion window w = 5. Each resul below has been averaged over 1 runs. A. Revenue Performance We firs evaluae he proposed nearopimal segmenaion scheme by comparing is revenue (i.e., Γ defined in (14)) agains he heoreical upper bound (i.e., Γ defined in (13)). The resuls are illusraed in Fig. 4a, where all daa is normalized by he maximum upperbound revenue. Fig. 4a shows ha our approximaion design closely approaches he opimal soluion. Even compared wih he heoreical revenue upper bound Γ, he gap is almos negligible, less han 1% in all cases, as summarized in Table I. Also noe ha he revenue gap is diminishing as he marke demand increases. This conforms o he asympoic opimaliy concluded from Proposiion 6: The higher he marke demand is, he more close he approximae soluion approaches he opimal revenue. B. Capaciy Segmenaion and Aucion Prices We now analyze how he capaciy is allocaed o he wo markes under he nearopimal segmenaion sraegy. Fig. 4b
9 Normalized Revenue Approxn., λ = 1 UB, λ = 1 Approxn., λ = 2 UB, λ = 2 Approxn., λ = 5 UB, λ = Time (a) Normalized revenue vs. ime. CDF λ = 1 λ = 2 λ = Marke share of periodic aucions (%) (b) CDF of he marke share of periodic aucions. CDF λ = 1 λ = 2 λ = Aucion price (c) CDF of he aucion price. Revenue conribuion (%) Aucion (approxn.) Aucion (UB) λ (d) Revenue conribuion of periodic aucions. Fig. 4. Performance evaluaion of he approximae capaciy segmenaion algorihm, where UB sands for upper bound while approxn. is shor for approximaion. illusraes he CDF of he marke share of periodic aucions in all hree demand paerns. Here, he marke share is defined as he raio, beween he capaciy allocaed o he aucion marke and he enire capaciy ha he provider has. I is worh menioning ha he allocaed capaciy migh no be fully used o accommodae aucion bidders, even for he case where he aucion demand exceeds he supply. The provider would sraegically reserve some insances by rejecing lowbid requess, since acceping hem lowers he clearing price, which may decrease he revenue. As illusraed in Fig. 4b, when demand is low (i.e., λ = 1), abou half of he capaciy is allocaed o he aucion marke, leading o a 5% marke share. Fig. 4c shows he corresponding clearing price ha is around he mean bid Ev i ] of aucion bidders. In his case, since cloud insances are overprovisioned, some of hem are aucioned a a discouned price o increase he revenue. I is worh menioning ha hough aucion bidders enjoy using he resources a a lower price, hey bear he risks ha he services migh be inerruped. As demand increases, he marke share drops, while he aucion price rises. For he case where λ = 2, Fig. 4b shows ha almos all insances are hosed o accommodae payasyougo requess, wih less han 1% capaciy allocaed o aucion markes. This is essenially due o he simulaion seings ha insances are less valued in periodic aucions han hey are in payasyougo marke, as he mean bid is only half of he payasyougo price (i.e., Ev i ] =.5p r ). In his case, payasyougo requess are considered more profiable han aucion bids. Only a few highvalue bids are acceped by he provider, resuling in a higher clearing price in he aucion channel as illusraed in Fig. 4c. I is ineresing o observe ha, when demand keeps increasing, he marke share of periodic aucions rebounds, which is shown in Fig. 4b wih λ = 5. In his case, he enire marke demand significanly exceeds he provider s capaciy. As a resul, more highbid requess are received from he aucion marke. Since hese requess are more profiable han hose in he payasyougo marke, he provider fulfills hem by allocaing more resources o he aucion marke. The clearing price is also observed o rise in Fig. 4c. All discussions above show ha augmening payasyougo pricing wih periodic aucions essenially increases he provider s abiliy o respond o demand uncerainies. Periodic aucions help o fulfill some lefover revenue when resources are overprovisioned in he payasyougo marke. On he oher hand, i exracs more revenue by charging high prices o highbid requess when demand exceeds supply. C. Comparisons Beween PayasYouGo and Aucions The wo markes do no make equal revenue conribuions. As presened in Fig. 4d, he payasyougo marke conribues more han 85% revenue o he provider in all hree demand paerns. Noe ha he payasyougo marke akes up only 66% of he overall demand 3. Therefore, i provides a disproporionaely large share of revenue. Similar observaions are made when differen demand raios beween he wo markes are considered. By offering guaraneed services wih a saic price, insances in he payasyougo marke ofen demand a higher premium han hose in he aucion marke. For his reason, payasyougo requess are usually more profiable han mos aucion bids, and are acceped a a higher prioriy for revenue maximizaion. Table II furher validaes his poin, where he reques accepance raes are lised for all hree demand paerns. We see ha payasyougo requess are generally acceped wih a considerably higher probabiliy han aucion bids. However, his does no mean ha aucion bidders are always secondary cusomers. As saed in Proposiion 5, hose who bid sufficienly high will always be accommodaed firs. In our simulaion, hese are he op 5% bidders. As illusraed in Table II, heir requess are leas affeced by he specific demand paern. Therefore, he aucion marke offers an opion o he users o increase he prioriy of heir requess. VII. CONCLUSIONS In his paper, we invesigae he problem of opimal capaciy segmenaion in an EC2like cloud marke wih he regular payasyougo pricing augmened by periodic aucions. To his end, we analyically characerize he revenue of uniformprice aucions, and presen an opimal design wih maximum revenue. Conrary o he wellknown resul ha uniformprice 3 New demand arrivals are equal for boh markes, bu each new payasyougo insance requires wice he capaciy of each new aucion insance since q =.5.
10 TABLE II AVERAGE REQUEST ACCEPTANCE RATES Payasyougo users Aucion users λ = 1 1% 36.9% λ = % 5.7% λ = % 5.2% aucions have suffered from he demand reducion in general, our design achieves ruhfulness in cloud environmens where parial fulfillmen is unaccepable o users. We furher connec our design o he EC2 spo marke, showing ha he wo are equivalen in erms of heir marke response. Based on he esablished analysis for he aucion channel, we formulae he capaciy segmenaion problem as a Markov decision process. Realizing ha he exac soluion is compuaionally prohibiive in pracical seings, we presen an asympoically opimal soluion ha reduces he compuaional complexiy from O(C 3 ) o O(C 2 ), which is significan for cloud providers wih large capaciies. All our heoreical resuls are furher validaed by exensive simulaion sudies. APPENDIX This secion proves he asympoic opimaliy of he approximae soluion proposed in Sec. V. We need he following echnical lemma. Lemma 7: If Na for all, hen for any given α <, Γ (C ) (1 1 α ) Γ (C ) holds for all and C. Proof: Given an arbirary α <, we prove by inducion. Basis: Show ha he saemen holds for = T + 1. This is indeed he case due o he boundary condiions, i.e., Γ T +1 (C T +1 ) = Γ T +1 (C T +1 ) =. Inducive sep: Suppose he saemen holds for + 1. We show i also holds for. I suffices o consider he following wo cases. Case 1: C a α n. In his case, by Lemma 4, we have γ a ( C a) (1 1 α ) γ a( C a). Also, from he inducion assumpions, we know Γ +1 (1 1 α ) Γ w.p. 1. Subsiuing hese wo inequaliies back o (13) and (14) lead o he saemen: Γ (C ) (1 1 α ) Γ (C ) w.p. 1. (Noe ha C a is he opimal soluion o (13).) Case 2: C a < α n. In his case, le Y be he number of op bidders wih uni demand, i.e., n i = 1 and v i = v. Suppose P (n i = 1, v i = v) = p >. We know Y Bin(Na, p). Le N (µ, σ 2 ) be he normal disribuion. For any finie k, we have lim P (Y = k) = lim B(N a, k, p) Na Na = lim N (N ap, kp(1 p)) Na =, where he second equaliy holds because of he Cenral Limi Theorem. This essenially indicaes ha P (Y C a) = 1 for any finie C a. Therefore, all C a insances can be allocaed o op bidders wih uni demand, which implies γ a ( C a) = γ a ( C a) w.p. 1. Now subsiuing his equaliy o (13) and (14) and applying he inducion assumpions, we see he saemen holds, i.e., Γ (C ) (1 1 α ) Γ (C ) w.p. 1. We are now ready o prove he asympoic opimaliy of he approximae soluion. Proof of Proposiion 6: By Lemma 7, for any given α <, Γ (C ) (1 1 α ) Γ (C ) (1 1 α )Γ (C ) w.p. 1. Also noe ha Γ (C ) Γ (C ) (because Γ (C ) is he opimal soluion). We finally have (1 1 α )Γ (C ) Γ (C ) Γ (C ) (16) held for any finie α w.p. 1. This essenially indicaes ha Γ Γ w.p. 1. REFERENCES 1] Amazon EC2 Pricing, hp://aws.amazon.com/ec2/pricing/. 2] Windows Azure, hp://www.microsof.com/windowsazure. 3] Google AppEngine, hp://code.google.com/appengine. 4] GoGrid Cloud Hosing, hp://www.gogrid.com. 5] RackSpace Cloud Hosing, hp://www.rackspace.com/cloud. 6] JoyenCloud, hp://www.joyencloud.com. 7] ElasicHoss, hp://www.elasichoss.com/. 8] Y. Hong, M. Thoehodi, and J. Xue, Dynamic server provisioning o minimize cos in an IaaS cloud, in Proc. ACM SIGMETRICS, ] K. Vermeersch, A broker for cosefficien qos aware resource allocaion in EC2, Maser s hesis, Universiy of Anwerp, ] Q. Zhang, E. Gürses, R. Bouaba, and J. Xiao, Dynamic resource allocaion for spo markes in clouds, in Proc. HOTICE, ] A. Danak and S. Mannor, Resource allocaion wih supply adjusmen in disribued compuing sysems, in Proc. IEEE ICDCS, ] O. A. BenYehuda, M. BenYehuda, A. Schuser, and D. Tsafrir, Deconsrucing Amazon EC2 Spo Insance pricing, in Proc. IEEE CloudCom, ] P. Klemperer, Aucions: Theory and Pracice. Princeon Universiy Press, ] R. EngelbrechWiggans, J. Lis, and D. Reiley, Demand reducion in muliuni aucions wih varying numbers of bidders: Theory and field experimens, Inernaional Economic Review, vol. 47, no. 1, pp , ] H. Ezion, E. Pinker, and A. Seidmann, Analyzing he simulaneous use of aucions and posed prices for online selling, Manufacuring & Service Operaions Managemen, vol. 8, no. 1, pp , ] R. Caldeney and G. Vulcano, Online aucion and lis price revenue managemen, Managemen Science, vol. 53, no. 5, pp , ] G. Vulcano, G. Van Ryzin, and C. Maglaras, Opimal dynamic aucions for revenue managemen, Managemen Science, vol. 48, no. 11, pp , ] J. Gallien, Dynamic mechanism design for online commerce, Operaions Research, vol. 54, no. 2, pp , ] H. Fujiwara and K. Iwama, Averagecase compeiive analyses for skirenal problems, Algorihmica, vol. 42, no. 1, pp , 25. 2] R. Randhawa and S. Kumar, Usage resricion and subscripion services: Operaional benefis wih raional users, Manufacuring & Service Operaions Managemen, vol. 1, no. 3, pp , ] E. Caron, F. Desprez, and A. Muresan, Forecasing for grid and cloud compuing ondemand resources based on paern maching, in Proc. IEEE CloudCom, ] N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani, Algorihmic Game Theory. Cambridge Universiy Press, ] R. B. Myerson, Opimal aucion design, Mahemaics of Operaions Research, vol. 6, no. 1, pp , ] W. Wang, B. Li, and B. Liang, Towards opimal capaciy segmenaion wih hybrid cloud pricing, Universiy of Torono, Tech. Rep., 211. Online]. Available: hp://iqua.ece.orono.edu/ bli/papers/capseg.pdf 25] J. Bulow and J. Robers, The simple economics of opimal aucions, Journal of Poliical Economy, vol. 97, no. 5, pp , ] W. Vickrey, Counerspeculaion, aucions, and compeiive sealed enders, The Journal of Finance, vol. 16, no. 1, pp. 8 37, 1961.
Towards Optimal Capacity Segmentation with Hybrid Cloud Pricing
Towards Opimal Capaciy Segmenaion wih Hybrid Cloud Pricing Wei Wang, Baochun Li, and Ben Liang Deparmen of Elecrical and Compuer Engineering Universiy of Torono Torono, ON M5S 3G4, Canada weiwang@eecg.orono.edu,
More informationTowards Optimal Capacity Segmentation with Hybrid Cloud Pricing
Towards Opimal Capaciy Segmenaion wih Hybrid Cloud Pricing Wei Wang, Baochun Li, and Ben Liang Deparmen of Elecrical and Compuer Engineering Universiy of Torono Absrac Cloud resources are usually priced
More informationPROFIT TEST MODELLING IN LIFE ASSURANCE USING SPREADSHEETS PART ONE
Profi Tes Modelling in Life Assurance Using Spreadshees PROFIT TEST MODELLING IN LIFE ASSURANCE USING SPREADSHEETS PART ONE Erik Alm Peer Millingon 2004 Profi Tes Modelling in Life Assurance Using Spreadshees
More informationSinglemachine Scheduling with Periodic Maintenance and both Preemptive and. Nonpreemptive jobs in Remanufacturing System 1
Absrac number: 050407 Singlemachine Scheduling wih Periodic Mainenance and boh Preempive and Nonpreempive jobs in Remanufacuring Sysem Liu Biyu hen Weida (School of Economics and Managemen Souheas Universiy
More informationChapter 8: Regression with Lagged Explanatory Variables
Chaper 8: Regression wih Lagged Explanaory Variables Time series daa: Y for =1,..,T End goal: Regression model relaing a dependen variable o explanaory variables. Wih ime series new issues arise: 1. One
More informationTEMPORAL PATTERN IDENTIFICATION OF TIME SERIES DATA USING PATTERN WAVELETS AND GENETIC ALGORITHMS
TEMPORAL PATTERN IDENTIFICATION OF TIME SERIES DATA USING PATTERN WAVELETS AND GENETIC ALGORITHMS RICHARD J. POVINELLI AND XIN FENG Deparmen of Elecrical and Compuer Engineering Marquee Universiy, P.O.
More informationNiche Market or Mass Market?
Niche Marke or Mass Marke? Maxim Ivanov y McMaser Universiy July 2009 Absrac The de niion of a niche or a mass marke is based on he ranking of wo variables: he monopoly price and he produc mean value.
More informationThe Application of Multi Shifts and Break Windows in Employees Scheduling
The Applicaion of Muli Shifs and Brea Windows in Employees Scheduling Evy Herowai Indusrial Engineering Deparmen, Universiy of Surabaya, Indonesia Absrac. One mehod for increasing company s performance
More informationAnalysis of Pricing and Efficiency Control Strategy between Internet Retailer and Conventional Retailer
Recen Advances in Business Managemen and Markeing Analysis of Pricing and Efficiency Conrol Sraegy beween Inerne Reailer and Convenional Reailer HYUG RAE CHO 1, SUG MOO BAE and JOG HU PARK 3 Deparmen of
More informationDYNAMIC MODELS FOR VALUATION OF WRONGFUL DEATH PAYMENTS
DYNAMIC MODELS FOR VALUATION OF WRONGFUL DEATH PAYMENTS Hong Mao, Shanghai Second Polyechnic Universiy Krzyszof M. Osaszewski, Illinois Sae Universiy Youyu Zhang, Fudan Universiy ABSTRACT Liigaion, exper
More informationStrategic Optimization of a Transportation Distribution Network
Sraegic Opimizaion of a Transporaion Disribuion Nework K. John Sophabmixay, Sco J. Mason, Manuel D. Rossei Deparmen of Indusrial Engineering Universiy of Arkansas 4207 Bell Engineering Cener Fayeeville,
More informationTo Sponsor or Not to Sponsor: Sponsored Search Auctions with Organic Links and Firm Dependent ClickThrough Rates
To Sponsor or No o Sponsor: Sponsored Search Aucions wih Organic Links and Firm Dependen ClickThrough Raes Michael Arnold, Eric Darmon and Thierry Penard June 5, 00 Draf: Preliminary and Incomplee Absrac
More informationChapter 1.6 Financial Management
Chaper 1.6 Financial Managemen Par I: Objecive ype quesions and answers 1. Simple pay back period is equal o: a) Raio of Firs cos/ne yearly savings b) Raio of Annual gross cash flow/capial cos n c) = (1
More informationMorningstar Investor Return
Morningsar Invesor Reurn Morningsar Mehodology Paper Augus 31, 2010 2010 Morningsar, Inc. All righs reserved. The informaion in his documen is he propery of Morningsar, Inc. Reproducion or ranscripion
More informationAppendix D Flexibility Factor/Margin of Choice Desktop Research
Appendix D Flexibiliy Facor/Margin of Choice Deskop Research Cheshire Eas Council Cheshire Eas Employmen Land Review Conens D1 Flexibiliy Facor/Margin of Choice Deskop Research 2 Final Ocober 2012 \\GLOBAL.ARUP.COM\EUROPE\MANCHESTER\JOBS\200000\22348900\4
More informationOption PutCall Parity Relations When the Underlying Security Pays Dividends
Inernaional Journal of Business and conomics, 26, Vol. 5, No. 3, 22523 Opion Puall Pariy Relaions When he Underlying Securiy Pays Dividends Weiyu Guo Deparmen of Finance, Universiy of Nebraska Omaha,
More informationDuration and Convexity ( ) 20 = Bond B has a maturity of 5 years and also has a required rate of return of 10%. Its price is $613.
Graduae School of Business Adminisraion Universiy of Virginia UVAF38 Duraion and Convexiy he price of a bond is a funcion of he promised paymens and he marke required rae of reurn. Since he promised
More informationOn the degrees of irreducible factors of higher order Bernoulli polynomials
ACTA ARITHMETICA LXII.4 (1992 On he degrees of irreducible facors of higher order Bernoulli polynomials by Arnold Adelberg (Grinnell, Ia. 1. Inroducion. In his paper, we generalize he curren resuls on
More informationTask is a schedulable entity, i.e., a thread
RealTime Scheduling Sysem Model Task is a schedulable eniy, i.e., a hread Time consrains of periodic ask T:  s: saring poin  e: processing ime of T  d: deadline of T  p: period of T Periodic ask T
More informationEfficient Risk Sharing with Limited Commitment and Hidden Storage
Efficien Risk Sharing wih Limied Commimen and Hidden Sorage Árpád Ábrahám and Sarola Laczó March 30, 2012 Absrac We exend he model of risk sharing wih limied commimen e.g. Kocherlakoa, 1996) by inroducing
More informationJournal Of Business & Economics Research September 2005 Volume 3, Number 9
Opion Pricing And Mone Carlo Simulaions George M. Jabbour, (Email: jabbour@gwu.edu), George Washingon Universiy YiKang Liu, (yikang@gwu.edu), George Washingon Universiy ABSTRACT The advanage of Mone Carlo
More informationANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS
ANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS R. Caballero, E. Cerdá, M. M. Muñoz and L. Rey () Deparmen of Applied Economics (Mahemaics), Universiy of Málaga,
More informationA Note on Using the Svensson procedure to estimate the risk free rate in corporate valuation
A Noe on Using he Svensson procedure o esimae he risk free rae in corporae valuaion By Sven Arnold, Alexander Lahmann and Bernhard Schwezler Ocober 2011 1. The risk free ineres rae in corporae valuaion
More informationSupply Chain Management Using Simulation Optimization By Miheer Kulkarni
Supply Chain Managemen Using Simulaion Opimizaion By Miheer Kulkarni This problem was inspired by he paper by Jung, Blau, Pekny, Reklaii and Eversdyk which deals wih supply chain managemen for he chemical
More informationARCH 2013.1 Proceedings
Aricle from: ARCH 213.1 Proceedings Augus 14, 212 Ghislain Leveille, Emmanuel Hamel A renewal model for medical malpracice Ghislain Léveillé École d acuaria Universié Laval, Québec, Canada 47h ARC Conference
More informationA Brief Introduction to the Consumption Based Asset Pricing Model (CCAPM)
A Brief Inroducion o he Consumpion Based Asse Pricing Model (CCAPM We have seen ha CAPM idenifies he risk of any securiy as he covariance beween he securiy's rae of reurn and he rae of reurn on he marke
More informationResearch on Inventory Sharing and Pricing Strategy of Multichannel Retailer with Channel Preference in Internet Environment
Vol. 7, No. 6 (04), pp. 365374 hp://dx.doi.org/0.457/ijhi.04.7.6.3 Research on Invenory Sharing and Pricing Sraegy of Mulichannel Reailer wih Channel Preference in Inerne Environmen Hanzong Li College
More informationOptimal Stock Selling/Buying Strategy with reference to the Ultimate Average
Opimal Sock Selling/Buying Sraegy wih reference o he Ulimae Average Min Dai Dep of Mah, Naional Universiy of Singapore, Singapore Yifei Zhong Dep of Mah, Naional Universiy of Singapore, Singapore July
More informationUNDERSTANDING THE DEATH BENEFIT SWITCH OPTION IN UNIVERSAL LIFE POLICIES. Nadine Gatzert
UNDERSTANDING THE DEATH BENEFIT SWITCH OPTION IN UNIVERSAL LIFE POLICIES Nadine Gazer Conac (has changed since iniial submission): Chair for Insurance Managemen Universiy of ErlangenNuremberg Lange Gasse
More informationChapter 7. Response of FirstOrder RL and RC Circuits
Chaper 7. esponse of FirsOrder L and C Circuis 7.1. The Naural esponse of an L Circui 7.2. The Naural esponse of an C Circui 7.3. The ep esponse of L and C Circuis 7.4. A General oluion for ep and Naural
More informationUSE OF EDUCATION TECHNOLOGY IN ENGLISH CLASSES
USE OF EDUCATION TECHNOLOGY IN ENGLISH CLASSES Mehme Nuri GÖMLEKSİZ Absrac Using educaion echnology in classes helps eachers realize a beer and more effecive learning. In his sudy 150 English eachers were
More informationPATHWISE PROPERTIES AND PERFORMANCE BOUNDS FOR A PERISHABLE INVENTORY SYSTEM
PATHWISE PROPERTIES AND PERFORMANCE BOUNDS FOR A PERISHABLE INVENTORY SYSTEM WILLIAM L. COOPER Deparmen of Mechanical Engineering, Universiy of Minnesoa, 111 Church Sree S.E., Minneapolis, MN 55455 billcoop@me.umn.edu
More informationPerformance Center Overview. Performance Center Overview 1
Performance Cener Overview Performance Cener Overview 1 ODJFS Performance Cener ce Cener New Performance Cener Model Performance Cener Projec Meeings Performance Cener Execuive Meeings Performance Cener
More informationChabot College Physics Lab RC Circuits Scott Hildreth
Chabo College Physics Lab Circuis Sco Hildreh Goals: Coninue o advance your undersanding of circuis, measuring resisances, currens, and volages across muliple componens. Exend your skills in making breadboard
More informationAnalysis of Tailored BaseSurge Policies in Dual Sourcing Inventory Systems
Analysis of Tailored BaseSurge Policies in Dual Sourcing Invenory Sysems Ganesh Janakiraman, 1 Sridhar Seshadri, 2, Anshul Sheopuri. 3 Absrac We sudy a model of a firm managing is invenory of a single
More informationThe Grantor Retained Annuity Trust (GRAT)
WEALTH ADVISORY Esae Planning Sraegies for closelyheld, family businesses The Granor Reained Annuiy Trus (GRAT) An efficien wealh ransfer sraegy, paricularly in a low ineres rae environmen Family business
More informationInventory Planning with Forecast Updates: Approximate Solutions and Cost Error Bounds
OPERATIONS RESEARCH Vol. 54, No. 6, November December 2006, pp. 1079 1097 issn 0030364X eissn 15265463 06 5406 1079 informs doi 10.1287/opre.1060.0338 2006 INFORMS Invenory Planning wih Forecas Updaes:
More informationState Machines: Brief Introduction to Sequencers Prof. Andrew J. Mason, Michigan State University
Inroducion ae Machines: Brief Inroducion o equencers Prof. Andrew J. Mason, Michigan ae Universiy A sae machine models behavior defined by a finie number of saes (unique configuraions), ransiions beween
More informationOptimal Investment and Consumption Decision of Family with Life Insurance
Opimal Invesmen and Consumpion Decision of Family wih Life Insurance Minsuk Kwak 1 2 Yong Hyun Shin 3 U Jin Choi 4 6h World Congress of he Bachelier Finance Sociey Torono, Canada June 25, 2010 1 Speaker
More informationRealtime Particle Filters
Realime Paricle Filers Cody Kwok Dieer Fox Marina Meilă Dep. of Compuer Science & Engineering, Dep. of Saisics Universiy of Washingon Seale, WA 9895 ckwok,fox @cs.washingon.edu, mmp@sa.washingon.edu Absrac
More informationThe Transport Equation
The Transpor Equaion Consider a fluid, flowing wih velociy, V, in a hin sraigh ube whose cross secion will be denoed by A. Suppose he fluid conains a conaminan whose concenraion a posiion a ime will be
More informationLEASING VERSUSBUYING
LEASNG VERSUSBUYNG Conribued by James D. Blum and LeRoy D. Brooks Assisan Professors of Business Adminisraion Deparmen of Business Adminisraion Universiy of Delaware Newark, Delaware The auhors discuss
More informationcooking trajectory boiling water B (t) microwave 0 2 4 6 8 101214161820 time t (mins)
Alligaor egg wih calculus We have a large alligaor egg jus ou of he fridge (1 ) which we need o hea o 9. Now here are wo accepable mehods for heaing alligaor eggs, one is o immerse hem in boiling waer
More informationAs widely accepted performance measures in supply chain management practice, frequencybased service
MANUFACTURING & SERVICE OPERATIONS MANAGEMENT Vol. 6, No., Winer 2004, pp. 53 72 issn 523464 eissn 5265498 04 060 0053 informs doi 0.287/msom.030.0029 2004 INFORMS On Measuring Supplier Performance Under
More informationRandom Walk in 1D. 3 possible paths x vs n. 5 For our random walk, we assume the probabilities p,q do not depend on time (n)  stationary
Random Walk in D Random walks appear in many cones: diffusion is a random walk process undersanding buffering, waiing imes, queuing more generally he heory of sochasic processes gambling choosing he bes
More informationTerm Structure of Prices of Asian Options
Term Srucure of Prices of Asian Opions Jirô Akahori, Tsuomu Mikami, Kenji Yasuomi and Teruo Yokoa Dep. of Mahemaical Sciences, Risumeikan Universiy 111 Nojihigashi, Kusasu, Shiga 5258577, Japan Email:
More informationSPEC model selection algorithm for ARCH models: an options pricing evaluation framework
Applied Financial Economics Leers, 2008, 4, 419 423 SEC model selecion algorihm for ARCH models: an opions pricing evaluaion framework Savros Degiannakis a, * and Evdokia Xekalaki a,b a Deparmen of Saisics,
More informationForecasting and Information Sharing in Supply Chains Under QuasiARMA Demand
Forecasing and Informaion Sharing in Supply Chains Under QuasiARMA Demand Avi Giloni, Clifford Hurvich, Sridhar Seshadri July 9, 2009 Absrac In his paper, we revisi he problem of demand propagaion in
More informationWorking Paper No. 482. Net Intergenerational Transfers from an Increase in Social Security Benefits
Working Paper No. 482 Ne Inergeneraional Transfers from an Increase in Social Securiy Benefis By Li Gan Texas A&M and NBER Guan Gong Shanghai Universiy of Finance and Economics Michael Hurd RAND Corporaion
More informationGraphing the Von Bertalanffy Growth Equation
file: d:\b1732013\von_beralanffy.wpd dae: Sepember 23, 2013 Inroducion Graphing he Von Beralanffy Growh Equaion Previously, we calculaed regressions of TL on SL for fish size daa and ploed he daa and
More informationLecture III: Finish Discounted Value Formulation
Lecure III: Finish Discouned Value Formulaion I. Inernal Rae of Reurn A. Formally defined: Inernal Rae of Reurn is ha ineres rae which reduces he ne presen value of an invesmen o zero.. Finding he inernal
More informationMACROECONOMIC FORECASTS AT THE MOF A LOOK INTO THE REAR VIEW MIRROR
MACROECONOMIC FORECASTS AT THE MOF A LOOK INTO THE REAR VIEW MIRROR The firs experimenal publicaion, which summarised pas and expeced fuure developmen of basic economic indicaors, was published by he Minisry
More informationEconomics 140A Hypothesis Testing in Regression Models
Economics 140A Hypohesis Tesing in Regression Models While i is algebraically simple o work wih a populaion model wih a single varying regressor, mos populaion models have muliple varying regressors 1
More informationMarket Liquidity and the Impacts of the Computerized Trading System: Evidence from the Stock Exchange of Thailand
36 Invesmen Managemen and Financial Innovaions, 4/4 Marke Liquidiy and he Impacs of he Compuerized Trading Sysem: Evidence from he Sock Exchange of Thailand Sorasar Sukcharoensin 1, Pariyada Srisopisawa,
More informationTSGRAN Working Group 1 (Radio Layer 1) meeting #3 Nynashamn, Sweden 22 nd 26 th March 1999
TSGRAN Working Group 1 (Radio Layer 1) meeing #3 Nynashamn, Sweden 22 nd 26 h March 1999 RAN TSGW1#3(99)196 Agenda Iem: 9.1 Source: Tile: Documen for: Moorola Macrodiversiy for he PRACH Discussion/Decision
More informationUnderstanding Sequential Circuit Timing
ENGIN112: Inroducion o Elecrical and Compuer Engineering Fall 2003 Prof. Russell Tessier Undersanding Sequenial Circui Timing Perhaps he wo mos disinguishing characerisics of a compuer are is processor
More informationCHARGE AND DISCHARGE OF A CAPACITOR
REFERENCES RC Circuis: Elecrical Insrumens: Mos Inroducory Physics exs (e.g. A. Halliday and Resnick, Physics ; M. Sernheim and J. Kane, General Physics.) This Laboraory Manual: Commonly Used Insrumens:
More informationBALANCE OF PAYMENTS. First quarter 2008. Balance of payments
BALANCE OF PAYMENTS DATE: 20080530 PUBLISHER: Balance of Paymens and Financial Markes (BFM) Lena Finn + 46 8 506 944 09, lena.finn@scb.se Camilla Bergeling +46 8 506 942 06, camilla.bergeling@scb.se
More informationIndividual Health Insurance April 30, 2008 Pages 167170
Individual Healh Insurance April 30, 2008 Pages 167170 We have received feedback ha his secion of he e is confusing because some of he defined noaion is inconsisen wih comparable life insurance reserve
More informationYTM is positively related to default risk. YTM is positively related to liquidity risk. YTM is negatively related to special tax treatment.
. Two quesions for oday. A. Why do bonds wih he same ime o mauriy have differen YTM s? B. Why do bonds wih differen imes o mauriy have differen YTM s? 2. To answer he firs quesion les look a he risk srucure
More informationMultiprocessor SystemsonChips
Par of: Muliprocessor SysemsonChips Edied by: Ahmed Amine Jerraya and Wayne Wolf Morgan Kaufmann Publishers, 2005 2 Modeling Shared Resources Conex swiching implies overhead. On a processing elemen,
More informationFourier Series Solution of the Heat Equation
Fourier Series Soluion of he Hea Equaion Physical Applicaion; he Hea Equaion In he early nineeenh cenury Joseph Fourier, a French scienis and mahemaician who had accompanied Napoleon on his Egypian campaign,
More informationTrading on ShortTerm Information
428 Trading on ShorTerm Informaion by ALEXANDER GÜMBEL This paper shows ha invesors may wan fund managers o acquire and rade on shorerm insead of more profiable longerm informaion. This improves learning
More informationPresent Value Methodology
Presen Value Mehodology Econ 422 Invesmen, Capial & Finance Universiy of Washingon Eric Zivo Las updaed: April 11, 2010 Presen Value Concep Wealh in Fisher Model: W = Y 0 + Y 1 /(1+r) The consumer/producer
More informationThe option pricing framework
Chaper 2 The opion pricing framework The opion markes based on swap raes or he LIBOR have become he larges fixed income markes, and caps (floors) and swapions are he mos imporan derivaives wihin hese markes.
More informationTHE FIRM'S INVESTMENT DECISION UNDER CERTAINTY: CAPITAL BUDGETING AND RANKING OF NEW INVESTMENT PROJECTS
VII. THE FIRM'S INVESTMENT DECISION UNDER CERTAINTY: CAPITAL BUDGETING AND RANKING OF NEW INVESTMENT PROJECTS The mos imporan decisions for a firm's managemen are is invesmen decisions. While i is surely
More informationThe Interaction of Guarantees, Surplus Distribution, and Asset Allocation in With Profit Life Insurance Policies
1 The Ineracion of Guaranees, Surplus Disribuion, and Asse Allocaion in Wih Profi Life Insurance Policies Alexander Kling * Insiu für Finanz und Akuarwissenschafen, Helmholzsr. 22, 89081 Ulm, Germany
More informationMeasuring macroeconomic volatility Applications to export revenue data, 19702005
FONDATION POUR LES ETUDES ET RERS LE DEVELOPPEMENT INTERNATIONAL Measuring macroeconomic volailiy Applicaions o expor revenue daa, 1970005 by Joël Cariolle Policy brief no. 47 March 01 The FERDI is a
More informationLongevity 11 Lyon 79 September 2015
Longeviy 11 Lyon 79 Sepember 2015 RISK SHARING IN LIFE INSURANCE AND PENSIONS wihin and across generaions Ragnar Norberg ISFA Universié Lyon 1/London School of Economics Email: ragnar.norberg@univlyon1.fr
More informationEconomic Analysis of 4G Network Upgrade
Economic Analysis of ework Upgrade Lingjie Duan, Jianwei Huang, and Jean Walrand Absrac As he successor o he sandard, provides much higher daa raes o address cellular users everincreasing demands for
More informationpolicies are investigated through the entire product life cycle of a remanufacturable product. Benefiting from the MDP analysis, the optimal or
ABSTRACT AHISKA, SEMRA SEBNEM. Invenory Opimizaion in a One Produc Recoverable Manufacuring Sysem. (Under he direcion of Dr. Russell E. King and Dr. Thom J. Hodgson.) Environmenal regulaions or he necessiy
More informationEstablishing Prefabricated Wood IJoist Composite EI
July 008 Esablishing Prefabricaed Wood I Composie EI INTRODUCTION Composie (glued/nailed) floors are common in boh residenial and commercial consrucion, and have been successfully designed by Prefabricaed
More informationBidPrice Control for EnergyAware Pricing of Cloud Services
BidPrice Conrol for EnergyAware Pricing of Cloud Services Marc Premm Universiy of Hohenheim, Deparmen of Informaion Sysems 2, Sugar, Germany marc.premm@unihohenheim.de Absrac. The amoun of elecrical
More informationPredicting Stock Market Index Trading Signals Using Neural Networks
Predicing Sock Marke Index Trading Using Neural Neworks C. D. Tilakarane, S. A. Morris, M. A. Mammadov, C. P. Hurs Cenre for Informaics and Applied Opimizaion School of Informaion Technology and Mahemaical
More informationPrice Controls and Banking in Emissions Trading: An Experimental Evaluation
This version: March 2014 Price Conrols and Banking in Emissions Trading: An Experimenal Evaluaion John K. Sranlund Deparmen of Resource Economics Universiy of MassachusesAmhers James J. Murphy Deparmen
More informationRelative velocity in one dimension
Connexions module: m13618 1 Relaive velociy in one dimension Sunil Kumar Singh This work is produced by The Connexions Projec and licensed under he Creaive Commons Aribuion License Absrac All quaniies
More informationµ r of the ferrite amounts to 1000...4000. It should be noted that the magnetic length of the + δ
Page 9 Design of Inducors and High Frequency Transformers Inducors sore energy, ransformers ransfer energy. This is he prime difference. The magneic cores are significanly differen for inducors and high
More informationDOES TRADING VOLUME INFLUENCE GARCH EFFECTS? SOME EVIDENCE FROM THE GREEK MARKET WITH SPECIAL REFERENCE TO BANKING SECTOR
Invesmen Managemen and Financial Innovaions, Volume 4, Issue 3, 7 33 DOES TRADING VOLUME INFLUENCE GARCH EFFECTS? SOME EVIDENCE FROM THE GREEK MARKET WITH SPECIAL REFERENCE TO BANKING SECTOR Ahanasios
More informationChapter 6: Business Valuation (Income Approach)
Chaper 6: Business Valuaion (Income Approach) Cash flow deerminaion is one of he mos criical elemens o a business valuaion. Everyhing may be secondary. If cash flow is high, hen he value is high; if he
More informationRepresenting Periodic Functions by Fourier Series. (a n cos nt + b n sin nt) n=1
Represening Periodic Funcions by Fourier Series 3. Inroducion In his Secion we show how a periodic funcion can be expressed as a series of sines and cosines. We begin by obaining some sandard inegrals
More informationDynamic programming models and algorithms for the mutual fund cash balance problem
Submied o Managemen Science manuscrip Dynamic programming models and algorihms for he muual fund cash balance problem Juliana Nascimeno Deparmen of Operaions Research and Financial Engineering, Princeon
More information4.8 Exponential Growth and Decay; Newton s Law; Logistic Growth and Decay
324 CHAPTER 4 Exponenial and Logarihmic Funcions 4.8 Exponenial Growh and Decay; Newon s Law; Logisic Growh and Decay OBJECTIVES 1 Find Equaions of Populaions Tha Obey he Law of Uninhibied Growh 2 Find
More informationSKF Documented Solutions
SKF Documened Soluions Real world savings and we can prove i! How much can SKF save you? Le s do he numbers. The SKF Documened Soluions Program SKF is probably no he firs of your supplier parners o alk
More informationDistributing Human Resources among Software Development Projects 1
Disribuing Human Resources among Sofware Developmen Proecs Macario Polo, María Dolores Maeos, Mario Piaini and rancisco Ruiz Summary This paper presens a mehod for esimaing he disribuion of human resources
More informationMarkov Chain Modeling of Policy Holder Behavior in Life Insurance and Pension
Markov Chain Modeling of Policy Holder Behavior in Life Insurance and Pension Lars Frederik Brand Henriksen 1, Jeppe Woemann Nielsen 2, Mogens Seffensen 1, and Chrisian Svensson 2 1 Deparmen of Mahemaical
More information4. International Parity Conditions
4. Inernaional ariy ondiions 4.1 urchasing ower ariy he urchasing ower ariy ( heory is one of he early heories of exchange rae deerminaion. his heory is based on he concep ha he demand for a counry's currency
More informationA TwoAccount Life Insurance Model for ScenarioBased Valuation Including Event Risk Jensen, Ninna Reitzel; Schomacker, Kristian Juul
universiy of copenhagen Universiy of Copenhagen A TwoAccoun Life Insurance Model for ScenarioBased Valuaion Including Even Risk Jensen, Ninna Reizel; Schomacker, Krisian Juul Published in: Risks DOI:
More informationRC, RL and RLC circuits
Name Dae Time o Complee h m Parner Course/ Secion / Grade RC, RL and RLC circuis Inroducion In his experimen we will invesigae he behavior of circuis conaining combinaions of resisors, capaciors, and inducors.
More informationWhy Did the Demand for Cash Decrease Recently in Korea?
Why Did he Demand for Cash Decrease Recenly in Korea? Byoung Hark Yoo Bank of Korea 26. 5 Absrac We explores why cash demand have decreased recenly in Korea. The raio of cash o consumpion fell o 4.7% in
More informationMultiple Structural Breaks in the Nominal Interest Rate and Inflation in Canada and the United States
Deparmen of Economics Discussion Paper 0007 Muliple Srucural Breaks in he Nominal Ineres Rae and Inflaion in Canada and he Unied Saes Frank J. Akins, Universiy of Calgary Preliminary Draf February, 00
More informationInformation Acquisition for Capacity Planning via Pricing and Advance Selling: When to Stop and Act?
OPERATIONS RESEARCH Vol. 58, No. 5, Sepember Ocober 2010, pp. 1328 1349 issn 0030364X eissn 15265463 10 5805 1328 informs doi 10.1287/opre.1100.0798 2010 INFORMS Informaion Acquisiion for Capaciy Planning
More informationINTEREST RATE FUTURES AND THEIR OPTIONS: SOME PRICING APPROACHES
INTEREST RATE FUTURES AND THEIR OPTIONS: SOME PRICING APPROACHES OPENGAMMA QUANTITATIVE RESEARCH Absrac. Exchangeraded ineres rae fuures and heir opions are described. The fuure opions include hose paying
More informationConstant Data Length Retrieval for Video Servers with Variable Bit Rate Streams
IEEE Inernaional Conference on Mulimedia Compuing & Sysems, June 173, 1996, in Hiroshima, Japan, p. 151155 Consan Lengh Rerieval for Video Servers wih Variable Bi Rae Sreams Erns Biersack, Frédéric Thiesse,
More informationMaking a Faster Cryptanalytic TimeMemory TradeOff
Making a Faser Crypanalyic TimeMemory TradeOff Philippe Oechslin Laboraoire de Securié e de Crypographie (LASEC) Ecole Polyechnique Fédérale de Lausanne Faculé I&C, 1015 Lausanne, Swizerland philippe.oechslin@epfl.ch
More informationA ProductionInventory System with Markovian Capacity and Outsourcing Option
OPERATIONS RESEARCH Vol. 53, No. 2, March April 2005, pp. 328 349 issn 0030364X eissn 15265463 05 5302 0328 informs doi 10.1287/opre.1040.0165 2005 INFORMS A ProducionInvenory Sysem wih Markovian Capaciy
More informationWATER MIST FIRE PROTECTION RELIABILITY ANALYSIS
WATER MIST FIRE PROTECTION RELIABILITY ANALYSIS Shuzhen Xu Research Risk and Reliabiliy Area FM Global Norwood, Massachuses 262, USA David Fuller Engineering Sandards FM Global Norwood, Massachuses 262,
More informationTable of contents Chapter 1 Interest rates and factors Chapter 2 Level annuities Chapter 3 Varying annuities
Table of conens Chaper 1 Ineres raes and facors 1 1.1 Ineres 2 1.2 Simple ineres 4 1.3 Compound ineres 6 1.4 Accumulaed value 10 1.5 Presen value 11 1.6 Rae of discoun 13 1.7 Consan force of ineres 17
More informationCannibalization and Product Life Cycle Management
MiddleEas Journal of Scienific Research 19 (8): 10801084, 2014 ISSN 19909233 IDOSI Publicaions, 2014 DOI: 10.5829/idosi.mejsr.2014.19.8.11868 Cannibalizaion and Produc Life Cycle Managemen Ali Farrukh
More informationChapter Four: Methodology
Chaper Four: Mehodology 1 Assessmen of isk Managemen Sraegy Comparing Is Cos of isks 1.1 Inroducion If we wan o choose a appropriae risk managemen sraegy, no only we should idenify he influence ha risks
More informationResearch Question Is the average body temperature of healthy adults 98.6 F? Introduction to Hypothesis Testing. Statistical Hypothesis
Inroducion o Hypohesis Tesing Research Quesion Is he average body emperaure of healhy aduls 98.6 F? HT  1 HT  2 Scienific Mehod 1. Sae research hypoheses or quesions. µ = 98.6? 2. Gaher daa or evidence
More information