Persuasion, Pandering, and Sequential Proposal

Size: px
Start display at page:

Download "Persuasion, Pandering, and Sequential Proposal"

Transcription

1 Persuasion, Pandering, and Sequential Proposal Johannes Shneider November 5, 2015 Abstrat I study a model in whih an informed sender an propose a projet to an uninformed reeiver. The reeiver an aept or rejet the projet s implementation. If the reeiver rejets, the sender an propose a different projet to the reeiver, whih, in turn, may be aepted or rejeted. Overall, only one projet an be implemented. Both players share preferenes about the features of the projet. Aross projets, preferenes are not aligned. There are two lasses of equilibria. There always is a mixed-strategy equilibrium in whih the sender panders towards the reeiver-preferred projet and the sender-preferred projet is only implemented with a probability less than one. If the time horizon is suffiiently long a seond type of equilibrium exists in whih the sender persuades by waiting. In priniple, many waiting equilibria exist. The shortest waiting equilibrium is ex-ante Pareto-dominated by the mixed strategy equilibrium, but a waiting equilibrium with intermediate waiting time is preferred by the reeiver to all other equilibria. As an appliation, I onsider a firm that needs learane of a proposed merger by an anti-trust authority. Merger realizations are private to the firm. Both players prefer higher synergies. The authority prefers high ompetition, the firm prefers low. Keywords: Persuasion, Dynami Negotiation, Information Design, Merger Regulation JEL odes: C78, D21, D82, L44, L51 I would like to thank my advisor Volker Noke for guidane and support. I also benefitted from onversations with and omments reeived by Maro Ottaviano, Thomas Tröger, Martin Peitz, Li Hao, Aleksandra Khimih, Takakazu Honryo, Keiihi Kawai, Peter Vida and the partiipants of the MaCCI Annual Conferene 2014, EEA-ESEM 2014, Earie Conferene 2014 and various seminars in Mannheim and Toulouse. Center for Dotoral Studies in Eonomis, University of Mannheim. josndr@outlook.de 1

2 1 Introdution An agent who implements a ertain projet often imposes an externality on the rest of the eonomy through implementation. Examples inlude mergers that hange the market onentration, patent appliations that limit ompetition, and researh projets that require resoures that otherwise are available for different purposes. To mitigate potential welfare losses aused by the projet hoies, agents are often required to apply to an authority who deides whether the proposed projet should be implemented. In many ases, however, the authority is less informed than the agent about both, the projet s realized quality itself, and the quality or existene of a potential alternative projet. If private benefits of the projet do not oinide with soial benefits, the agent might have a strategi inentive to withhold a projet for private benefits. Seeing an appliation, the authority must therefore answer the following questions: How large is the likelihood that an even better projet exists, but is not proposed by the agent? To what extend is it worth denying the urrent proposal in hope for a better proposal tomorrow? The aim of this paper is to study dynami projet hoie in a sender-reeiver framework. The sender has multiple rounds to propose projets to the reeiver, but only one projet an be implemented in total. The reeiver, in turn, an only implement projets if they have been proposed. Thus, all the reeiver an use as a signal for the quality of both the proposed and the not proposed projets is the hoie of the sender s proposal. That means the reeiver might rejet a proposal in hope for a better proposal tomorrow, even if she expets the urrent proposal to be benefiial. I show that in priniple two types of equilibria arise: the first is a mixed-strategy equilibrium in whih the authority aepts the reeiver s less preferred projet only with some probability. Similar to a related, stati model by Che, Dessein, and Kartik (2013) the sender panders towards the reeiver-preferred projet as she expets this to be implemented with a larger probability. However, the dynami setting allows for a seond type of equilibria, if the time horizon is large enough. These are equilibria in whih the sender persuades by waiting to propose the sender-preferred projet. The set of waiting equilibria is potentially large. The waiting equilibrium with the shortest waiting time yields the same payoff for the sender, but a lower payoff for the reeiver than the mixed strategy equilibrium. The reeiver s profits are highest in a waiting equilibrium with intermediate waiting time. The reason is that in suh a ase good realizations of the sender-preferred projet are implemented, but all others are deterred by the waiting period. As the waiting time inreases also good realizations are deterred and as the waiting time shrinks worse realizations are implemented. Both is not benefiial to the reeiver. 2

3 I ontribute to the understanding of projet hoie problems in many environments in that I show that hoosing an equilibrium with onsiderable delay is to the benefit of the reeiver, while the sender never prefers any delay. This may be important in setting up institutions that might determine whih type of equilibrium is played in reality. Authorities prefer to pik equilibria that involve onsiderable delay while private parties always prefer a quik solution. As an appliation, I onsider a firm (firm 0) within an oligopoly that proposes a merger with another firm to an antitrust authority. Upon seeing only the proposed merger, but not the realized synergies, the authority needs to deide whether to allow the merger or to blok it. Even if the merger is preferred to the status quo, the authority faes the trade-off whether to allow the proposed merger or to blok it in hope that firm 0 proposes an alternative merger with another firm in the next period. Different from Noke and Whinston (2010), I onsider non-disjoint mergers whih is why a myopi poliy is not optimal in this setting. I show that the implemented merger depends on the hoie of equilibrium. The analysis is motivated by two observations: first, a merger proposed by a given firm has typially two omponents: the merging partner and a realization of synergies. Seond, if a merger is denied, a firm an offer an alternative merger in the subsequent period. The two dimensions of a given merger proposal are partiularly interesting as preferenes are aligned in one dimension, but orthogonal in the other. Preferenes about post-merger marginal ost are aligned: both the firm and the authority prefer less ostly projets. Aross projets, however, preferenes differ: while the firm favors less ompetition post-merger, the authority wants to keep the level of ompetition as high as possible. The dynami omponent beomes partiular interesting if synergies are non-verifiable. Then the merging firms an only ommit on their identities, but not on the partiular realization. The authority, however, observing the merging firms identities an only form beliefs about the merger s quality based on the merger hoie by the proposing firm. Without ommitment power this means that the authority updates, both her beliefs on the proposed merger as well as on the non-proposed mergers before making a deision whether to aept or rejet the merger. Although both, firm and authority, disount future payoffs in the same way, inreasing the time needed to implement the firm-preferred projet is to the advantage of the authority. If the equilibrium is hosen suh that deisions are always made early in the proess, the firm is willing to propose her preferred projet whenever synergies are not far worse than in the authority-preferred projet. Different to that, an equilibrium that involves a longer waiting time for the firm-preferred merger results in the firm proposing the authority-preferred merger more often. As the authority-preferred merger an be allowed right at the beginning, 3

4 the time loss is mitigated for the authority. However, any equilibrium with a very long waiting time is neither preferred by the authority: on the one hand, the firm would, of ourse, always propose the authority-preferred merger if available. On the other hand, she would also do so in ase the synergies in this merger are very low, but those in the firm-preferred merger are very high. As authority and firm would prefer the same implementation in suh a senario senario, both would prefer an equilibrium with intermediate waiting time. The remainder of this paper is strutured as follows: in Setion 2, I give an overview on the related literature. Setion 3 introdues the general model and the solution onept. In Setion 4, I derive equilibria for the ase of two possible projets, and analyze the differenes. Setion 5 onludes. 2 Literature Review The paper by Che, Dessein, and Kartik (2013) is probably the losest to mine. Similar to my model, they are interested in a game between an informed sender and an uniformed reeiver. In their model, however, the reeiver an in priniple deide freely what to do, even without the proposal of the sender. While this assumption is reasonable in ase a deision maker hires an expert to tell her what to do, my model is more onerned about an authority that regulates what firms are allowed to do. In many situations authorities have only the power to blok ertain ations, but annot enfore a partiular ation of the firm. The pandering equilibrium in their model has similar harateristis to the mixed strategy equilibrium in my model. I show, however, that adding a dynami omponent also allows for a seond lass of equilibria, whih are worthwhile to study, as the authority is atually better off in some equilibria within this lass. As proposals are needed, my model is not a model of heap talk per se. However, given the multidimensionality of the projet realizations, I relate to a model by Chakraborty and Harbaugh (2010) who introdue multidimensionality into the heap talk literature. They show, that multidimensional heap talk often leads to full revelation. The major differene to this model is that senders in Chakraborty and Harbaugh (2010) an hoose in whih dimension to ommuniate to the reeiver, while the dimension is fixed in my model. Moreover, they, too, rely on the fat that the reeiver has all the deision power and an implement whatever produt she wants. Different to the literature on sequential delegation, e.g. Ková and Krähmer (2013), who show that sequential delegation supersedes if the differenes in preferene is small, I do not have gradual information arrival in my model, but a fixed multidimensional type spae. This model also ontributes to the old literature on multidimensional signaling of Quinzii 4

5 and Rohet (1985), Wilson (1985), and Milgrom and Roberts (1986). While Wilson (1985) and Milgrom and Roberts (1986) onsider one dimensional types with multidimensional signals, my model has multidimensional types, as e.g. Quinzii and Rohet (1985), but only a one-dimensional signal. Moreover, I onsider a dynami environment whih is why, even without expliit ost of signaling, the firm is equipped with a signaling motive. Sine produing the signal itself is ostless, this paper also relates to dynami bargaining models with one-sided inomplete information going bak to Sobel and Takahashi (1983). In line with that Fudenberg and Tirole (1983) and Admati and Perry (1987) formulated a theory whih uses time as a strategi variable. While Sobel and Takahashi (1983) and Fudenberg and Tirole (1983) have a similar negotiation struture to mine, that is one party makes an offer, the other an only aept or rejet and the game ontinues upon rejetion, Admati and Perry (1987) show that strategi delay an be used to signal one s type in two sided-bargaining problems. The main differene to the bargaining literature is that the signal spae in this paper is redued to the identity of the projet and payments are not allowed. Firms want to signal that whatever they propose is without alternative whih, if redible, would lead to immediate implementation. Thus, the firm tries not so muh to signal anything about the value of the urrent projet, but tries to disourage the authority s hope for a better projet in the future. In the appliation part, the model losest to mine is that of Noke and Whinston (2013). They, model a delegated hoie problem to derive optimal merger ontrol. The differene is that is, despite their model being stati, that the firm an verify her synergies in the proposed merger. Thus, the only private information the firm has is about the harateristis of the not proposed mergers. Further, Noke and Whinston (2013) assume full ommitment of the authority, whih is not assumed in my model. Asymmetri information between firm and authority has been studied also by Besanko and Spulber (1993) who were probably the first to model merger ontrol expliitly as a game between firms and authorities. 1 Ottaviani and Wikelgren (2011) introdue a hoie of timing on the side of the authority and derive onditions when ex-post merger ontrol is better than ex-ante merger ontrol. Dynami merger review is studied by Noke and Whinston (2010) and Sørgard (2009). Both papers look at disjoint mergers and how the deision on proposing the merger depends on the approval rule of the authority. Sørgard (2009) derives a rule that determines an optimal investigation probability, while Noke and Whinston (2010) onsider sequential proposal. They show that a myopi poliy is optimal if mergers are disjoint. The 1 A small literature on merger remedies also onnets to this paper, as projets an also be seen as different types of remedies. Papers that asses remedies before are, e.g. Lyons and Medvedev (2007), Cosnita and Tropeano (2009), Vasonelos (2010), and Cosnita-Langlais and Tropeano (2012). 5

