Network Upgrade Game. Qiuhui Li, Qiao Zhao
|
|
- Lauren Rogers
- 5 years ago
- Views:
Transcription
1 Network Upgrade Game Qiuhui Li, Qiao Zhao
2 Outline Two ISPs N-ISPs Declining Upgrade Cost Model
3 Motivation
4 Network ater one upgrade
5 Network ater both upgrade
6 Contribution Formulate this upgrade decision process as a repeated game. Obtain several sub-game perect equilibria(spe) under dierent conditions. Analyze the eect o declining upgrading cost in a continuous model.
7 Two ISPs model In every time period, an ISP makes a decision according to its strategy. δ Discount actor is. Game model or single period: Upgrade Not Upgrade Upgrade R,R a, Not Upgrade,a 0,0
8 SPE and Conditions Upgrade Immediately: Both ISP choose to upgrade in the current period. This is SPE i U Delayed Upgrade: I another ISP upgrade beore period n, it upgrade in the next period. Else it waits until the period n to upgrade. This is SPE i Never Upgrade: Using this strategy, the ISPs will never upgrade. It is SPE i: R 1 δ n a ( δ δ ) R R U n n 1 δ + (1 δ )(1 δ ) U a R > and U >
9 SPE and Conditions cont. No First Upgrade: Both do not upgrade until the other upgrades in the previous period. It s SPE i: R R a + δ U Asymmetric Free-ride: One upgrades immediately and the other never upgrade. This is SPE i R a U
10 SPE and Conditions cont. Mixed Free-ride: I no one has upgraded, both upgrade with probability α. I one has upgraded, the other remains not-upgraded. It s SPE i: R a U Mixed Upgrade: I no one has upgraded, both upgrade with probability α. I one has upgraded, the other also upgrades. It s SPE i: R a δ U R +
11 Proo Upgrade Immediately: Both ISP choose to upgrade in the current period. This is SPE i U R 1 Proo: Let ISP B upgrade immediately. δ Action o A Upgrade at 0 Never upgrade Upgrade at n Payo o A R U + 1 δ In between
12 Proo Delayed Upgrade: I another ISP upgrade beore period n, it upgrade in the next period. Else it waits until the period n to upgrade. This is SPE i n a ( δ δ ) R R U n n 1 δ + (1 δ )(1 δ ) Proo: Let ISP B use delayed upgrade: Action o A Upgrade at 0 Never upgrade Upgrade at n Beore or ater n Payo o A δ R a U + 1 δ δ n n R δ U Less or in between
13 Proo Mixed Free-ride: I no one has upgraded, both upgrade with probability. I one has upgraded, the other remains not-upgraded. It s SPE i: Proo: Let ISP B use Mixed Free-ride. When no one has upgraded, the expected payo o A or upgrading is J R a U R a J0 ( α) = α (1 α) U + The expected payo o A or not upgrading is J J1( α) = α (1 α) δj1( α) + a R (0) J (0) = U 0 J0(1) J1( 1) = U There exist 0< α < 1such that J0( α) = J1( α) and A is indierent between two choices. α
14 Outline Two ISPs N-ISPs Declining Upgrade Cost Model
15 N-ISPs Deine ( j) : ree-rider beneit i j ISPs upgraded (0) = 0 a( j: ) early-adopter beneit i j ISPs upgraded an ( ) = R Unique SPE: every ISP upgrading in the irst period, i: R ( N 1) U 1 δ R i stick to upgrade: U i never upgrade: 1 δ ( N 1) 1 δ >
16 Upgrade Immediately (Strict Dominance) Claim: upgrade is a better decision in any situation, i prove by induction Initial: suppose all but 2 ISPs have upgraded, say A & B. Upgrade Incentive: Dominant: U < min j= 0,..., N 1 a( j+ 1) ( j) A B upgrade reeride upgrade an ( ) an ( 1) U U reeride ( N 1) ( N 2) an ( ) ( 1) ( 1) ( 2) U N, an U N an ( ) ( N 1) an ( 1) ( N 2) U < min(, )
17 Upgrade Immediately (Strict Dominance) Assume all but (i) ISPs upgrade, and the claim is correct. Now, suppose all but (i+1) ISPs upgrade, i k {0,..., i} upgrade in current period, R an ( i+ k) + δ U, A upgrades now R R ( N i + k 1) + δ δu, A waits δ is a upbound Upgrade Incentive: U < So, induction argument shows Every One Upgrade is a SPE i: U < min j= 0,..., N 1 aj ( + 1) ( j) an ( i+ k) ( N i+ k 1), k 0,..., i upgrade is better than ree-rider!
18 Outline Two ISPs N-ISPs Declining Upgrade Cost Model
19 Declining Upgrade Cost Model Continuous Time Model, 2 ISPs here. A B upgrade ree ride Revenues discount actor: t e δ upgrade R, R a, ree ride, a 0, 0 i both/one upgrade at time 0, the total revenue, is: + t R + t a + δ δ t e R, e a, e δ = 0 δ = 0 δ = 0 δ Cost decline at actor: e γ t Includes: declining upgrade costs and discounting actor, The upgrade cost at time t is: e γ t ' U γ > δ
20 Two Critical Time t : the time upgrade is a better decision than ree-ride, t a δt ( R ) γt 1 γu t = arg max e Ue + = log t δ γ δ R : the time the irst to upgrade is a better decision t U = δ = γ δ a δt a γt 1 γ a arg max e Ue log + t Claim: both ISPs have upgraded ater time t, proo as ollows.
21 Theorem Theorem 3: t t a Suppose t t, the only SPE is two ISPs both upgrade at Proo: a R a Step 1: A upgrade at time beore t, B will upgrade at time t t δt R δt δt γt δt R γt arg max e ( e e ) Ue argmax e Ue t t t' + δ δ = = t t' δ Step 2: A upgrade ater time t, B ollows immediately t R t t t t R t arg max e δ ( e δ e δ ) Ue γ arg max e δ Ue γ t' t t' + δ δ = t t' δ = t
22 Theorem 3 (cont.) Step 3: i A consider upgrade beore time, derive his payo as he can induce B s behavior: δt R δt δt a γt δta γt arg max e ( e e ) Ue arg max e Ue min ( t, ) a t t tt + = tt δ δ δ = = t i A consider upgrade ater time, maximize his payo as he can induce B s behavior: t arg max e tt R t 1 U Ue min t, log( ) t δ = γ δ R = γ δ t γ So, upgrade at time is always a best decision when t t t a
23 Theorem Theorem 4: Suppose t < a one ISPs upgrade at, the only SPE is: the other one upgrade at Similar proo with Theorem 3. t t a t Intuition: compete or the time t a, i ail wait to upgrade until time t
24 Time to Upgrade t t Time to upgrade t technique improvemen t speed up the upgrade process technique improvement delay the upgrade time
25 Summary Discrete Time Model: Obtain several sub-game perect equilibrium(spe) under dierent conditions. Discuss the ree riding eect to the upgrading decisions Continuous Time Model: Cost declining model, discuss the eect o technique improvement to the upgrade decision. Technique improvement may delay the upgrading time
26 Thank you! Questions?
Documents de Travail du Centre d Economie de la Sorbonne
Documents de Travail du Centre d Economie de la Sorbonne On equilibrium payos in wage bargaining with discount rates varying in time Ahmet OZKARDAS, Agnieszka RUSINOWSKA 2014.11 Maison des Sciences Économiques,
More informationWeb Appendix for The Value of Switching Costs
Web Appendix or The Value o Switching Costs Gary Biglaiser University o North Carolina, Chapel Hill Jacques Crémer Toulouse School o Economics (GREMAQ, CNRS and IDEI) Gergely Dobos Gazdasági Versenyhivatal
More informationOnline Appendix: The Continuous-type Model of Competitive Nonlinear Taxation and Constitutional Choice by Massimo Morelli, Huanxing Yang, and Lixin Ye
Online Appendix: The Continuous-type Model o Competitive Nonlinear Taxation and Constitutional Choice by Massimo Morelli, Huanxing Yang, and Lixin Ye For robustness check, in this section we extend our
More information( x) f = where P and Q are polynomials.
9.8 Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm ( ) ( ) ( ) P where P and Q are polynomials. Q An eample o a simple rational
More informationFigure 1: Bayesian network for problem 1. P (A = t) = 0.3 (1) P (C = t) = 0.6 (2) Table 1: CPTs for problem 1. (c) P (E B) C P (D = t) f 0.9 t 0.
Probabilistic Artiicial Intelligence Problem Set 3 Oct 27, 2017 1. Variable elimination In this exercise you will use variable elimination to perorm inerence on a bayesian network. Consider the network
More informationECO421: Reputation. Marcin P ski. March 29, 2018
ECO421: Reputation Marcin P ski March 29, 2018 Plan Chain store game Model of reputation Reputations in innite games Applications Model No pure strategy equilibria Mixed strategy equilibrium Basic model
More informationRATIONAL FUNCTIONS. Finding Asymptotes..347 The Domain Finding Intercepts Graphing Rational Functions
RATIONAL FUNCTIONS Finding Asymptotes..347 The Domain....350 Finding Intercepts.....35 Graphing Rational Functions... 35 345 Objectives The ollowing is a list o objectives or this section o the workbook.
More informationSEPARATED AND PROPER MORPHISMS
SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN Last quarter, we introduced the closed diagonal condition or a prevariety to be a prevariety, and the universally closed condition or a variety to be complete.
More informationPrice Competition and Endogenous Valuation in Search Advertising
Price Competition and Endogenous Valuation in Search Advertising Lizhen Xu Jianqing Chen Andrew Whinston Web Appendix A Heterogeneous Consumer Valuation In the baseline model, we assumed that consumers
More informationUniversity of Warwick, Department of Economics Spring Final Exam. Answer TWO questions. All questions carry equal weight. Time allowed 2 hours.
University of Warwick, Department of Economics Spring 2012 EC941: Game Theory Prof. Francesco Squintani Final Exam Answer TWO questions. All questions carry equal weight. Time allowed 2 hours. 1. Consider
More informationSEPARATED AND PROPER MORPHISMS
SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN The notions o separatedness and properness are the algebraic geometry analogues o the Hausdor condition and compactness in topology. For varieties over the
More information9.1 The Square Root Function
Section 9.1 The Square Root Function 869 9.1 The Square Root Function In this section we turn our attention to the square root unction, the unction deined b the equation () =. (1) We begin the section
More information9.3 Graphing Functions by Plotting Points, The Domain and Range of Functions
9. Graphing Functions by Plotting Points, The Domain and Range o Functions Now that we have a basic idea o what unctions are and how to deal with them, we would like to start talking about the graph o
More informationMath 248B. Base change morphisms
Math 248B. Base change morphisms 1. Motivation A basic operation with shea cohomology is pullback. For a continuous map o topological spaces : X X and an abelian shea F on X with (topological) pullback
More informationChapter 6 Reliability-based design and code developments
Chapter 6 Reliability-based design and code developments 6. General Reliability technology has become a powerul tool or the design engineer and is widely employed in practice. Structural reliability analysis
More informationMaximum Flow. Reading: CLRS Chapter 26. CSE 6331 Algorithms Steve Lai
Maximum Flow Reading: CLRS Chapter 26. CSE 6331 Algorithms Steve Lai Flow Network A low network G ( V, E) is a directed graph with a source node sv, a sink node tv, a capacity unction c. Each edge ( u,
More informationOnline Appendixes for \A Theory of Military Dictatorships"
May 2009 Online Appendixes for \A Theory of Military Dictatorships" By Daron Acemoglu, Davide Ticchi and Andrea Vindigni Appendix B: Key Notation for Section I 2 (0; 1): discount factor. j;t 2 f0; 1g:
More information2. ETA EVALUATIONS USING WEBER FUNCTIONS. Introduction
. ETA EVALUATIONS USING WEBER FUNCTIONS Introduction So ar we have seen some o the methods or providing eta evaluations that appear in the literature and we have seen some o the interesting properties
More information«Develop a better understanding on Partial fractions»
«Develop a better understanding on Partial ractions» ackground inormation: The topic on Partial ractions or decomposing actions is irst introduced in O level dditional Mathematics with its applications
More informationVALUATIVE CRITERIA FOR SEPARATED AND PROPER MORPHISMS
VALUATIVE CRITERIA FOR SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN Recall that or prevarieties, we had criteria or being a variety or or being complete in terms o existence and uniqueness o limits, where
More informationRoberto s Notes on Differential Calculus Chapter 8: Graphical analysis Section 1. Extreme points
Roberto s Notes on Dierential Calculus Chapter 8: Graphical analysis Section 1 Extreme points What you need to know already: How to solve basic algebraic and trigonometric equations. All basic techniques
More informationLecture Notes on Bargaining
Lecture Notes on Bargaining Levent Koçkesen 1 Axiomatic Bargaining and Nash Solution 1.1 Preliminaries The axiomatic theory of bargaining originated in a fundamental paper by Nash (1950, Econometrica).
More informationObjectives. By the time the student is finished with this section of the workbook, he/she should be able
FUNCTIONS Quadratic Functions......8 Absolute Value Functions.....48 Translations o Functions..57 Radical Functions...61 Eponential Functions...7 Logarithmic Functions......8 Cubic Functions......91 Piece-Wise
More informationRESOLUTION MSC.362(92) (Adopted on 14 June 2013) REVISED RECOMMENDATION ON A STANDARD METHOD FOR EVALUATING CROSS-FLOODING ARRANGEMENTS
(Adopted on 4 June 203) (Adopted on 4 June 203) ANNEX 8 (Adopted on 4 June 203) MSC 92/26/Add. Annex 8, page THE MARITIME SAFETY COMMITTEE, RECALLING Article 28(b) o the Convention on the International
More informationSupplementary material for Continuous-action planning for discounted infinite-horizon nonlinear optimal control with Lipschitz values
Supplementary material or Continuous-action planning or discounted ininite-horizon nonlinear optimal control with Lipschitz values List o main notations x, X, u, U state, state space, action, action space,
More informationSupplement for In Search of the Holy Grail: Policy Convergence, Experimentation and Economic Performance Sharun W. Mukand and Dani Rodrik
Supplement or In Search o the Holy Grail: Policy Convergence, Experimentation and Economic Perormance Sharun W. Mukand and Dani Rodrik In what ollows we sketch out the proos or the lemma and propositions
More informationLocal University Supply and Distance: A Welfare Analysis with Centralized and Decentralized Tuition Fees
Ital Econ J (216) 2:239 252 DOI 1.17/s4797-16-33-z RESERCH PPER Local University Supply and Distance: Welare nalysis with Centralized and Decentralized Tuition Fees Elias Carroni 1 Berardino Cesi 2 Dimitri
More informationIntroduction to Algorithms
Introduction to Algorithms, Lecture 5 // Introduction to Algorithms 6.46J/.4J LECTURE Shortest Paths I Properties o shortest paths Dijkstra s Correctness Analysis Breadth-irst Pro. Manolis Kellis March,
More informationVALUATIVE CRITERIA BRIAN OSSERMAN
VALUATIVE CRITERIA BRIAN OSSERMAN Intuitively, one can think o separatedness as (a relative version o) uniqueness o limits, and properness as (a relative version o) existence o (unique) limits. It is not
More informationTHE use of radio frequency channels assigned to primary. Traffic-Aware Channel Sensing Order in Dynamic Spectrum Access Networks
EEE JOURNAL ON SELECTED AREAS N COMMUNCATONS, VOL. X, NO. X, X 01X 1 Traic-Aware Channel Sensing Order in Dynamic Spectrum Access Networks Chun-Hao Liu, Jason A. Tran, Student Member, EEE, Przemysław Pawełczak,
More informationOn a Closed Formula for the Derivatives of e f(x) and Related Financial Applications
International Mathematical Forum, 4, 9, no. 9, 41-47 On a Closed Formula or the Derivatives o e x) and Related Financial Applications Konstantinos Draais 1 UCD CASL, University College Dublin, Ireland
More information(Deep) Reinforcement Learning
Martin Matyášek Artificial Intelligence Center Czech Technical University in Prague October 27, 2016 Martin Matyášek VPD, 2016 1 / 17 Reinforcement Learning in a picture R. S. Sutton and A. G. Barto 2015
More informationFinger Search in the Implicit Model
Finger Search in the Implicit Model Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen MADALGO, Department o Computer Science, Aarhus University, Denmark. {gerth,jasn,jakobt}@madalgo.au.dk Abstract.
More informationPublished in the American Economic Review Volume 102, Issue 1, February 2012, pages doi: /aer
Published in the American Economic Review Volume 102, Issue 1, February 2012, pages 594-601. doi:10.1257/aer.102.1.594 CONTRACTS VS. SALARIES IN MATCHING FEDERICO ECHENIQUE Abstract. Firms and workers
More informationSTAT 801: Mathematical Statistics. Hypothesis Testing
STAT 801: Mathematical Statistics Hypothesis Testing Hypothesis testing: a statistical problem where you must choose, on the basis o data X, between two alternatives. We ormalize this as the problem o
More informationEpsilon Approximate Equilibria with Multiple Payos and No Priors
Epsilon Approximate Equilibria with Multiple Payos and No Priors Anshul Sawant 1, John Dickerson 2, Mohammad T. Hajiaghayi 1, V. S. Subrahmanian 1 1 UMIACS University of Maryland College Park, MD 20740
More informationCircuit Complexity / Counting Problems
Lecture 5 Circuit Complexity / Counting Problems April 2, 24 Lecturer: Paul eame Notes: William Pentney 5. Circuit Complexity and Uniorm Complexity We will conclude our look at the basic relationship between
More informationSupplementary Material for \Collusion with Persistent Cost Shocks"
Supplementary Material for \Collusion with Persistent Cost Shocks" Susan Athey and Kyle Bagwell July 3, 2006 Abstract This document has three parts. The rst part analyzes generalizations of our model to
More informationThe Interdisciplinary Center, Herzliya School of Economics Advanced Microeconomics Fall Bargaining The Axiomatic Approach
The Interdisciplinary Center, Herzliya School of Economics Advanced Microeconomics Fall 2011 Bargaining The Axiomatic Approach Bargaining problem Nash s (1950) work is the starting point for formal bargaining
More informationCHOW S LEMMA. Matthew Emerton
CHOW LEMMA Matthew Emerton The aim o this note is to prove the ollowing orm o Chow s Lemma: uppose that : is a separated inite type morphism o Noetherian schemes. Then (or some suiciently large n) there
More informationVickrey-Clarke-Groves Mechanisms
Vickrey-Clarke-Groves Mechanisms Jonathan Levin 1 Economics 285 Market Design Winter 2009 1 These slides are based on Paul Milgrom s. onathan Levin VCG Mechanisms Winter 2009 1 / 23 Motivation We consider
More informationReinforcement Learning. Introduction
Reinforcement Learning Introduction Reinforcement Learning Agent interacts and learns from a stochastic environment Science of sequential decision making Many faces of reinforcement learning Optimal control
More informationTheoretical Appendix:
: Yuri M Zhuov Department of Political Science, University of Michigan June 4, 2016 This supplemental material formalizes the theoretical narrative described qualitatively in Section 2 of the main text
More informationThe Clifford algebra and the Chevalley map - a computational approach (detailed version 1 ) Darij Grinberg Version 0.6 (3 June 2016). Not proofread!
The Cliord algebra and the Chevalley map - a computational approach detailed version 1 Darij Grinberg Version 0.6 3 June 2016. Not prooread! 1. Introduction: the Cliord algebra The theory o the Cliord
More informationEconomics 201B Economic Theory (Spring 2017) Bargaining. Topics: the axiomatic approach (OR 15) and the strategic approach (OR 7).
Economics 201B Economic Theory (Spring 2017) Bargaining Topics: the axiomatic approach (OR 15) and the strategic approach (OR 7). The axiomatic approach (OR 15) Nash s (1950) work is the starting point
More informationCostly Expertise. Dino Gerardi and Leeat Yariv yz. Current Version: December, 2007
Costly Expertise Dino Gerardi and Leeat Yariv yz Current Version: December, 007 In many environments expertise is costly. Costs can manifest themselves in numerous ways, ranging from the time that is required
More informationBasic mathematics of economic models. 3. Maximization
John Riley 1 January 16 Basic mathematics o economic models 3 Maimization 31 Single variable maimization 1 3 Multi variable maimization 6 33 Concave unctions 9 34 Maimization with non-negativity constraints
More informationME 328 Machine Design Vibration handout (vibrations is not covered in text)
ME 38 Machine Design Vibration handout (vibrations is not covered in text) The ollowing are two good textbooks or vibrations (any edition). There are numerous other texts o equal quality. M. L. James,
More informationExperimentation, Patents, and Innovation
Experimentation, Patents, and Innovation Daron Acemoglu Kostas Bimpikis Asuman Ozdaglar Abstract This paper studies a simple model of experimentation and innovation. Our analysis suggests that patents
More informationDefinition: Let f(x) be a function of one variable with continuous derivatives of all orders at a the point x 0, then the series.
2.4 Local properties o unctions o several variables In this section we will learn how to address three kinds o problems which are o great importance in the ield o applied mathematics: how to obtain the
More informationLimit pricing models and PBE 1
EconS 503 - Advanced Microeconomics II Limit pricing models and PBE 1 1 Model Consider an entry game with an incumbent monopolist (Firm 1) and an entrant (Firm ) who analyzes whether or not to join the
More informationImage Enhancement (Spatial Filtering 2)
Image Enhancement (Spatial Filtering ) Dr. Samir H. Abdul-Jauwad Electrical Engineering Department College o Engineering Sciences King Fahd University o Petroleum & Minerals Dhahran Saudi Arabia samara@kupm.edu.sa
More informationIncentive-Based Pricing for Network Games with Complete and Incomplete Information
Incentive-Based Pricing for Network Games with Complete and Incomplete Information Hongxia Shen and Tamer Başar Coordinated Science Laboratory University of Illinois at Urbana-Champaign hshen1, tbasar@control.csl.uiuc.edu
More informationSemideterministic Finite Automata in Operational Research
Applied Mathematical Sciences, Vol. 0, 206, no. 6, 747-759 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.2988/ams.206.62 Semideterministic Finite Automata in Operational Research V. N. Dumachev and
More informationTime Preferences. Mark Dean. ECON 2090 Spring 2015
Time Preferences Mark Dean ECON 2090 Spring 2015 Two Standard Ways Last week we suggested two possible ways of spotting temptation 1 Preference for Commitment 2 Time inconsistency Previously we covered
More informationTaylor Series and the Mean Value Theorem of Derivatives
1 - Taylor Series and te Mean Value Teorem o Derivatives Te numerical solution o engineering and scientiic problems described by matematical models oten requires solving dierential equations. Dierential
More informationMath 754 Chapter III: Fiber bundles. Classifying spaces. Applications
Math 754 Chapter III: Fiber bundles. Classiying spaces. Applications Laurențiu Maxim Department o Mathematics University o Wisconsin maxim@math.wisc.edu April 18, 2018 Contents 1 Fiber bundles 2 2 Principle
More informationDelay Analysis of Spatio-Temporal Channel Access for Cognitive Networks
Dela Analsis o Spatio-Temporal Channel Access or Cognitive Networks Chia-han Lee chiahan@citi.sinica.edu.tw Research Center or IT Innovation Academia Sinica Taipei, Taiwan Martin Haenggi mhaenggi@nd.edu
More informationComputer Science B Homework #2 Due Monday February 9, 2004, 13:30
Computer Science 308-250B Homework #2 Due Monday February 9, 2004, 13:30 In all the problems, all calculations are done mod M where M=3333373 in order to limit the size o the integers involved. This way
More informationCS 361 Meeting 28 11/14/18
CS 361 Meeting 28 11/14/18 Announcements 1. Homework 9 due Friday Computation Histories 1. Some very interesting proos o undecidability rely on the technique o constructing a language that describes the
More informationSolution. outside Styrofoam
Ice chest You are in charge o keeping the drinks cold or a picnic. You have a Styrooam box that is illed with cola, water and you plan to put some 0 o ice in it. Your task is to buy enough ice to put in
More informationDigital Image Processing. Lecture 6 (Enhancement) Bu-Ali Sina University Computer Engineering Dep. Fall 2009
Digital Image Processing Lecture 6 (Enhancement) Bu-Ali Sina University Computer Engineering Dep. Fall 009 Outline Image Enhancement in Spatial Domain Spatial Filtering Smoothing Filters Median Filter
More informationEquilibria for games with asymmetric information: from guesswork to systematic evaluation
Equilibria for games with asymmetric information: from guesswork to systematic evaluation Achilleas Anastasopoulos anastas@umich.edu EECS Department University of Michigan February 11, 2016 Joint work
More informationProblem Set. Problems on Unordered Summation. Math 5323, Fall Februray 15, 2001 ANSWERS
Problem Set Problems on Unordered Summation Math 5323, Fall 2001 Februray 15, 2001 ANSWERS i 1 Unordered Sums o Real Terms In calculus and real analysis, one deines the convergence o an ininite series
More informationFinite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract)
Electronic Notes in Theoretical Computer Science 270 (1) (2011) 113 119 www.elsevier.com/locate/entcs Finite Dimensional Hilbert Spaces are Complete or Dagger Compact Closed Categories (Extended bstract)
More informationENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University
ENSC37 Communications Systems : Fourier Representations School o Engineering Science Simon Fraser University Outline Chap..5: Signal Classiications Fourier Transorm Dirac Delta Function Unit Impulse Fourier
More informationBargaining, Contracts, and Theories of the Firm. Dr. Margaret Meyer Nuffield College
Bargaining, Contracts, and Theories of the Firm Dr. Margaret Meyer Nuffield College 2015 Course Overview 1. Bargaining 2. Hidden information and self-selection Optimal contracting with hidden information
More informationSecure Communication in Multicast Graphs
Secure Communication in Multicast Graphs Qiushi Yang and Yvo Desmedt Department o Computer Science, University College London, UK {q.yang, y.desmedt}@cs.ucl.ac.uk Abstract. In this paper we solve the problem
More informationOptimal Control. with. Aerospace Applications. James M. Longuski. Jose J. Guzman. John E. Prussing
Optimal Control with Aerospace Applications by James M. Longuski Jose J. Guzman John E. Prussing Published jointly by Microcosm Press and Springer 2014 Copyright Springer Science+Business Media New York
More informationThe Analysis of Electricity Storage Location Sites in the Electric Transmission Grid
Proceedings o the 2010 Industrial Engineering Research Conerence A. Johnson and J. Miller, eds. The Analysis o Electricity Storage Location Sites in the Electric Transmission Grid Thomas F. Brady College
More information(C) The rationals and the reals as linearly ordered sets. Contents. 1 The characterizing results
(C) The rationals and the reals as linearly ordered sets We know that both Q and R are something special. When we think about about either o these we usually view it as a ield, or at least some kind o
More informationA Solution to the Problem of Externalities When Agents Are Well-Informed
A Solution to the Problem of Externalities When Agents Are Well-Informed Hal R. Varian. The American Economic Review, Vol. 84, No. 5 (Dec., 1994), pp. 1278-1293 Introduction There is a unilateral externality
More informationPreference Elicitation for Sequential Decision Problems
Preference Elicitation for Sequential Decision Problems Kevin Regan University of Toronto Introduction 2 Motivation Focus: Computational approaches to sequential decision making under uncertainty These
More informationCurve Sketching. The process of curve sketching can be performed in the following steps:
Curve Sketching So ar you have learned how to ind st and nd derivatives o unctions and use these derivatives to determine where a unction is:. Increasing/decreasing. Relative extrema 3. Concavity 4. Points
More informationRobust Residual Selection for Fault Detection
Robust Residual Selection or Fault Detection Hamed Khorasgani*, Daniel E Jung**, Gautam Biswas*, Erik Frisk**, and Mattias Krysander** Abstract A number o residual generation methods have been developed
More informationEconS Advanced Microeconomics II Handout on Repeated Games
EconS 503 - Advanced Microeconomics II Handout on Repeated Games. MWG 9.B.9 Consider the game in which the following simultaneous-move game as depicted in gure is played twice: Player Player 2 b b 2 b
More informationEconS Oligopoly - Part 2
EconS 305 - Oligopoly - Part 2 Eric Dunaway Washington State University eric.dunaway@wsu.edu November 29, 2015 Eric Dunaway (WSU) EconS 305 - Lecture 32 November 29, 2015 1 / 28 Introduction Last time,
More informationOnline Appendix for Lerner Symmetry: A Modern Treatment
Online Appendix or Lerner Symmetry: A Modern Treatment Arnaud Costinot MIT Iván Werning MIT May 2018 Abstract Tis Appendix provides te proos o Teorem 1, Teorem 2, and Proposition 1. 1 Perect Competition
More informationUnique Nash Implementation for a Class of Bargaining Solutions
Unique Nash Implementation for a Class of Bargaining Solutions Walter Trockel University of California, Los Angeles and Bielefeld University Mai 1999 Abstract The paper presents a method of supporting
More informationSequential Search Auctions with a Deadline
Sequential Search Auctions with a Deadline Joosung Lee Daniel Z. Li University of Edinburgh Durham University January, 2018 1 / 48 A Motivational Example A puzzling observation in mergers and acquisitions
More informationRent-seeking with Non-Identical Sharing Rules: An Equilibrium Rescued
Rent-seeking with Non-Identical Sharing Rules: An Equilibrium Rescued by Douglas D. Davis and Robert J. Reilly * September 1997 Abstract Nitzan s (1991) analysis of differential sharing rules in a collective
More informationE E B B. over U is a full subcategory of the fiber of C,D over U. Given [B, B ], and h=θ over V, the Cartesian arrow M=f
ppendix : ibrational teory o L euivalence E E onsider ibrations P, P, and te category Fib[,] o all maps E @E 2 =(, ):@ :: P { P 2 () @ o ibrations; Fib[,] is a ull subcategory o [,] ; see [3]. Fib[,] is
More informationCyber-Awareness and Games of Incomplete Information
Cyber-Awareness and Games of Incomplete Information Jeff S Shamma Georgia Institute of Technology ARO/MURI Annual Review August 23 24, 2010 Preview Game theoretic modeling formalisms Main issue: Information
More informationIn the index (pages ), reduce all page numbers by 2.
Errata or Nilpotence and periodicity in stable homotopy theory (Annals O Mathematics Study No. 28, Princeton University Press, 992) by Douglas C. Ravenel, July 2, 997, edition. Most o these were ound by
More informationOrganizational Equilibrium with Capital
Organizational Equilibrium with Capital Marco Bassetto, Zhen Huo, and José-Víctor Ríos-Rull FRB of Chicago, Yale University, University of Pennsylvania, UCL, CAERP Fiscal Policy Conference Mar 20, 2018
More informationEngineering Decisions
GSOE9 vicj@cse.unsw.edu.au www.cse.unsw.edu.au/~gs9 Outline Decision problem classes Decision problems can be classiied based on an agent s epistemic state: Decisions under certainty: the agent knows the
More informationBackwards Induction. Extensive-Form Representation. Backwards Induction (cont ) The player 2 s optimization problem in the second stage
Lecture Notes II- Dynamic Games of Complete Information Extensive Form Representation (Game tree Subgame Perfect Nash Equilibrium Repeated Games Trigger Strategy Dynamic Games of Complete Information Dynamic
More informationAnalysis on the Strengthening Buffer Operator Based on the Strictly Monotone Function
International Journal o Applied Physics and Mathematics Vol. 3 No. March 03 Analysis on the Strengthening Buer Operator Based on the Strictly Monotone Function Hu Xiao-Li Wu Zheng-Peng and Han Ran Abstract
More informationApproximative Methods for Monotone Systems of min-max-polynomial Equations
Approximative Methods or Monotone Systems o min-max-polynomial Equations Javier Esparza, Thomas Gawlitza, Stean Kieer, and Helmut Seidl Institut ür Inormatik Technische Universität München, Germany {esparza,gawlitza,kieer,seidl}@in.tum.de
More informationFIXED POINTS OF RENORMALIZATION.
FIXED POINTS OF RENORMALIZATION. XAVIER BUFF Abstract. To study the geometry o a Fibonacci map o even degree l 4, Lyubich [Ly2] deined a notion o generalized renormalization, so that is renormalizable
More informationCOMPOSITE AND INVERSE FUNCTIONS & PIECEWISE FUNCTIONS
Functions Modeling Change: A Preparation or Calculus, 4th Edition, 2011, Connally 2.4 COMPOSITE AND INVERSE FUNCTIONS & PIECEWISE FUNCTIONS Functions Modeling Change: A Preparation or Calculus, 4th Edition,
More informationOn Adjacent Vertex-distinguishing Total Chromatic Number of Generalized Mycielski Graphs. Enqiang Zhu*, Chanjuan Liu and Jin Xu
TAIWANESE JOURNAL OF MATHEMATICS Vol. xx, No. x, pp. 4, xx 20xx DOI: 0.650/tjm/6499 This paper is available online at http://journal.tms.org.tw On Adjacent Vertex-distinguishing Total Chromatic Number
More informationECO 199 GAMES OF STRATEGY Spring Term 2004 Precepts Week 7 March Questions GAMES WITH ASYMMETRIC INFORMATION QUESTIONS
ECO 199 GAMES OF STRATEGY Spring Term 2004 Precepts Week 7 March 22-23 Questions GAMES WITH ASYMMETRIC INFORMATION QUESTIONS Question 1: In the final stages of the printing of Games of Strategy, Sue Skeath
More informationAdministration. CSCI567 Machine Learning (Fall 2018) Outline. Outline. HW5 is available, due on 11/18. Practice final will also be available soon.
Administration CSCI567 Machine Learning Fall 2018 Prof. Haipeng Luo U of Southern California Nov 7, 2018 HW5 is available, due on 11/18. Practice final will also be available soon. Remaining weeks: 11/14,
More informationFunction Operations. I. Ever since basic math, you have been combining numbers by using addition, subtraction, multiplication, and division.
Function Operations I. Ever since basic math, you have been combining numbers by using addition, subtraction, multiplication, and division. Add: 5 + Subtract: 7 Multiply: (9)(0) Divide: (5) () or 5 II.
More informationNET Institute*
NET Institute* wwwnetinstorg Working Paper #07-44 November 007 Competing Complements Ramon Casadesus-Masanell Harvard Business School Barry Nalebu SOM Yale University David Yoie Harvard Business School
More informationPolitical Economy of Institutions and Development. Lecture 8. Institutional Change and Democratization
14.773 Political Economy of Institutions and Development. Lecture 8. Institutional Change and Democratization Daron Acemoglu MIT March 5, 2013. Daron Acemoglu (MIT) Political Economy Lecture 8 March 5,
More informationRolling without slipping Angular Momentum Conservation of Angular Momentum. Physics 201: Lecture 19, Pg 1
Physics 131: Lecture Today s Agenda Rolling without slipping Angular Momentum Conservation o Angular Momentum Physics 01: Lecture 19, Pg 1 Rolling Without Slipping Rolling is a combination o rotation and
More informationBasics of Game Theory
Basics of Game Theory Giacomo Bacci and Luca Sanguinetti Department of Information Engineering University of Pisa, Pisa, Italy {giacomo.bacci,luca.sanguinetti}@iet.unipi.it April - May, 2010 G. Bacci and
More informationLECTURE 6: FIBER BUNDLES
LECTURE 6: FIBER BUNDLES In this section we will introduce the interesting class o ibrations given by iber bundles. Fiber bundles lay an imortant role in many geometric contexts. For examle, the Grassmaniann
More information