6 main differene to my model is, that mergers are not disjoint in my model. Muh to the ontrary, I look at the different merger options by on single firm and ask how this effets the authorities deision. I find, different to the setup of Noke and Whinston (2010) that a myopi poliy is not optimal in suh a ase. In fat I show, that the authority an atually use the time dimension to sreen merger realization. 3 The General Model This setion gives a formal desription of the game to be played. 3.1 Setup Consider a game of two players, a sender (the firm) and a reeiver (the AA). The firm an hoose one among a set of projets to reommend to the AA by sending message m, and the AA an aept or rejet the proposed projet and a proposed projet only. The number of projets is N. The realisation of eah projet an be one of the following 1. with probability 1 > λ i > 0 projet i is not available, 2 or 2. with probability 1 λ i projet i is available. If projet i is available, its realisation i follows a random variable. I assume eah i to be independently drawn from a distribution F i with a density f i that is ontinuous on its support [, ]. 3 The firm reeives a payoff of δ t 1 π i ( i ) if projet i is implemented in period t, the AA reeives a payoff of δ t 1 w i ( i ). I assume that the funtions are ordered suh that > π 1 () > π 2 () >... > π N () > 0 and w 1 () < w 2 () <... < w n () < for any [, ]. 4 differentiable on [, ] and dereasing in its argument. Eah π i, w i is twie ontinuously The game has a total number of T periods and both players disount with fator δ < 1. The value of the status quo is normalised to 0. 2 Note: The non-availability probability subsumes not only the ases in whih a ertain projet is not available in the usual sense (in a merger ontext this ould be due to personal problems between CEOs,...). Moreover non-availability may also our if the projet is neither profitable for the firm nor the AA (for example if synergies are too low). In suh a ase the projet never gets proposed and may therefore be treated as if it was not available at all. 3 I assume ommon bounds for the ease of notation. None of the results depend on this if there is at least some overlap between the two. 4 In the ase of the merger framework, this reflets the firms preferenes.p. towards larger mergers (funtions of lower ardinality) while the AA prefers smaller mergers (funtions of higher ardinality). In addition, to reverse the preferene order ompletely simplifies omputations, but the general results do not depend too muh on this partiular preferene order. All I need is that firm and AA do not share the exat same order of preferenes. 6

7 For the sake of simpliity and to make the deisions non-trivial assume the following: Assumption 1. Given it is the only projet that is available, eah projet has, in expetation, a positive payoff to both players. In other words: E[w i ] > 0 i. Assumption 2. The probability distributions are suh that E[w n+1 ] > E[w n ] n. Assumption 3. Suppose the firm naively proposes the projet that maximises its payoff under full aeptane. Then, the distributions are suh that there exists at least one ase in whih the AAs best response is to wait for a better projet in the next round. More formally, this means: j i {1, 2,..., N} : E[δw j π i max k N π k] > E[w i π i max k N π k]. Assumption 1 is only to failitate omputations. It serves to ensure that the threat of non-availability of other projets is present for any projet i. Assumption 2, too, is for simpliity. It ensures that the AA not only pointwise prefers projets with higher ardinality, but prefers them in expetation, too. Both assumptions an be relaxed to milder versions, in whih they only hold in onditional expetations. Finally, the last assumption is made to make the problem interesting. It is, thus, ruial to the problem. If assumption 3 was not fulfilled, preferenes would be ompletely aligned, and the solution to the problem would be trivial. All, but the realisations of eah projet is ommon knowledge. The timing of the game is as follows: 1. Before the beginning of the first period, the firm privately observes the vetor of realisations ψ = ( 1, 2,..., N ). I may refer to the vetor also as the firm s type. The firm s type remains onstant throughout the game. To deal with the non-availability of ertain projets, assume that if a projet was not available (whih as noted above happens with probability λ i ), the entry in ψ is some number >. 2. At the beginning of eah period, the firm an propose (a) nothing (by posting identity 0 ) 7

8 (b) exatly one projet identity that i. is available, i.e. where i and 5 ii. has not been proposed in any previous period At the end of eah period, after observing a non- 0 -proposal, the AA an (a) aept the proposal: in this ase we arrive at a terminal node, the proposed projet gets implemented and payoffs realize (b) deny the proposal: in this ase the game advanes to the next period. 4. After the firm has proposed 0, the game ontinues independently of AA s ation. 7 I am looking for perfet Bayesian Nash equilibria in whih no player plays a weakly dominated strategy Ation and Strategies The firm s hoie is a funtion that determines its proposal at eah time t. This funtion is a mapping from the set of possible types ψ defined as Ψ to some message m t. That is, m t : Ψ M t (Ψ, H t 1 ). By the rules of the game the set of available messages M t depends both on the type of the firm (sine non-available states are exluded) and the history (sine re-proposal is exluded). Thus, at time t and for a given state ψ the set of available messages, M t (ψ), is defined as M 1 (ψ) = {i : i } 0 M t+1 (ψ) = M t (ψ) \ m t 0 t 0. 5 Again this assumption is made to simplify the argument. An alternative way to model redued form unavailability would be to assume that an unavailable projet has a negative payoff to firm and authority. This way, if the AA aepts the proposal with positive probability, the firm would never propose it or withdraw her offer after it has been made, whih is essentially the same as proposing 0. To avoid unneessary notation, I simply assume suh a proposal is not possible. 6 This assumption redues the set of possible equilibria. Allowing re-proposal might ause equilibria in whih the firm persistently proposes the same projet. All equilibria I derive in this setting here, easily survive in a world were re-proposal is possible. Moreover, the set of equilibria I derive here without reproposal survives ertain refinements, whih they survive in the re-proposal setup as well. 7 A variant in whih this is not the ase is studied in setion Sine this is a two player game, this restrition is equivalent to using an strategi form trembling-hand refinement. 8

9 Thus, the firm an only post an available projet identity that has not been proposed before (i.e. a positive number) or 0 (the Null-Projet) whih means that it does not wish to implement anything. The strategy of the AA is slightly more omplex and involves a funtion that determines the aeptane probability and a funtion of beliefs over types. Before taking an ation, the AA forms a belief about the type of the firm. The belief funtion takes the following form β t : H t 1 (Ψ), where H t = {m 1,..., m t } is an ordered set of reeived messages 9 and (Ψ) is the set of probability distributions over the possible states. The AA hooses further a funtion ρ t in eah period to determine the aeptane probability after having reeived proposal m t. That is ρ t : M max 0 \ H t 1 [0, 1]. where M max 0, the maximal message spae at the beginning of the game, is simply the vetor {1,..., N} sine in priniple eah projet has a positive probability of being available and thus in the message set. After eah round, the AA an remove all elements out of the message set that already have been proposed sine we exluded re-proposal. 3.3 Equilibrium Desription A onfiguration { {m } T t=1, {ρ t } T t=1, {β t } T t=1} is a trembling-hand perfet Bayesian Nash equilibrium if the following onditions hold: m t is hosen out of a set of best responses to the equilibrium probability funtion of the AA. This set of best responses, M (ψ, ρ t, H t 1 ) is desribed as M (ψ, ρ t, H t 1 ) = {i M t : V (i, ψ, ρ t, H t 1 ) V (j, ψ, ρ t, H t 1 ) j M t } ( ) where V (i, ψ, ρ t, H t 1 ) is the value of proposing projet i in period t after having 9 Formally, to be preise we need to define the order H as m i H m j i > j and H t as the set of all messages send up to point t. H t ( H t, H ) is then the funtion that desribes this ordered set. For the ease of notation I am going to suppress the arguments H t and H. 9

10 proposed history H t 1 in the past and ating optimally thereafter. 10 To put some struture on V (i, ψ, ρ, H t 1 ) it is useful to distinguish between two types of value funtions: i. V (i, ) denotes the beginning of period value funtion, that is the value of proposing projet i at the beginning of a period and ating optimally thereafter. ii. Ṽ (i, ) is the end of period value funtion, that is, it desribes the value the hoie of i has on all future periods given the firm ats optimally after that partiular period. Note that Ṽ is only an auxiliary onstrution to properly desribe the V, sine for message m t it holds that Ṽ (m t, ρ t+1, ψ, H t 1 ) = δv (m t+1, ρ t+1, ψ, H t 1 m t ). Ṽ serves the simple purpose to spell out the beginning of period value funtion: 11 V (i, ) = ρ t (i)π i ( i ) + (1 ρ t (i)) Ṽ (i, ). The equilibrium probability funtion ρ t is hosen suh that, for all messages sent with a ex-ante positive probability, it holds that 0 if E t [w mt H t ] < δυ (H t ) ρ t (m t ) 1 if E t [w mt H t ] > δυ (H t ). ( ) [0, 1] else Where E t [ H t ] denotes the (rational) expetations of the AA in period t onditional on a history of messages H t, that is already inluding m t. Further, Υ (H t ) is the expeted value at the beginning of the next period onditional on rejeting this periods offer and ating optimally thereafter. Beliefs β t are onsistent with Bayes rule whenever possible. No player plays a weakly dominated strategy. 4 Equilibrium for N=2 For the sake of tratability, I am onsidering the ase of only two projets here. 10 Note that the time dependeny of the deision is already inorporated in the variables ρ t and H t 1 suh that the value funtion it self an be modelled as time independent. 11 For the ease of notation it is, without loss of generality, assumed that ρ t (0) := 0. 10

11 4.1 Equilibrium of the modified game Before looking at the general game, I want to fous on a slightly modified version for the ease of exposition. Definition 1. A game is alled modified if it follows the setup as it was laid out in setion 3 exept for the additional rule that the game ends diretly whenever the firm proposes 0, i.e. the null-projet. 12 This modifiation is primarily of didati use as it redues the number of equilibria. Later, I am going to show that the result also survives in the general game even under quite demanding refinement riteria and disuss other equilibria (and there relation to this one) that exist only in the general game. The modified game with only two possible projets has a simple type spae, namely a vetor ψ = ( 1, 2 ), and a message set in the first period that is at most {0, 1, 2}. Under assumption 1 and 3, proposing naively annot result in an equilibrium. The AA would never aept projet 1 and thus proposing 1 when 2 is also available is not optimal. If λ 2 > 0, rejeting 1 always and aepting 2 an also not be an equilibrium if we do not allow for weakly dominated strategies. Sine we ruled out weakly dominated strategies, the firm would always propose projet 1 if it is the only projet available and under assumption 1 the AA should aept it. Moreover, it is even possible to state the following. Lemma 1. For the ase of N = 2 and under assumption 1 and 3, no pure strategy tremblinghand perfet equilibrium exists in the modified game. The proof of this lemma an be found in appendix A, as an all others not in the text. The intuition behind this lemma is straight forward. Proposing 0 is always weakly dominated if any other proposal is available sine a proposal of 0 neessarily terminates the game and keeps the status quo, whih is never preferred by the firm if any projet is available. Thus the firm is always going to propose something. Assumption 3 rules out that the AA just waives whatever projet is proposed. Sine with some probability eah projet is not available, it annot be optimal to unonditionally blok a ertain projet either. The firm best responds to suh a bloking strategy by proposing the projet only if it is the only one available. With this strategy of the firm, however, unonditional bloking is not optimal sine eah projet is profitable in isolation (assumption 1). Thus, pure strategies played by the AA an never be optimal. 12 An equivalent formulation would be a setting in whih the authority an shut down negotiations by formally aepting the null projet and implementing it. Again, the equilibrium proposed in this setion would survive suh a game. 11

12 Sine every finite game has at least one trembling-hand-perfet Nash equilibrium, 13 the trembling-hand-perfet equilibria must involve at least one mixing party. In fat, sine projet realizations are ontinuously distributed, the AA is the only player that is going to mix on more than a probability zero set. To onstrut the equilibrium, first reall the equilibrium onditions from equation ( ) and equation ( ). For the equilibrium onstrution assume that the seond projet is the onditionally better looking one, i.e. Assumption 4. E[w 1 π 1 > π 2 ] < δe[w 2 π 1 > π 2 ]. Although it puts some restrition on the distributions, this assumption still allows for a wide range of distributions. Whenever both state variables 1, 2 are identially distributed or if 2 does not have too muh weight on high ost draws we always an find a δ < 1 suh that the assumption is fulfilled. Further assume that projet 2 is always aepted. 14 Under these assumptions, the probability q ρ (ψ) of proposing projet 1 for a given aeptane probability ρ 1 (1) = ρ is haraterised by 0 if ρπ 1 ( 1 ) ζπ 2 ( 2 ) q ρ (ψ) = 1 if ρπ 1 ( 1 ) > ζπ 2 ( 2 ) (1) with ζ = (1 δ + ρδ) [0, 1], whih aounts for both the alternative proposal and the seond round. In equation (1) we may assume that the firm does not mix sine indifferene only happens on a probability zero set of ψ. With the help of equation (1), it is possible to onstrut a ut-off funtion ρ ( 2 ) that assigns, given ρ and 2, a unique value suh that for all 1 < the firm prefers to propose projet 1 while she is going to propose projet 2 whenever 1 >. The funtion takes the following form: ρ ( 2 ) := max{ 1 : ρπ 1 ( 1 ) ζπ 2 ( 2 )} if it is not if 2 = else. ( ) Note that the funtion ( ) is defined for eah ρ > 0 over 2 [, ] and has the following properties: i. it is ontinuous in ρ and 2, sine π 2 is ontinuous; 13 The proof of this is due to Selten (1975) and an be found in various textbooks suh as Fudenberg and Tirole (1991) and Mas-Colell, Whinston, and Green (1995). 14 Later, I show that in equilibrium this is indeed the ase. 12

13 ii. it is weakly inreasing in 2 sine π 1 ( 1 ) and π 2 ( 2 ) are both dereasing in their arguments; iii. it is weakly inreasing in ρ sine the left-hand side of the inequality inreases in ρ and π 1 () dereases in ; iv. for fixed ρ it is weakly inreasing in δ sine the right-hand side dereases in δ, giving the inequality (weakly) more slak at all points. v. as ρ 0, ρ for all 2. Sine π 2 () > 0 for all 2 there exists an ε 2 > 0 suh that ρ < ε 2 ρ ( 2 ) =. Monotoniity of π 2 ( 2 ) ensures that ε 2 is dereasing in 2 ; vi. sine π 1 > π 2 by definition, it holds that there also exists an ρ < 1 suh that for all ρ > ρ we have ρ ( 2 ) 2 ; vii. as a onsequene of the monotoniity in both arguments, it also holds that the smallest 2 at whih the highest ρ ( 2 ) is reahed 15 (weakly) dereases in ρ. (), on the other hand, inreases in ρ. To define the equilibrium ation of the AA, reall equation ( ). By Lemma 1 we have exluded pure strategy equilibria, thus, 1 > ρ > 0. To re-write ondition ( ), define 1 2 to be the event in whih projet 1 is reommended although projet 2 is available, too, and define 1 0 to be the event at whih 1 is sent and it is the only message other than 0 that is feasible. Sine ondition ( ) defines the optimal behaviour of the firm for any ρ and therefore determines the probabilities and expetations of events 1 2 and 1 0, it is suffiient to rewrite ondition ( ) as follows E[w 1 m 1 = 1] = E[δw 2 m 1 = 1] (1 λ 2 )E[w ] + λ 2 E[w ] = (1 λ 2 )E[δw ] (1 λ 2 )E[w ] + λ 2 E[w 1 ] = (1 λ 2 )E[δw ] ( ) (1 λ 2 ) (E[w 1 δw ]) + λ 2 E[w 1 ] = 0, where λ 2 = λ 2 λ 2 +(1 λ 2 )P (m=1 1 2 ). The first step divides expetations into two subsets. The seond then makes use of the fat that, given that projet 1, but not projet 2, is available, the firm would always propose 15 Typially this highest ρ ( 2 ) =, but one may hoose a ρ small enough that even ρ () <. 13

14 1 in order to not play a weakly dominated strategy. Notiing that w 2 and w 1 in the first term are onditioning on the same event gives the third step of equation ( ). Lemma 2. If assumption 1 and 4 hold, there always exists a ρ suh that 1 > ρ > 0 and equation ( ) are fulfilled. Intuitively, this lemma says that it is always possible to hoose a ρ so low that whenever both projets are available, the firm hooses the seond projet. In turn, this hoie means that the firm only (weakly) prefers to offer projet 1 if nothing else is available. If it did so whenever only 1 was available, the AA would want to aept that proposal sine it is welfareinreasing in expetations. Sine gradual hanges in ρ lead at most to a gradual hange in both expetations, the differene of the two is ontinuous. If the differene is ontinuous, the indifferene ondition must, in line with the intermediate value theorem, eventually be satisfied for some 1 > ρ > 0. In fat, it is possible to derive an even stronger statement Lemma 3. If the onditions for Lemma 2 hold, then whatever ρ solves equation ( ) is unique. The intuition to this lemma is, again, quite simple. As ρ inreases, the firm inreases the number of states in whih it proposes projet 1. For any given 2, this inrease leads to additional states that are all worse than the worst state under the original regime. Therefore, the expeted payoff the AA earns from implementing projet 1 an only fall in ρ for proposals of 1. The expetations of postponing implementation, on the other hand, inrease for the same reasons, sine there is a larger set of desirable 2 that lead to a proposal of 1. Thus, inreasing ρ dereases the expeted payoff when implementing 1 and inreases the expeted payoff of waiting for any ρ. Consequently equation ( ) an at most hold for one ρ (0, 1). To desribe the equilibrium, it remains to show that it is optimal to always aept projet 2, i.e. E[w 2 m = 2] δe[w 1 m = 2] needs to hold under the equilibrium ρ. This is guaranteed by assumption 2, as the following lemma shows. Lemma 4. The AA prefers projet 2 over projet 1 whenever 2 is proposed. The intuition underlying this lemma is that, in expetation, whenever the firm proposes a ertain projet, this projet needs to be better than a ertain threshold. In turn, whenever the firm does not propose a projet it must have a worse realization than this threshold. Sine in equilibrium the AA is indifferent under the proposal of 1, the expeted payoff from projet 2 s realization must be higher for the authority if the firm proposes 2. Expetations of waiting after the proposal of projet 2 must be smaller by the same argument. Thus always aepting projet 2 is optimal in equilibrium. 14

15 Combining Lemma 2 and 4 provides existene of a mixed strategy equilibrium as the following lemma shows Lemma 5. Suppose assumption 1, 2 and 4 hold. Then, there exists a unique mixed strategy trembling hand perfet Baysian Nash equilibrium in the modified game with the following properties: The seond projet is aepted whenever it is proposed. The first projet is aepted with probability ρ < 1. If the seond stage is reahed, proposal projet 2 in the seond stage gets aepted. Firms propose projet one whenever ψ is suh that 1 < ρ ( 2 ). 4.2 Comparison to the original game All the results of the previous setion have been derived under the assumption that players play the modified game. In this setion, I am going to disuss how these results arry over to the original game. Theorem 1. There exists an equilibrium of the original game that has the following properties: It is outome equivalent to the unique equilibrium of the modified game On the equilibrium path ations are idential to the ones of the modified game The equilibrium does not fail the universal divinity, if any of the two onditions holds i. the aeptane probability ρ is larger than the disount fator δ, or ii. the worst projet is smaller than the outside option w 1 () < 0. The ruial aspet for survival of the refinement is to find beliefs suh that the AA wishes to deny off equilibrium proposals. For the seond proposal this is not that hard sine the firm never wishes to deviate sine that only would inur time osts. Thus, any type is equally likely to deviate. The story is quite different for projet 1. There might be a reason to wait for the firm if it beliefs that in later periods the aeptane probability was large enough. For sure, any off-path aeptane probability that attrats at least some type ˆψ must also attrat all types that annot propose projet 2 beause it is unavailable. However, disriminating between those is not possible, sine they are all only interested in implementing projet 15

16 1. This way, if any type has, for some off-path aeptane probability any inentive to go off-path, also the type ψ = (, ) has an inentive to do so. This is, by definition the worst type in terms of payoff for the AA. Thus, if there is at least one state suh that the AA prefers the outside option, she prefers the outside option to implementing projet 1 under ψ. Sine this type engages in all off-path ativities, it annot be exluded under universal divinity. Thus, if the AA beliefs any deviator is of type ψ she has reason to deny it and the equilibrium sustains. The ruial aspet for the sustainability of the equilibrium is the fat that there exists a positive probability that the better looking projet does not exist. Together with the seond restrition, namely that w 1 () < 0, the non-availability guarantees universal divinity for any length of the game. Thus, the existene of the equilibrium of the modified game arries over to the general game even if we were to restrit our self to a rather narrow set of equilibria. Uniqueness, however, does not neessarily survive. In partiular, the two dimensional type spae of the firm allows for a wide range of equilibria if we onsider the generalized game. Together with the possibility to sent the 0 message as often as possible a wide range of justifiable off-equilibrium beliefs an be onsistent even under strit refinements suh as universal divinity. To understand this reall that the equilibrium of the modified game does not fail universal divinity in the general game simply beause all types for whih projet 2 was not available survive the iterated D2 riterion. That is, if the AA sees a proposal of projet 1 anywhere off the equilibrium path it an, even with strong restritions be of any type (regarding projet 1 s ost funtion). If negotiations go on for suffiiently many rounds, that is if T is large enough, a seond set of equilibria whih I am going to all waiting equilibria would arises. In suh a waiting equilibrium the firm proposes the null-projet for suffiiently many rounds in order to signal that the ex-ante AA-preferred projet is of poor quality or not available. In the traditional bargaining literature these are sometimes the only equilibria that survive even mild refinements and they are typially alled signalling equilibria. 16 In the present ontext signalling also is an issue in the ρ -equilibrium desribed above, whih is why I differ in terminology. The deision whether to aept or rejet an offer made by the firm in those type of equilibria is in fat very similar too the deision rule in the ρ -equilibrium. Whenever the AA believes that the projet offered in the urrent round is at least as good as the disounted value of what she an expet in the future, she would aept the proposed projet, whenever this is not the ase she denies approval. Given this, the firm might delay its proposal 16 Examples would be Admati and Perry (1987) or Cramton (1992) 16

17 strategially under some irumstane while it may prefer to propose something that gets aepted right away instead of suffering the ost of waiting. More preisely, suppose the AA always aepts projet 2 and aepts projet 1 only at time t τ Then for eah 2 it is possible to onstrut a funtion ĉ τ ( 2 ) suh that the firm hooses to propose projet 1 in period τ whenever 1 < ĉ τ ( 2 ) and projet 2 (if possible) in all other ases. More formally this is max{ 1 : δ τ π 1 ( 1 ) π 2 ( 2 )} if it is not ĉ ρ ( 2 ) := if 2 = ( ) else. This funtion almost perfetly orresponds to ρ( 2 ) defined in the beginning of this setion. Consequently, this, too, provides a utoff value for the firm given any τ. As in the other equilibrium the AA optimally hooses τ suh that whenever the firm proposes projet 1 in period τ + 1 it holds that the AA only aepts the proposal if E τ+1 [w 1 H τ+1 ] δe τ+1 [w 2 H τ+1 ]. define the term. Before desribing the possible waiting equilibria let us first properly Definition 2. An equilibrium is alled a waiting equilibrium at τ if it is an equilibrium of the game and the authority uses the following strategy: Projet 2 is aepted in any period Projet 1 is rejeted in any period t τ and aepted in all other periods. Next, it is straightforward to use the utoff funtion ĉ τ derived above to desribe the equilibrium that is losest related to the ρ -equilibrium from above. Lemma 6. Consider a ertain speifiation of the game and fix the equilibrium at ρ. Ignoring the integer onstraint in t there exists a waiting equilibrium at τ where τ = ln(ρ ) ln(1 δ(1 ρ )) ln(δ) that orresponds in the firms deision rule to the ρ -equilibrium, that is ĉ τ ( 2 ) = ρ ( 2 ) for all 2. This equilibrium may be onsidered as the shortest possible waiting equilibrium in a sense that all other waiting equilibria require a waiting time τ τ. Moreover, if and only if ρ > δ, then τ < 1. δ+1 17 To understand why this is τ + 1,reall that a proposal in t=2 is disounted with δ 1 sine partiipants ex-ante payoffs are given in period one values. 17

18 The intuition behind this beomes quite lear if you think about what happens if the AA aepts proposals of projet 1 too early. Then the firm would propose them in a way, suh that the AA better denies it in hope of a better outome on the other projet. From the onstrution of the ρ -equilibrium it is already lear that whenever the firm deides via utoff rules, then there exists a unique deision funtion suh that the AA is indifferent in expetations between the two projets. While this funtion was enfored in the ρ -equilibrium with the aeptane probability, it is now done by appropriately hoosing τ. Sine the two orrespond we just need to look for the parameter in whih the funtions are idential. This is what desribes the smallest τ. In the model, of ourse, time is disrete and thus the above desribed point is generially never an integer. However, as the following proposition shows, for all τ > τ a waiting equilibrium at τ exists. Theorem 2. If T 1 > τ, there exists a set of waiting equilibria at τ for all τ suh that τ τ T 1. All waiting equilibria survive under the refinement of universal divinity if w 1 () < 0 While eah equilibrium on its own is in fat independent of the maximum duration of the game, there is a one to one mapping between numbers of proposal rounds played after τ and the number of waiting equilibria that exist. 4.3 Welfare effets To ompare the different equilibria it is useful to think about how the equilibrium payoffs in the different equilibria behave and to exerise some omparative statis. Following the order in whih the equilibria were haraterized, I start by examining the ρ -equilibrium and thereafter looking at the waiting-equilibria. Besides omparing the equilibria with eah other, a natural benhmark would also be the (ex ante) equilibrium payoffs if the AA had the ability to ommit ex-ante to aepting only projet 2. This benhmark ase is going to be alled a onservative AA throughout the rest of the paper. To simplify notation denote E a [w ρ ] to be the ex-ante payoff expetation of the AA under equilibrium aeptane probability ρ as in the equilibrium of setion 4.1 and let E a [w 0] be the ex-ante expetations if the AA was to deny projet 1 always, i.e. behaving onservatively. Proposition 1. The ρ -equilibrium always assigns a lower payoff to the AA than she gets when ommitting to only aepting the seond projet. 18

19 Proof. The mixed strategy equilibrium inreases the AA s payoff only if E a [w ρ ] > E a [w 0]. The following argues that this is not true. Spelling out the first yields E a [w ρ ] =(1 λ 2 )(1 λ 1 ) w 2 ( 2 ) (1 F 1 ( ρ ( 2 ))) df 2 ( 2 ) (2) + (1 λ 2 )λ 1 E[w 2 ] (3) + (1 λ 2 )(1 λ 1 ) δw 2 ( 2 )F 1 ( ρ ( 2 ))df 2 ( 2 ), (4) where the first is the expeted value in ase both projets are available and projet 2 is proposed given ρ, the seond is the part in whih projet 2 is proposed sine it is the only one available, and the last part overs the expetations whenever 1 is proposed, using the indifferene ondition ( ). Further we may deompose E a [w 0] =(1 λ 2 )E[w 2 ] =(1 λ 2 ) ( λ 1 E[w 2 ] + (1 λ 1 )E [ w 2 ] ) =(1 λ 2 )λ 1 E[w 2 ] + (1 λ 2 )(1 λ 1 ) =(1 λ 2 )λ 1 E[w 2 ] + (1 λ 2 )(1 λ 1 ) =E a [w ρ ] + (1 δ)(1 λ 2 )(1 λ 1 ) w 2 ( 2 )df 2 ( 2 ) w 2 ( 2 ) (F 1 ( ρ ( 2 ) + (1 F 1 ( ρ ( 2 ))) df 2 ( 2 ) w 2 ( 2 )F 1 ( ρ ( 2 ))df 2 ( 2 ). (5) } {{ } 0 The first step just spells out the onditional expetations, the seond divides it into the events in whih projet one is or is not available. The third transforms them into integral form, the fourth multiplies with 1 to bak out the ex-ante expetations of the equilibrium in the last step. Sine expetations in equilibrium are positive when 1 is proposed, the leftover term is positive. Thus, from an ex-ante point of view the AA prefers aepting only projet two if both were available. 19

20 Intuitively, this is rather obvious if one thinks about the different hannels at work in the model. If the AA was able to allow only projet 2 the firm an never exploit the game in her preferred way if opinions about optimal ations differ. Thus, the persuasion hannel is ompletely shut down. Pandering, to the ontrary, is driven to its maximum. 18 Finally, the sequentiality hannel is shut down as well, sine in equilibrium there is no seond period. This sequentiality works, as we saw in the disussion of the equilibrium, as an insurane for the firm to try out her preferred projet. That way, ommitment to pure strategies in fat must work in favour of the AA sine it only shuts down the hannels that benefit the firm. The AA therefore earns something like a onservative ommitment markup. To failitate later omparison it is useful to think of this markup as relative to the expeted payoff if only projet 2 was was proposed. To do so, define and rewrite equation (5) as φ(ρ ) := E[w 0] E[w ρ ] E[w 0] E a [w 0] = (1 φ(ρ ))E a [w 0] + φ(ρ )E a [w 0]. (6) In this ontext φ an be interpreted as the relative onservative ommitment markup (RCCM). With this reformulations it is easier to tell how muh (in relative terms) the AA looses by being unable to ignore any proposals of 1 in equilibrium. Proposition 2. Consider the ρ -equilibrium. An inrease in the time preferene parameter δ leads to a derease in the aeptane probability ρ, a derease in the ex-ante likelihood that projet 1 is being proposed and a derease of the RCCM (and a higher absolute payoff for the AA). While an inrease in δ dereases the ost of waiting one more round for both the firm and the AA, the inreased expeted welfare in the seond period leads the AA to redue its probability of aepting the first projet. That means that the firm redues the states at whih it proposes the first projet and panders more towards the seond. This way it needs 18 In fat ex-ante pandering is optimal from the point of view of the AA. However, on an interim stage there might atually be over-pandering, that is the firm proposes a projet that both firm and AA prefer less than the other one (interim), but that was not preferred ex-ante by the AA. 20

21 0.8 Aeptane Probability 30 Shortest Waiting Equilibrium 4 Commitment Markup δ λ Disount fator δ Aeptane Probability Disount fator δ Shortest Waiting Equilibrium Disount fator δ Commitment Markup Non-availability of projet 2 in % Non-availability of projet 2 in % Non-availability of projet 2 in % Figure 1: Comparative statis with respet to availability of the seond projet λ 2 and disount fator δ. The upper panels deal depit effets on the ρ -equilibrium and the lower panels that on the shortest waiting equilibrium. to give up some of the gains from the inreased δ. Further, the ommitment markup goes down and thus, the AA loses less from not being able to ommit to a pure strategy. 19 Another interesting omparative statis in this model is the effet of non-availability of the seond projet. This sheds light on to the point of how muh the threat of not having an alternative projets works in favour of the firm. Lemma 7. Consider the mixed strategy equilibrium ρ. An inrease in the non availability probability of projet 2, λ 2, leads to an inrease in the aeptane probability ρ in equilibrium an inrease in the ex-ante likelihood that projet 1 is being proposed and an inrease of the RCCM. This result is, of ourse, not very surprising. As it beomes more likely that the seond projet is not available at all, the firm reates, by proposing projet 1, a larger threat to the AA that this is the only projet it has in fat. Thus, given projet 1 has been proposed, there is a higher hane that it is the only one around (in whih ase the AA would want to aept) and the interim expetations of the AA are driven down. She reats by inreasing the aeptane probability. 19 In setion 4.4 I disuss why ommitment to a pure strategy is not optimal either and why this leads to lower redibility of a ommitment assumption on the AA s side. 21

22 In terms of the AAs payoffs under no ommitment, to the ontrary, the story is not so lear sine λ 2 effets both the ex-ante expetations of a onservative strategy as well as those under the equilibrium strategy. The relative mark-up inreases nevertheless, as the interim pressure the firm an put on the AA inreases with a higher probability of projet one being the only one available. Turning to the waiting equilibria, it might at first be interesting to see how the set of possible waiting equilibria hanges with the parameters. While the largest waiting equilibrium (if any suh equilibrium exists) is always defined by T, as Theorem 2 shows, the shortest waiting equilibrium might hange as we hange the parameters of the model. With help of Lemma 6 it is obvious that all parameters exept the disount fator δ effet τ only through ρ. Observe, that τ ρ = 1 ln(δ)ρ 1 δ 1 δ(1 ρ ) < 0. Thus, as ρ inreases τ dereases. The reason an easily be found in the equivalene of the deisions rules of the firm in both equilibria. Therefore, a higher effetive aeptane probability needs to result in a smaller minimum waiting period. 20 The only parameter, that effets τ also in another way than through ρ, is the disount fator δ. Its effet on τ is not all that obvious sine the diret effet ould go either way. Nonetheless, as the following lemma shows, the overall effet of a hange in δ on τ has the opposite sign than a hange of δ has on ρ. Lemma 8. Consider a waiting equilbrium at τ. An inrease in the disount fator δ leads to an inrease in τ. Even if the effet though ρ always supersedes the diret effet of δ, the additional effet that a hange in the disount fator has already points towards the presene of some differene in the analysis of the waiting equilibria ompared to that of the ρ -equilibrium. These differenes are what is going to be onsidered next. To do so, I espeially fous on two effets not present in the ρ -equilibrium, that may, in addition, help to understand the hange in payoff between the different waiting equilibria. First, eah round of waiting dereases the AAs payoff sine the agreement is reahed later in time. The AA is impatient and therefore suffers ost of delay. Seond, and quite 20 In fat, in terms of elastiity, one an show that the movements do not orrespond one-to-one but that τ shrinks less than proportional ompared to the inrease in ρ if δ > ρ sine that implies 0 > τ ρ ρ τ > 1. 22

Persuasion, Pandering, and Sequential Proposal

Persuasion, Pandering, and Sequential Proposal Persuasion, Pandering, and Sequential Proposal A merger appliation Johannes Shneider August 24, 2014 Abstrat In this paper, I look at the features of a model in whih an informed sender an propose a projet

More information

Can Learning Cause Shorter Delays in Reaching Agreements?

Can Learning Cause Shorter Delays in Reaching Agreements? Can Learning Cause Shorter Delays in Reahing Agreements? Xi Weng 1 Room 34, Bldg 2, Guanghua Shool of Management, Peking University, Beijing 1871, China, 86-162767267 Abstrat This paper uses a ontinuous-time

More information

On the Licensing of Innovations under Strategic Delegation

On the Licensing of Innovations under Strategic Delegation On the Liensing of Innovations under Strategi Delegation Judy Hsu Institute of Finanial Management Nanhua University Taiwan and X. Henry Wang Department of Eonomis University of Missouri USA Abstrat This

More information

Product Policy in Markets with Word-of-Mouth Communication. Technical Appendix

Product Policy in Markets with Word-of-Mouth Communication. Technical Appendix rodut oliy in Markets with Word-of-Mouth Communiation Tehnial Appendix August 05 Miro-Model for Inreasing Awareness In the paper, we make the assumption that awareness is inreasing in ustomer type. I.e.,

More information

Methods of evaluating tests

Methods of evaluating tests Methods of evaluating tests Let X,, 1 Xn be i.i.d. Bernoulli( p ). Then 5 j= 1 j ( 5, ) T = X Binomial p. We test 1 H : p vs. 1 1 H : p>. We saw that a LRT is 1 if t k* φ ( x ) =. otherwise (t is the observed

More information

On Industry Structure and Firm Conduct in Long Run Equilibrium

On Industry Structure and Firm Conduct in Long Run Equilibrium www.siedu.a/jms Journal of Management and Strategy Vol., No. ; Deember On Industry Struture and Firm Condut in Long Run Equilibrium Prof. Jean-Paul Chavas Department of Agriultural and Applied Eonomis

More information

Taste for variety and optimum product diversity in an open economy

Taste for variety and optimum product diversity in an open economy Taste for variety and optimum produt diversity in an open eonomy Javier Coto-Martínez City University Paul Levine University of Surrey Otober 0, 005 María D.C. Garía-Alonso University of Kent Abstrat We

More information

Word of Mass: The Relationship between Mass Media and Word-of-Mouth

Word of Mass: The Relationship between Mass Media and Word-of-Mouth Word of Mass: The Relationship between Mass Media and Word-of-Mouth Roman Chuhay Preliminary version Marh 6, 015 Abstrat This paper studies the optimal priing and advertising strategies of a firm in the

More information

Complexity of Regularization RBF Networks

Complexity of Regularization RBF Networks Complexity of Regularization RBF Networks Mark A Kon Department of Mathematis and Statistis Boston University Boston, MA 02215 mkon@buedu Leszek Plaskota Institute of Applied Mathematis University of Warsaw

More information

A Queueing Model for Call Blending in Call Centers

A Queueing Model for Call Blending in Call Centers A Queueing Model for Call Blending in Call Centers Sandjai Bhulai and Ger Koole Vrije Universiteit Amsterdam Faulty of Sienes De Boelelaan 1081a 1081 HV Amsterdam The Netherlands E-mail: {sbhulai, koole}@s.vu.nl

More information

Internet Appendix for Proxy Advisory Firms: The Economics of Selling Information to Voters

Internet Appendix for Proxy Advisory Firms: The Economics of Selling Information to Voters Internet Appendix for Proxy Advisory Firms: The Eonomis of Selling Information to Voters Andrey Malenko and Nadya Malenko The first part of the Internet Appendix presents the supplementary analysis for

More information

A Functional Representation of Fuzzy Preferences

A Functional Representation of Fuzzy Preferences Theoretial Eonomis Letters, 017, 7, 13- http://wwwsirporg/journal/tel ISSN Online: 16-086 ISSN Print: 16-078 A Funtional Representation of Fuzzy Preferenes Susheng Wang Department of Eonomis, Hong Kong

More information

Computer Science 786S - Statistical Methods in Natural Language Processing and Data Analysis Page 1

Computer Science 786S - Statistical Methods in Natural Language Processing and Data Analysis Page 1 Computer Siene 786S - Statistial Methods in Natural Language Proessing and Data Analysis Page 1 Hypothesis Testing A statistial hypothesis is a statement about the nature of the distribution of a random

More information

Nonreversibility of Multiple Unicast Networks

Nonreversibility of Multiple Unicast Networks Nonreversibility of Multiple Uniast Networks Randall Dougherty and Kenneth Zeger September 27, 2005 Abstrat We prove that for any finite direted ayli network, there exists a orresponding multiple uniast

More information

Oligopolistic Markets with Sequential Search and Asymmetric Information

Oligopolistic Markets with Sequential Search and Asymmetric Information Oligopolisti Markets with Sequential Searh and Asymmetri Information Maarten Janssen Paul Pihler Simon Weidenholzer 11th February 2010 Abstrat A large variety of markets, suh as retail markets for gasoline

More information

max min z i i=1 x j k s.t. j=1 x j j:i T j

max min z i i=1 x j k s.t. j=1 x j j:i T j AM 221: Advaned Optimization Spring 2016 Prof. Yaron Singer Leture 22 April 18th 1 Overview In this leture, we will study the pipage rounding tehnique whih is a deterministi rounding proedure that an be

More information

Normative and descriptive approaches to multiattribute decision making

Normative and descriptive approaches to multiattribute decision making De. 009, Volume 8, No. (Serial No.78) China-USA Business Review, ISSN 57-54, USA Normative and desriptive approahes to multiattribute deision making Milan Terek (Department of Statistis, University of

More information

Peer Transparency in Teams: Does it Help or Hinder Incentives?

Peer Transparency in Teams: Does it Help or Hinder Incentives? Peer Transpareny in Teams: Does it Help or Hinder Inentives? Parimal Kanti Bag Nona Pepito June 19, 010 Abstrat In a joint projet involving two players who an ontribute in one or both rounds of a two-round

More information

Common Value Auctions with Costly Entry

Common Value Auctions with Costly Entry Common Value Autions with Costly Entry Pauli Murto Juuso Välimäki June, 205 preliminary and inomplete Abstrat We onsider a model where potential bidders onsider paying an entry ost to partiipate in an

More information

LECTURE NOTES FOR , FALL 2004

LECTURE NOTES FOR , FALL 2004 LECTURE NOTES FOR 18.155, FALL 2004 83 12. Cone support and wavefront set In disussing the singular support of a tempered distibution above, notie that singsupp(u) = only implies that u C (R n ), not as

More information

Market Segmentation for Privacy Differentiated Free Services

Market Segmentation for Privacy Differentiated Free Services 1 Market Segmentation for Privay Differentiated Free Servies Chong Huang, Lalitha Sankar arxiv:1611.538v [s.gt] 18 Nov 16 Abstrat The emerging marketplae for online free servies in whih servie providers

More information

Maximum Entropy and Exponential Families

Maximum Entropy and Exponential Families Maximum Entropy and Exponential Families April 9, 209 Abstrat The goal of this note is to derive the exponential form of probability distribution from more basi onsiderations, in partiular Entropy. It

More information

Relativistic Dynamics

Relativistic Dynamics Chapter 7 Relativisti Dynamis 7.1 General Priniples of Dynamis 7.2 Relativisti Ation As stated in Setion A.2, all of dynamis is derived from the priniple of least ation. Thus it is our hore to find a suitable

More information

A Characterization of Wavelet Convergence in Sobolev Spaces

A Characterization of Wavelet Convergence in Sobolev Spaces A Charaterization of Wavelet Convergene in Sobolev Spaes Mark A. Kon 1 oston University Louise Arakelian Raphael Howard University Dediated to Prof. Robert Carroll on the oasion of his 70th birthday. Abstrat

More information

The Hanging Chain. John McCuan. January 19, 2006

The Hanging Chain. John McCuan. January 19, 2006 The Hanging Chain John MCuan January 19, 2006 1 Introdution We onsider a hain of length L attahed to two points (a, u a and (b, u b in the plane. It is assumed that the hain hangs in the plane under a

More information

Designing Dynamic Contests

Designing Dynamic Contests Designing Dynami Contests Kostas Bimpikis Shayan Ehsani Mohamed Mostagir This version: Otober, 2014 Abstrat Innovation ontests have emerged as a viable alternative to the standard researh and development

More information

Millennium Relativity Acceleration Composition. The Relativistic Relationship between Acceleration and Uniform Motion

Millennium Relativity Acceleration Composition. The Relativistic Relationship between Acceleration and Uniform Motion Millennium Relativity Aeleration Composition he Relativisti Relationship between Aeleration and niform Motion Copyright 003 Joseph A. Rybzyk Abstrat he relativisti priniples developed throughout the six

More information

Physical Laws, Absolutes, Relative Absolutes and Relativistic Time Phenomena

Physical Laws, Absolutes, Relative Absolutes and Relativistic Time Phenomena Page 1 of 10 Physial Laws, Absolutes, Relative Absolutes and Relativisti Time Phenomena Antonio Ruggeri modexp@iafria.om Sine in the field of knowledge we deal with absolutes, there are absolute laws that

More information

Volunteering and the strategic value of ignorance

Volunteering and the strategic value of ignorance Volunteering and the strategi value of ignorane Florian Morath Max Plank Institute for Tax Law and Publi Finane November 10, 011 Abstrat Private provision of publi goods often takes plae as a war of attrition:

More information

Volume 29, Issue 3. On the definition of nonessentiality. Udo Ebert University of Oldenburg

Volume 29, Issue 3. On the definition of nonessentiality. Udo Ebert University of Oldenburg Volume 9, Issue 3 On the definition of nonessentiality Udo Ebert University of Oldenburg Abstrat Nonessentiality of a good is often used in welfare eonomis, ost-benefit analysis and applied work. Various

More information

Lecture 7: Sampling/Projections for Least-squares Approximation, Cont. 7 Sampling/Projections for Least-squares Approximation, Cont.

Lecture 7: Sampling/Projections for Least-squares Approximation, Cont. 7 Sampling/Projections for Least-squares Approximation, Cont. Stat60/CS94: Randomized Algorithms for Matries and Data Leture 7-09/5/013 Leture 7: Sampling/Projetions for Least-squares Approximation, Cont. Leturer: Mihael Mahoney Sribe: Mihael Mahoney Warning: these

More information

Chapter 8 Hypothesis Testing

Chapter 8 Hypothesis Testing Leture 5 for BST 63: Statistial Theory II Kui Zhang, Spring Chapter 8 Hypothesis Testing Setion 8 Introdution Definition 8 A hypothesis is a statement about a population parameter Definition 8 The two

More information

Oligopolistic Markets with Sequential Search and Production Cost Uncertainty

Oligopolistic Markets with Sequential Search and Production Cost Uncertainty Oligopolisti Markets with Sequential Searh and Prodution Cost Unertainty Maarten Janssen Paul Pihler Simon Weidenholzer February 14, 2011 Abstrat This artile analyzes a sequential searh model where firms

More information

General Equilibrium. What happens to cause a reaction to come to equilibrium?

General Equilibrium. What happens to cause a reaction to come to equilibrium? General Equilibrium Chemial Equilibrium Most hemial reations that are enountered are reversible. In other words, they go fairly easily in either the forward or reverse diretions. The thing to remember

More information

Assessing the Performance of a BCI: A Task-Oriented Approach

Assessing the Performance of a BCI: A Task-Oriented Approach Assessing the Performane of a BCI: A Task-Oriented Approah B. Dal Seno, L. Mainardi 2, M. Matteui Department of Eletronis and Information, IIT-Unit, Politenio di Milano, Italy 2 Department of Bioengineering,

More information

Where as discussed previously we interpret solutions to this partial differential equation in the weak sense: b

Where as discussed previously we interpret solutions to this partial differential equation in the weak sense: b Consider the pure initial value problem for a homogeneous system of onservation laws with no soure terms in one spae dimension: Where as disussed previously we interpret solutions to this partial differential

More information

Hankel Optimal Model Order Reduction 1

Hankel Optimal Model Order Reduction 1 Massahusetts Institute of Tehnology Department of Eletrial Engineering and Computer Siene 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Hankel Optimal Model Order Redution 1 This leture overs both

More information

Manipulative auction design

Manipulative auction design Theoretial Eonomis 6 (2011), 185 217 1555-7561/20110185 Manipulative aution design Philippe Jehiel Department of Eonomis, Paris Shool of Eonomis and Department of Eonomis, University College London This

More information

7 Max-Flow Problems. Business Computing and Operations Research 608

7 Max-Flow Problems. Business Computing and Operations Research 608 7 Max-Flow Problems Business Computing and Operations Researh 68 7. Max-Flow Problems In what follows, we onsider a somewhat modified problem onstellation Instead of osts of transmission, vetor now indiates

More information

Sensitivity Analysis in Markov Networks

Sensitivity Analysis in Markov Networks Sensitivity Analysis in Markov Networks Hei Chan and Adnan Darwihe Computer Siene Department University of California, Los Angeles Los Angeles, CA 90095 {hei,darwihe}@s.ula.edu Abstrat This paper explores

More information

Case I: 2 users In case of 2 users, the probability of error for user 1 was earlier derived to be 2 A1

Case I: 2 users In case of 2 users, the probability of error for user 1 was earlier derived to be 2 A1 MUTLIUSER DETECTION (Letures 9 and 0) 6:33:546 Wireless Communiations Tehnologies Instrutor: Dr. Narayan Mandayam Summary By Shweta Shrivastava (shwetash@winlab.rutgers.edu) bstrat This artile ontinues

More information

3 Tidal systems modelling: ASMITA model

3 Tidal systems modelling: ASMITA model 3 Tidal systems modelling: ASMITA model 3.1 Introdution For many pratial appliations, simulation and predition of oastal behaviour (morphologial development of shorefae, beahes and dunes) at a ertain level

More information

Remark 4.1 Unlike Lyapunov theorems, LaSalle s theorem does not require the function V ( x ) to be positive definite.

Remark 4.1 Unlike Lyapunov theorems, LaSalle s theorem does not require the function V ( x ) to be positive definite. Leture Remark 4.1 Unlike Lyapunov theorems, LaSalle s theorem does not require the funtion V ( x ) to be positive definite. ost often, our interest will be to show that x( t) as t. For that we will need

More information

An Integrated Architecture of Adaptive Neural Network Control for Dynamic Systems

An Integrated Architecture of Adaptive Neural Network Control for Dynamic Systems An Integrated Arhiteture of Adaptive Neural Network Control for Dynami Systems Robert L. Tokar 2 Brian D.MVey2 'Center for Nonlinear Studies, 2Applied Theoretial Physis Division Los Alamos National Laboratory,

More information

Kiel Institute for World Economics. On the Coexistence of National Companies and Multinational Enterprises

Kiel Institute for World Economics. On the Coexistence of National Companies and Multinational Enterprises Kiel Institute for World Eonomis D 2400 Kiel Kiel Working Paper o. 8 On the Coexistene of ational Companies and Multinational Enterprises by Jörn Kleinert September 2003 The responsibility for the ontents

More information

Robust Recovery of Signals From a Structured Union of Subspaces

Robust Recovery of Signals From a Structured Union of Subspaces Robust Reovery of Signals From a Strutured Union of Subspaes 1 Yonina C. Eldar, Senior Member, IEEE and Moshe Mishali, Student Member, IEEE arxiv:87.4581v2 [nlin.cg] 3 Mar 29 Abstrat Traditional sampling

More information

IMPEDANCE EFFECTS OF LEFT TURNERS FROM THE MAJOR STREET AT A TWSC INTERSECTION

IMPEDANCE EFFECTS OF LEFT TURNERS FROM THE MAJOR STREET AT A TWSC INTERSECTION 09-1289 Citation: Brilon, W. (2009): Impedane Effets of Left Turners from the Major Street at A TWSC Intersetion. Transportation Researh Reord Nr. 2130, pp. 2-8 IMPEDANCE EFFECTS OF LEFT TURNERS FROM THE

More information

KRANNERT GRADUATE SCHOOL OF MANAGEMENT

KRANNERT GRADUATE SCHOOL OF MANAGEMENT KRANNERT GRADUATE SCHOOL OF MANAGEMENT Purdue University West Lafayette, Indiana A Comment on David and Goliath: An Analysis on Asymmetri Mixed-Strategy Games and Experimental Evidene by Emmanuel Dehenaux

More information

Lightpath routing for maximum reliability in optical mesh networks

Lightpath routing for maximum reliability in optical mesh networks Vol. 7, No. 5 / May 2008 / JOURNAL OF OPTICAL NETWORKING 449 Lightpath routing for maximum reliability in optial mesh networks Shengli Yuan, 1, * Saket Varma, 2 and Jason P. Jue 2 1 Department of Computer

More information

Advanced Computational Fluid Dynamics AA215A Lecture 4

Advanced Computational Fluid Dynamics AA215A Lecture 4 Advaned Computational Fluid Dynamis AA5A Leture 4 Antony Jameson Winter Quarter,, Stanford, CA Abstrat Leture 4 overs analysis of the equations of gas dynamis Contents Analysis of the equations of gas

More information

Designing Social Norm Based Incentive Schemes to Sustain Cooperation in a Large Community

Designing Social Norm Based Incentive Schemes to Sustain Cooperation in a Large Community Designing Soial Norm Based Inentive Shemes to Sustain Cooperation in a arge Community Yu Zhang, Jaeo Par, Mihaela van der Shaar Eletrial Engineering Department, University of California, os Angeles yuzhang@ula.edu,

More information

Tight bounds for selfish and greedy load balancing

Tight bounds for selfish and greedy load balancing Tight bounds for selfish and greedy load balaning Ioannis Caragiannis Mihele Flammini Christos Kaklamanis Panagiotis Kanellopoulos Lua Mosardelli Deember, 009 Abstrat We study the load balaning problem

More information

CMSC 451: Lecture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017

CMSC 451: Lecture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017 CMSC 451: Leture 9 Greedy Approximation: Set Cover Thursday, Sep 28, 2017 Reading: Chapt 11 of KT and Set 54 of DPV Set Cover: An important lass of optimization problems involves overing a ertain domain,

More information

Complete Shrimp Game Solution

Complete Shrimp Game Solution Complete Shrimp Game Solution Florian Ederer Feruary 7, 207 The inverse demand urve is given y P (Q a ; Q ; Q ) = 00 0:5 (Q a + Q + Q ) The pro t funtion for rm i = fa; ; g is i (Q a ; Q ; Q ) = Q i [P

More information

Asymmetric information allocation to avoid coordination failure"

Asymmetric information allocation to avoid coordination failure TSE 941 July 2018 Asymmetri information alloation to avoid oordination failure" Fumitoshi Moriya and Takuro Yamashita Asymmetri information alloation to avoid oordination failure Fumitoshi Moriya Takuro

More information

The Effectiveness of the Linear Hull Effect

The Effectiveness of the Linear Hull Effect The Effetiveness of the Linear Hull Effet S. Murphy Tehnial Report RHUL MA 009 9 6 Otober 009 Department of Mathematis Royal Holloway, University of London Egham, Surrey TW0 0EX, England http://www.rhul.a.uk/mathematis/tehreports

More information

Generalized Dimensional Analysis

Generalized Dimensional Analysis #HUTP-92/A036 7/92 Generalized Dimensional Analysis arxiv:hep-ph/9207278v1 31 Jul 1992 Howard Georgi Lyman Laboratory of Physis Harvard University Cambridge, MA 02138 Abstrat I desribe a version of so-alled

More information

6 Dynamic Optimization in Continuous Time

6 Dynamic Optimization in Continuous Time 6 Dynami Optimization in Continuous Time 6.1 Dynami programming in ontinuous time Consider the problem Z T max e rt u (k,, t) dt (1) (t) T s.t. k ú = f (k,, t) (2) k () = k, (3) with k (T )= k (ase 1),

More information

kids (this case is for j = 1; j = 2 case is similar). For the interior solution case, we have 1 = c (x 2 t) + p 2

kids (this case is for j = 1; j = 2 case is similar). For the interior solution case, we have 1 = c (x 2 t) + p 2 Problem 1 There are two subgames, or stages. At stage 1, eah ie ream parlor i (I all it firm i from now on) selets loation x i simultaneously. At stage 2, eah firm i hooses pries p i. To find SPE, we start

More information

Evaluation of effect of blade internal modes on sensitivity of Advanced LIGO

Evaluation of effect of blade internal modes on sensitivity of Advanced LIGO Evaluation of effet of blade internal modes on sensitivity of Advaned LIGO T0074-00-R Norna A Robertson 5 th Otober 00. Introdution The urrent model used to estimate the isolation ahieved by the quadruple

More information

OPTIMAL CERTIFICATION POLICY, ENTRY, AND INVESTMENT IN THE PRESENCE OF PUBLIC SIGNALS

OPTIMAL CERTIFICATION POLICY, ENTRY, AND INVESTMENT IN THE PRESENCE OF PUBLIC SIGNALS OPTIMAL CERTIFICATION POLICY, ENTRY, AND INVESTMENT IN THE PRESENCE OF PUBLIC SIGNALS JAY PIL CHOI AND ARIJIT MUKHERJEE A. We explore the optimal dislosure poliy of a ertifiation intermediary in an environment

More information

Public School Choice: An Economic Analysis

Public School Choice: An Economic Analysis Publi Shool Choie: An Eonomi Analysis Levon Barseghyan, Damon Clark and Stephen Coate May 25, 2018 Abstrat Publi shool hoie programs give households a hoie of publi shool and enourage shools to ompete

More information

A Spatiotemporal Approach to Passive Sound Source Localization

A Spatiotemporal Approach to Passive Sound Source Localization A Spatiotemporal Approah Passive Sound Soure Loalization Pasi Pertilä, Mikko Parviainen, Teemu Korhonen and Ari Visa Institute of Signal Proessing Tampere University of Tehnology, P.O.Box 553, FIN-330,

More information

Capacity Pooling and Cost Sharing among Independent Firms in the Presence of Congestion

Capacity Pooling and Cost Sharing among Independent Firms in the Presence of Congestion Capaity Pooling and Cost Sharing among Independent Firms in the Presene of Congestion Yimin Yu Saif Benjaafar Graduate Program in Industrial and Systems Engineering Department of Mehanial Engineering University

More information

22.54 Neutron Interactions and Applications (Spring 2004) Chapter 6 (2/24/04) Energy Transfer Kernel F(E E')

22.54 Neutron Interactions and Applications (Spring 2004) Chapter 6 (2/24/04) Energy Transfer Kernel F(E E') 22.54 Neutron Interations and Appliations (Spring 2004) Chapter 6 (2/24/04) Energy Transfer Kernel F(E E') Referenes -- J. R. Lamarsh, Introdution to Nulear Reator Theory (Addison-Wesley, Reading, 1966),

More information

arxiv: v2 [math.pr] 9 Dec 2016

arxiv: v2 [math.pr] 9 Dec 2016 Omnithermal Perfet Simulation for Multi-server Queues Stephen B. Connor 3th Deember 206 arxiv:60.0602v2 [math.pr] 9 De 206 Abstrat A number of perfet simulation algorithms for multi-server First Come First

More information

Indian Institute of Technology Bombay. Department of Electrical Engineering. EE 325 Probability and Random Processes Lecture Notes 3 July 28, 2014

Indian Institute of Technology Bombay. Department of Electrical Engineering. EE 325 Probability and Random Processes Lecture Notes 3 July 28, 2014 Indian Institute of Tehnology Bombay Department of Eletrial Engineering Handout 5 EE 325 Probability and Random Proesses Leture Notes 3 July 28, 2014 1 Axiomati Probability We have learned some paradoxes

More information

Solutions to Problem Set 1

Solutions to Problem Set 1 Eon602: Maro Theory Eonomis, HKU Instrutor: Dr. Yulei Luo September 208 Solutions to Problem Set. [0 points] Consider the following lifetime optimal onsumption-saving problem: v (a 0 ) max f;a t+ g t t

More information

Wavetech, LLC. Ultrafast Pulses and GVD. John O Hara Created: Dec. 6, 2013

Wavetech, LLC. Ultrafast Pulses and GVD. John O Hara Created: Dec. 6, 2013 Ultrafast Pulses and GVD John O Hara Created: De. 6, 3 Introdution This doument overs the basi onepts of group veloity dispersion (GVD) and ultrafast pulse propagation in an optial fiber. Neessarily, it

More information

Developing Excel Macros for Solving Heat Diffusion Problems

Developing Excel Macros for Solving Heat Diffusion Problems Session 50 Developing Exel Maros for Solving Heat Diffusion Problems N. N. Sarker and M. A. Ketkar Department of Engineering Tehnology Prairie View A&M University Prairie View, TX 77446 Abstrat This paper

More information

Most results in this section are stated without proof.

Most results in this section are stated without proof. Leture 8 Level 4 v2 he Expliit formula. Most results in this setion are stated without proof. Reall that we have shown that ζ (s has only one pole, a simple one at s =. It has trivial zeros at the negative

More information

Optimization of Statistical Decisions for Age Replacement Problems via a New Pivotal Quantity Averaging Approach

Optimization of Statistical Decisions for Age Replacement Problems via a New Pivotal Quantity Averaging Approach Amerian Journal of heoretial and Applied tatistis 6; 5(-): -8 Published online January 7, 6 (http://www.sienepublishinggroup.om/j/ajtas) doi:.648/j.ajtas.s.65.4 IN: 36-8999 (Print); IN: 36-96 (Online)

More information

Lecture 3 - Lorentz Transformations

Lecture 3 - Lorentz Transformations Leture - Lorentz Transformations A Puzzle... Example A ruler is positioned perpendiular to a wall. A stik of length L flies by at speed v. It travels in front of the ruler, so that it obsures part of the

More information

18.05 Problem Set 6, Spring 2014 Solutions

18.05 Problem Set 6, Spring 2014 Solutions 8.5 Problem Set 6, Spring 4 Solutions Problem. pts.) a) Throughout this problem we will let x be the data of 4 heads out of 5 tosses. We have 4/5 =.56. Computing the likelihoods: 5 5 px H )=.5) 5 px H

More information

Danielle Maddix AA238 Final Project December 9, 2016

Danielle Maddix AA238 Final Project December 9, 2016 Struture and Parameter Learning in Bayesian Networks with Appliations to Prediting Breast Caner Tumor Malignany in a Lower Dimension Feature Spae Danielle Maddix AA238 Final Projet Deember 9, 2016 Abstrat

More information

2008/5. Efficiency gains and mergers. Giuseppe De Feo

2008/5. Efficiency gains and mergers. Giuseppe De Feo 2008/5 Effiieny gains and mergers Giuseppe De Feo CORE DISCUSSION PAPER 2008/5 Effiieny gains and mergers Giuseppe DE FEO 1 January 2008 Abstrat In the theoretial literature, strong arguments have been

More information

Likelihood-confidence intervals for quantiles in Extreme Value Distributions

Likelihood-confidence intervals for quantiles in Extreme Value Distributions Likelihood-onfidene intervals for quantiles in Extreme Value Distributions A. Bolívar, E. Díaz-Franés, J. Ortega, and E. Vilhis. Centro de Investigaión en Matemátias; A.P. 42, Guanajuato, Gto. 36; Méxio

More information

Math 151 Introduction to Eigenvectors

Math 151 Introduction to Eigenvectors Math 151 Introdution to Eigenvetors The motivating example we used to desrie matrixes was landsape hange and vegetation suession. We hose the simple example of Bare Soil (B), eing replaed y Grasses (G)

More information

Simplified Buckling Analysis of Skeletal Structures

Simplified Buckling Analysis of Skeletal Structures Simplified Bukling Analysis of Skeletal Strutures B.A. Izzuddin 1 ABSRAC A simplified approah is proposed for bukling analysis of skeletal strutures, whih employs a rotational spring analogy for the formulation

More information

Determination of the reaction order

Determination of the reaction order 5/7/07 A quote of the wee (or amel of the wee): Apply yourself. Get all the eduation you an, but then... do something. Don't just stand there, mae it happen. Lee Iaoa Physial Chemistry GTM/5 reation order

More information

Controller Design Based on Transient Response Criteria. Chapter 12 1

Controller Design Based on Transient Response Criteria. Chapter 12 1 Controller Design Based on Transient Response Criteria Chapter 12 1 Desirable Controller Features 0. Stable 1. Quik responding 2. Adequate disturbane rejetion 3. Insensitive to model, measurement errors

More information

MOLECULAR ORBITAL THEORY- PART I

MOLECULAR ORBITAL THEORY- PART I 5.6 Physial Chemistry Leture #24-25 MOLECULAR ORBITAL THEORY- PART I At this point, we have nearly ompleted our rash-ourse introdution to quantum mehanis and we re finally ready to deal with moleules.

More information

Sensor management for PRF selection in the track-before-detect context

Sensor management for PRF selection in the track-before-detect context Sensor management for PRF seletion in the tra-before-detet ontext Fotios Katsilieris, Yvo Boers, and Hans Driessen Thales Nederland B.V. Haasbergerstraat 49, 7554 PA Hengelo, the Netherlands Email: {Fotios.Katsilieris,

More information

Production and Abatement Distortions under Noisy Green Taxes

Production and Abatement Distortions under Noisy Green Taxes Prodution and Abatement Distortions under Noisy Green Taxes ongli Feng and David A. ennessy Working Paper 05-WP 409 Otober 005 Center for Agriultural and Rural Development Iowa State University Ames, Iowa

More information

Appendix A Market-Power Model of Business Groups. Robert C. Feenstra Deng-Shing Huang Gary G. Hamilton Revised, November 2001

Appendix A Market-Power Model of Business Groups. Robert C. Feenstra Deng-Shing Huang Gary G. Hamilton Revised, November 2001 Appendix A Market-Power Model of Business Groups Roert C. Feenstra Deng-Shing Huang Gary G. Hamilton Revised, Novemer 200 Journal of Eonomi Behavior and Organization, 5, 2003, 459-485. To solve for the

More information

Bäcklund Transformations: Some Old and New Perspectives

Bäcklund Transformations: Some Old and New Perspectives Bäklund Transformations: Some Old and New Perspetives C. J. Papahristou *, A. N. Magoulas ** * Department of Physial Sienes, Helleni Naval Aademy, Piraeus 18539, Greee E-mail: papahristou@snd.edu.gr **

More information

Packing Plane Spanning Trees into a Point Set

Packing Plane Spanning Trees into a Point Set Paking Plane Spanning Trees into a Point Set Ahmad Biniaz Alfredo Garía Abstrat Let P be a set of n points in the plane in general position. We show that at least n/3 plane spanning trees an be paked into

More information

Counting Idempotent Relations

Counting Idempotent Relations Counting Idempotent Relations Beriht-Nr. 2008-15 Florian Kammüller ISSN 1436-9915 2 Abstrat This artile introdues and motivates idempotent relations. It summarizes haraterizations of idempotents and their

More information

On Component Order Edge Reliability and the Existence of Uniformly Most Reliable Unicycles

On Component Order Edge Reliability and the Existence of Uniformly Most Reliable Unicycles Daniel Gross, Lakshmi Iswara, L. William Kazmierzak, Kristi Luttrell, John T. Saoman, Charles Suffel On Component Order Edge Reliability and the Existene of Uniformly Most Reliable Uniyles DANIEL GROSS

More information

arxiv:physics/ v1 [physics.class-ph] 8 Aug 2003

arxiv:physics/ v1 [physics.class-ph] 8 Aug 2003 arxiv:physis/0308036v1 [physis.lass-ph] 8 Aug 003 On the meaning of Lorentz ovariane Lszl E. Szab Theoretial Physis Researh Group of the Hungarian Aademy of Sienes Department of History and Philosophy

More information

23.1 Tuning controllers, in the large view Quoting from Section 16.7:

23.1 Tuning controllers, in the large view Quoting from Section 16.7: Lesson 23. Tuning a real ontroller - modeling, proess identifiation, fine tuning 23.0 Context We have learned to view proesses as dynami systems, taking are to identify their input, intermediate, and output

More information

Fig Review of Granta-gravel

Fig Review of Granta-gravel 0 Conlusion 0. Sope We have introdued the new ritial state onept among older onepts of lassial soil mehanis, but it would be wrong to leave any impression at the end of this book that the new onept merely

More information

The Dynamics of Bidding Markets with Financial Constraints

The Dynamics of Bidding Markets with Financial Constraints The Dynamis of Bidding Markets with Finanial Constraints Pablo F. Beker University of Warwik Ángel Hernando-Veiana Universidad Carlos III de Madrid July 1, 2014 Abstrat We develop a model of bidding markets

More information

Irreversibility and restoration in natural resource development

Irreversibility and restoration in natural resource development # Oxford University Press 1999 Oxford Eonomi Papers 51 (1999), 559±573 559 Irreversibility and restoration in natural resoure development By Jinhua Zhao* and David Zilberman{ * Department of Eonomis, Heady

More information

Hong Chen. and. Murray Frank 1. and. Hong Kong University of Science and Technology. March 30, Abstract

Hong Chen. and. Murray Frank 1. and. Hong Kong University of Science and Technology. March 30, Abstract Monopoly Priing When Customers Queue Hong Chen Faulty of Commere and Business Administration University of British Columbia, Vanouver, B.C. Canada and Murray Frank Faulty of Commere and Business Administration

More information

10.5 Unsupervised Bayesian Learning

10.5 Unsupervised Bayesian Learning The Bayes Classifier Maximum-likelihood methods: Li Yu Hongda Mao Joan Wang parameter vetor is a fixed but unknown value Bayes methods: parameter vetor is a random variable with known prior distribution

More information

Subject: Introduction to Component Matching and Off-Design Operation % % ( (1) R T % (

Subject: Introduction to Component Matching and Off-Design Operation % % ( (1) R T % ( 16.50 Leture 0 Subjet: Introdution to Component Mathing and Off-Design Operation At this point it is well to reflet on whih of the many parameters we have introdued (like M, τ, τ t, ϑ t, f, et.) are free

More information

A NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM

A NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM NETWORK SIMPLEX LGORITHM FOR THE MINIMUM COST-BENEFIT NETWORK FLOW PROBLEM Cen Çalışan, Utah Valley University, 800 W. University Parway, Orem, UT 84058, 801-863-6487, en.alisan@uvu.edu BSTRCT The minimum

More information

Reliability Guaranteed Energy-Aware Frame-Based Task Set Execution Strategy for Hard Real-Time Systems

Reliability Guaranteed Energy-Aware Frame-Based Task Set Execution Strategy for Hard Real-Time Systems Reliability Guaranteed Energy-Aware Frame-Based ask Set Exeution Strategy for Hard Real-ime Systems Zheng Li a, Li Wang a, Shuhui Li a, Shangping Ren a, Gang Quan b a Illinois Institute of ehnology, Chiago,

More information

Convergence of reinforcement learning with general function approximators

Convergence of reinforcement learning with general function approximators Convergene of reinforement learning with general funtion approximators assilis A. Papavassiliou and Stuart Russell Computer Siene Division, U. of California, Berkeley, CA 94720-1776 fvassilis,russellg@s.berkeley.edu

More information