Lecture Note II-3 Static Games of Incomplete Information. Games of incomplete information. Cournot Competition under Asymmetric Information (cont )
|
|
- Agatha McKenzie
- 5 years ago
- Views:
Transcription
1 Lecture Note II- Static Games of Incomplete Information Static Bayesian Game Bayesian Nash Equilibrium Applications: Auctions The Revelation Principle Games of incomplete information Also called Bayesian Games At least one player in uncertain about another player s playoff function Example of static game of incomplete information: A sealed-bid auction Each bidder knows his or her own valuation for the good being sold but does not know any other bidder s valuation Bids are submitted in sealed envelopes (players moves can be thought of as simultaneous Example: Cournot Competition under Asymmetric Information Cournot duopoly model with inverse demand given by P(Qa-Q, where Qq +q Firm s cost function is C (q cq Firm s cost function is C (q c H q with probability θ and C (q c L q with probability - θ Information is asymmetric: firm knows its cost function and firm s, but firm know its cost function and only that firm s marginal cost is C H with probability θ and C L with probability - θ All of this is common knowledge: firm knows that firm has superior information, firm knows that firm know this, and so on Cournot Competition under Asymmetric Information Let q (c H and q (c L denote firm s quantity choice as a function of its cost, and let q * denote firm s single quantity choice If firm s cost is high, it will choose q (c H to solve max[( a q * q c ] q q H If firm s cost is low, it will choose q (c L to solve max[( a q * q c ] q q L Cournot Competition under Asymmetric Information Firm chooses q * to solve * * max θ[( a q q ( ch cq ] + ( θ[( a q q ( cl cq ] q The first-order conditions for these three optimization problem are a q * ch q * ( ch a q * cl q *( cl * * θ[( a q ( ch c] + ( θ [( a q ( cl c] q* Cournot Competition under Asymmetric Information The solutions to the three first-order conditions are a c *( H + c θ q ch ( ch cl; 6 a c *( L+ c θ q cl ( ch cl 6 + a c+ θc + ( θ q* If information is symmetric (player know player s cost (c H or c L, say c a c+ c q **( c Implication a c+ c q **( c H q *( ch > q **( ch ; q *( cl < q **( cl q **( cl < q* < q **( ch cl
2 Static Bayesian Games Definition: The normal-form representation of an n-player static Bayesian game specifies the players action spaces A,,A n, their type spaces T, T n, their beliefs p,,p n, and their playoff functions u,,u n. Player i stype t i, is privately known by player i, determines player i s payoff function, u i (a,,a n ;t i, and t i is a member of the set of possible types, T i. Player i s belief p i (t -i t i describes i s uncertainty about the n- other players possible types, t -i, given i s own type, t i. We denote this game by G{A,,A n ;T,,T n ;p,,p n ;u,,u n } Static Bayesian Games Example: Cournot game The firms actions are their quantity choices, q and q Firm has two possible profit or payoff functions π( q, q; c L ( a q q c L q π ( q, q; c H ( a q q c H q Firm has only one possible payoff function (, ; ( π q q c a q q c q Firm s type space is T {c L,c H } and that firm s type space is T {c} Static Bayesian Games When player i s payoff depend not only on the actions (a,,a n but also on all the types (t,,t n, we write this payoff as u i (a,,a n ;t,,t n Assume nature draws a type vector t(t,,t n according to the prior probability distribution p(t player i s belief probability p i (t -i t i can be computed using Bayes rule pt ( i, ti pt ( i, ti pi ( t i ti pt ( pt (, t i t i T i i i Bayesian Nash Equilibrium Definition: In the static Bayesian game G{A,..,A n ;T,,T n ;p,,p n ;u,,u n }, a strategy for player i is a function s i (t i where for each type t i in T i, s i (t i specifies the action from the feasible set A i that type t i would choose if drawn by nature i.e. A strategy is a function from types to actions Definition: In the static Bayesian game G{A,..,A n ;T,,T n ;p,,p n ;u,,u n }, the strategies s*(s *,...,s n * are a (pure strategy Bayesian Nash equilibrium if for each player i and for each of i s types t i in T i, s i *(t i solves * max ui( s * ( t,..., si ( ti, ai, si+ *( ti+,..., sn * ( tn; t pi ( t i ti ai Ai t i T i Example: Battle of Sexes Game Player Fight Player Fight +t c,,+t p Player s payoff if both attend is +t c, where t c is privately known by player Player s payoff if both attend Fight is +t p, where t p is privately known by player t c and t p are independent draws from a uniform distribution on [0,x] Example: Battle of Sexes Game Static Bayesian game G{A c,a p ;T c,t p ;p c,p p ;u c,u p } The action spaces are A c A p {, Fight} The type spaces are T c T p [0,x] The beliefs are p c (t p p p (t c /x for all t c and t p Strategies Player plays if t c exceeds a critical value c, and plays Fight otherwise With probability (x-c/x to play Player plays Fight if t p exceeds a critical value p, and plays otherwise With probability (x-p/x to play Fight
3 Example : Battle of Sexes Game Player s optimal strategy is play if p p p p ( + tc + [ ] [ ] x x x x p p ( + tc x x x tc c p Player s optimal strategy is play Fight if Example : Battle of Sexes Game p c; p + p x 0 x c x p x x x x When x is small x c x p x lim lim lim( x 0 x x 0 x x 0 x c c c c [ ] 0 + ( + tp [ ] + 0 x x x x c c x ( + tp tp p x x c Fight +t c, Fight,+t p Implication: player play with probability / player play Fight with probability / Mixed strategy Nash Equilibrium VS. Pure Strategy Bayesian Nash Equilibrium A mixed- strategy Nash equilibrium is a game of complete information can be (almost always be interpreted as a pure-strategy Bayesian Nash equilibrium in a closely related game with a little bit of incomplete information Example: Battle of Sexes q -q Fight r -r Fight,, Two pure Nash equilibrium (, and (Fight, Fight A mixed strategy Nash Equilibrium (r,-r(/,/ and (q,-q(/, / Application : An auction First-price, sealed-bid auction The bidders simultaneously submit their bids. The higher bidders wins the good and pays the price she bided In case of a tie, the winner is determined by a flip of a coin Two bidders, labeled i, Bidder i has value v i for the good. The two bidders valuations are independently and uniformly distributed on [0,] If bidder i gets the good and plays the price p, then i s payoff is v-p Application : An auction Bayesian game G{A,A ;T,T ;p,p ;u,u } Action spaces A I [0, ] Type space is T i [0,] Player i s action is to submit a bid b i and her type is her valuation v i Player i s payoff function vi bi if bi > bj ui( b, b ; v, v ( vi bi / if bi bj 0 f bi < bj Application : An auction Player s strategy b (v is a best response to player s strategy b (v and vice versa The pair of (b (v,b (v is a Bayesian Nash equilibrium if for each v i in [0,], b i (v i solves max( vi bi Pr obb { i > bj ( vj } + ( vi bi probb { i bj ( vj } b i
4 Application : An auction Linear equilibrium :b i (v i a i +c i v i e.g. b (v a +c v and b (v a +c v bi aj max ui ( vi bi Pr obb { i > bj ( vj } ( vi bi bi c st.. a j j bi aj + cj Note: bi aj bi aj Pr obb { i > bj( vj } Pr obv { j < } cj cj ( vi + aj / if vi aj bi ( vi aj if vi < aj a i a j 0; c i c j / bi ( vi vi / Application : An auction Symmetric equilibrium: suppose player j adopts the strategy b(., and assume b(. is strictly increasing and differential max ui ( vi bi Pr obb { i > bj ( vj } b i Pr obb { i > bv ( j } Pr obb { ( bi > vj} b ( bi v i First order condition d b ( bi + ( vi bi b ( bi 0 dbi bv ( i vi b ( bj vj if bj bv ( j d b ( bi + ( vi bi b ( bi 0 dbi dvi vi + ( vi bv ( i 0 dbv ( i vi + ( vi b( vi 0 b ( vi b ( vi vi + bv ( i vi bv ( i vi vi + k; b(0 0 Application : A Double Auction The buyer s valuation for the seller s good is v b, the seller s is v s. These valuations are private information and are drawn from independent uniform distributions on [0,] The seller names an asking price, p s, and the buyer simultaneously names an offer price, p b If p b > p s, then trade occurs at price p(p b + p s /; if p b < p s then no trade occurs Application : A Double Auction v b x v b >x>v s Trade v b >v s x One price equilibrium The buyer offers x if v b >x The seller demands x if v s <x v s Application : A Double Auction A pair of strategies {p b (v b, p s (v s } is a Bayesian Nash equilibrium if the following two conditions hold Expected price the seller will demand pb+ E[ ps ( vs pb ps ( vs ] max vb prob{ pb ps( vs } pb ps+ E[ pb ( vb pb ( vb ps] max vs prob{ pb( vs ps} ps Expected price the buyer will offer Application : A Double Auction Assume linear BNE p b and p s can be derived by solving as+ pb pb as max vb { pb + } pb cs ps ab cb ab cb ps max { p + + s+ } v + s ps cb Solve FOC simultaneously pb vb + as pb vb + ps vb + ( ab + cb p s vs+ 4 ps( vs as+ cv s s; pb ( vb ab + cv b b as+ cs 0 ps( vs pb as + pb E ps ( vs pb ps ( v s ps pb ( vb ab + cb ps + ab + cb E[ pb ( vb pb ( vb p s] pb as prob{ pb ps( vs } prob{ vs } cs ps ab prob{ pb ( vs ps} prob{ vs } cb ab + cb ps cb 4
5 Application : A Double Auction Application : A Double Auction pb ( vb vb+ ps ( vs vs+ 4 p s,p b /4 p s (v s p b (v b / /4 pb ps vb vs + 4 v b v b v s +/4 v b v s Trade / /4 /4 v s,v b Linear equilibrium v s Direct Mechanisms Direct Mechanisms Static Bayesian games in which each player s only action is to submit a claim about his or her type A new static Bayesian game with the same types spaces and beliefs as original static Bayesian game but with new action spaces and new payoff functions The playoff functions are chosen so as to confront each player with a choice of exactly of its kind The Revelation Principle (Cont Direct Mechanisms Design Consider the Bayesian Nash equilibrium s*(s *,,s n * in static Bayesian game G{A,,A n ;T,,T n ;p,,p n ; u,,u n } A direct mechanism is a new static Bayesian game is G{T,,T n ;T,,T n ;p,,p n ; v,,v n } The Revelation Principle (Myerson 979 Incentive-compatible direct mechanisms Truth-telling is a Bayesian Nash equilibrium Theorem (The revelation Principle Any Bayesian Nash equilibrium of any Bayesian game can be represented by an incentive-compatible direct mechanism Direct Mechanism Implementation of a direct mechanism ( Each player signs a contract that allows the neutral outsider to dictate the action you will take when we later play the game G ( Each of the players write down a claim about your type τ i, and submit to the neutral outsider ( The neutral outsider use each player s type report in new game τ i, together with the player s equilibrium strategy from the old game s i *, to compute the action the player would have taken in the equilibrium s* if the player s type s type really were (4 The neutral outsider will dictate that each of the players to take the action the neutral outsider have computed for the players, and the players will receive the resulting playoff 5
6 The Revelation Principle (Cont The Revelation Principle (truth-telling is a Bayesian Nash equilibrium (Proof Player i s action τ i and the players type report τ(τ,.., τ n Player i s playoff v i (τ, tu i [s*(τ,t], where t(t,,t n For each of i s types t i in T i, s i *(t i is the best action for i to choose from A i, given that other players strategies are (s *,, s i- *, s i+ *,,s n * If other players tell the truth, then when i s type is t i the best type to claim to be is t i.the new Bayesian Nash equilibrium of is for each player i to play the truth-telling strategyτ i (t i t i for every t i in T i Homework # Problem set.,.,,6,.7,.8 (from Gibbons Due date two weeks from current class meeting Bonus credit Propose new applications in the context of IT/IS or potential extensions from examples discussed 6
Game Theory. Monika Köppl-Turyna. Winter 2017/2018. Institute for Analytical Economics Vienna University of Economics and Business
Monika Köppl-Turyna Institute for Analytical Economics Vienna University of Economics and Business Winter 2017/2018 Static Games of Incomplete Information Introduction So far we assumed that payoff functions
More informationIntroduction to Game Theory
Introduction to Game Theory Part 3. Static games of incomplete information Chapter 2. Applications Ciclo Profissional 2 o Semestre / 2011 Graduação em Ciências Econômicas V. Filipe Martins-da-Rocha (FGV)
More informationOutline for Static Games of Incomplete Information
Outline for Static Games of Incomplete Information I. Example 1: An auction game with discrete bids II. Example 2: Cournot duopoly with one-sided asymmetric information III. Definition of Bayesian-Nash
More informationBayesian Games and Mechanism Design Definition of Bayes Equilibrium
Bayesian Games and Mechanism Design Definition of Bayes Equilibrium Harsanyi [1967] What happens when players do not know one another s payoffs? Games of incomplete information versus games of imperfect
More informationEC319 Economic Theory and Its Applications, Part II: Lecture 2
EC319 Economic Theory and Its Applications, Part II: Lecture 2 Leonardo Felli NAB.2.14 23 January 2014 Static Bayesian Game Consider the following game of incomplete information: Γ = {N, Ω, A i, T i, µ
More informationLecture 6 Games with Incomplete Information. November 14, 2008
Lecture 6 Games with Incomplete Information November 14, 2008 Bayesian Games : Osborne, ch 9 Battle of the sexes with incomplete information Player 1 would like to match player 2's action Player 1 is unsure
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 informationMicroeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016
Microeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016 1 Modelling incomplete information So far, we have studied games in which information was complete,
More informationGame Theory. Strategic Form Games with Incomplete Information. Levent Koçkesen. Koç University. Levent Koçkesen (Koç University) Bayesian Games 1 / 15
page.1 Game Theory Strategic Form Games with Incomplete Information Levent Koçkesen Koç University Levent Koçkesen (Koç University) Bayesian Games 1 / 15 page. Games with Incomplete Information Some players
More informationAdvanced Economic Theory Lecture 9. Bilateral Asymmetric Information. Double Auction (Chatterjee and Samuelson, 1983).
Leonardo Felli 6 December, 2002 Advanced Economic Theory Lecture 9 Bilateral Asymmetric Information Double Auction (Chatterjee and Samuelson, 1983). Two players, a buyer and a seller: N = {b, s}. The seller
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 informationMS&E 246: Lecture 12 Static games of incomplete information. Ramesh Johari
MS&E 246: Lecture 12 Static games of incomplete information Ramesh Johari Incomplete information Complete information means the entire structure of the game is common knowledge Incomplete information means
More informationLecture Notes on Game Theory
Lecture Notes on Game Theory Levent Koçkesen 1 Bayesian Games So far we have assumed that all players had perfect information regarding the elements of a game. These are called games with complete information.
More informationEconomics 3012 Strategic Behavior Andy McLennan October 20, 2006
Economics 301 Strategic Behavior Andy McLennan October 0, 006 Lecture 11 Topics Problem Set 9 Extensive Games of Imperfect Information An Example General Description Strategies and Nash Equilibrium Beliefs
More informationLecture 4. 1 Examples of Mechanism Design Problems
CSCI699: Topics in Learning and Game Theory Lecture 4 Lecturer: Shaddin Dughmi Scribes: Haifeng Xu,Reem Alfayez 1 Examples of Mechanism Design Problems Example 1: Single Item Auctions. There is a single
More informationMechanism Design. Christoph Schottmüller / 27
Mechanism Design Christoph Schottmüller 2015-02-25 1 / 27 Outline 1 Bayesian implementation and revelation principle 2 Expected externality mechanism 3 Review questions and exercises 2 / 27 Bayesian implementation
More informationThe Revenue Equivalence Theorem 1
John Nachbar Washington University May 2, 2017 The Revenue Equivalence Theorem 1 1 Introduction. The Revenue Equivalence Theorem gives conditions under which some very different auctions generate the same
More informationBayesian-Nash Equilibrium
Bayesian-Nash Equilibrium A Bayesian game models uncertainty over types of opponents a player faces The game was defined in terms of players, their types, their available actions A player s beliefs about
More informationTheory of Auctions. Carlos Hurtado. Jun 23th, Department of Economics University of Illinois at Urbana-Champaign
Theory of Auctions Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Jun 23th, 2015 C. Hurtado (UIUC - Economics) Game Theory On the Agenda 1 Formalizing
More informationOn Random Sampling Auctions for Digital Goods
On Random Sampling Auctions for Digital Goods Saeed Alaei Azarakhsh Malekian Aravind Srinivasan Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasan Random Sampling Auctions... 1 Outline Background 1 Background
More informationEconS Microeconomic Theory II Midterm Exam #2 - Answer Key
EconS 50 - Microeconomic Theory II Midterm Exam # - Answer Key 1. Revenue comparison in two auction formats. Consider a sealed-bid auction with bidders. Every bidder i privately observes his valuation
More informationNTU IO (I) : Auction Theory and Mechanism Design II Groves Mechanism and AGV Mechansim. u i (x, t i, θ i ) = V i (x, θ i ) + t i,
Meng-Yu Liang NTU O : Auction Theory and Mechanism Design Groves Mechanism and AGV Mechansim + 1 players. Types are drawn from independent distribution P i on [θ i, θ i ] with strictly positive and differentiable
More informationCPS 173 Mechanism design. Vincent Conitzer
CPS 173 Mechanism design Vincent Conitzer conitzer@cs.duke.edu edu Mechanism design: setting The center has a set of outcomes O that she can choose from Allocations of tasks/resources, joint plans, Each
More informationMechanism Design: Bayesian Incentive Compatibility
May 30, 2013 Setup X : finite set of public alternatives X = {x 1,..., x K } Θ i : the set of possible types for player i, F i is the marginal distribution of θ i. We assume types are independently distributed.
More informationEC3224 Autumn Lecture #03 Applications of Nash Equilibrium
Reading EC3224 Autumn Lecture #03 Applications of Nash Equilibrium Osborne Chapter 3 By the end of this week you should be able to: apply Nash equilibrium to oligopoly games, voting games and other examples.
More informationStatic (or Simultaneous- Move) Games of Complete Information
Static (or Simultaneous- Move) Games of Complete Information Introduction to Games Normal (or Strategic) Form Representation Teoria dos Jogos - Filomena Garcia 1 Outline of Static Games of Complete Information
More informationMechanism Design II. Terence Johnson. University of Notre Dame. Terence Johnson (ND) Mechanism Design II 1 / 30
Mechanism Design II Terence Johnson University of Notre Dame Terence Johnson (ND) Mechanism Design II 1 / 30 Mechanism Design Recall: game theory takes the players/actions/payoffs as given, and makes predictions
More informationInformed Principal in Private-Value Environments
Informed Principal in Private-Value Environments Tymofiy Mylovanov Thomas Tröger University of Bonn June 21, 2008 1/28 Motivation 2/28 Motivation In most applications of mechanism design, the proposer
More informationUC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016
UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016 More on strategic games and extensive games with perfect information Block 2 Jun 12, 2016 Food for thought LUPI Many players
More informationChapter 2. Equilibrium. 2.1 Complete Information Games
Chapter 2 Equilibrium Equilibrium attempts to capture what happens in a game when players behave strategically. This is a central concept to these notes as in mechanism design we are optimizing over games
More informationChapter 2. Equilibrium. 2.1 Complete Information Games
Chapter 2 Equilibrium The theory of equilibrium attempts to predict what happens in a game when players behave strategically. This is a central concept to this text as, in mechanism design, we are optimizing
More informationSealed-bid first-price auctions with an unknown number of bidders
Sealed-bid first-price auctions with an unknown number of bidders Erik Ekström Department of Mathematics, Uppsala University Carl Lindberg The Second Swedish National Pension Fund e-mail: ekstrom@math.uu.se,
More informationBayesian Games and Auctions
Bayesian Games and Auctions Mihai Manea MIT Games of Incomplete Information Incomplete information: players are uncertain about the payoffs or types of others Often a player s type defined by his payoff
More informationAdvanced Microeconomics II
Advanced Microeconomics Auction Theory Jiaming Mao School of Economics, XMU ntroduction Auction is an important allocaiton mechanism Ebay Artwork Treasury bonds Air waves ntroduction Common Auction Formats
More informationTwo hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Thursday 17th May 2018 Time: 09:45-11:45. Please answer all Questions.
COMP 34120 Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE AI and Games Date: Thursday 17th May 2018 Time: 09:45-11:45 Please answer all Questions. Use a SEPARATE answerbook for each SECTION
More informationAnswers to Spring 2014 Microeconomics Prelim
Answers to Spring 204 Microeconomics Prelim. To model the problem of deciding whether or not to attend college, suppose an individual, Ann, consumes in each of two periods. She is endowed with income w
More informationSolution: Since the prices are decreasing, we consider all the nested options {1,..., i}. Given such a set, the expected revenue is.
Problem 1: Choice models and assortment optimization Consider a MNL choice model over five products with prices (p1,..., p5) = (7, 6, 4, 3, 2) and preference weights (i.e., MNL parameters) (v1,..., v5)
More informationRobust Predictions in Games with Incomplete Information
Robust Predictions in Games with Incomplete Information joint with Stephen Morris (Princeton University) November 2010 Payoff Environment in games with incomplete information, the agents are uncertain
More informationLecture 10: Mechanism Design
Computational Game Theory Spring Semester, 2009/10 Lecture 10: Mechanism Design Lecturer: Yishay Mansour Scribe: Vera Vsevolozhsky, Nadav Wexler 10.1 Mechanisms with money 10.1.1 Introduction As we have
More informationPerfect Bayesian Equilibrium. Definition. The single-crossing property. This is a draft; me with comments, typos, clarifications, etc.
Economics 0c: week This is a draft; email me with comments, typos, clarifications, etc. Perfect Bayesian Equilibrium We are by now familiar with the concept of Bayesian Nash equilibrium: agents are best
More informationPh.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program May 2012
Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program May 2012 The time limit for this exam is 4 hours. It has four sections. Each section includes two questions. You are
More informationAn auction with finite types
This is a draft; email me with comments, typos, clarifications, etc. An auction with finite types Let s consider the simplest case of an auction with finite types: there are two players i {1, 2} with types
More informationInformation Design. Dirk Bergemann and Stephen Morris. Johns Hopkins University April 2017
Information Design Dirk Bergemann and Stephen Morris Johns Hopkins University April 2017 Mechanism Design and Information Design Basic Mechanism Design: Fix an economic environment and information structure
More informationAnswer Key for M. A. Economics Entrance Examination 2017 (Main version)
Answer Key for M. A. Economics Entrance Examination 2017 (Main version) July 4, 2017 1. Person A lexicographically prefers good x to good y, i.e., when comparing two bundles of x and y, she strictly prefers
More informationVickrey Auction. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design
Algorithmic Game Theory Vickrey Auction Vickrey-Clarke-Groves Mechanisms Mechanisms with Money Player preferences are quantifiable. Common currency enables utility transfer between players. Preference
More informationMechanism Design: Bargaining
Mechanism Design: Bargaining Dilip Mookherjee Boston University Ec 703b Lecture 5 (text: FT Ch 7, pp 275-279) DM (BU) Mech Design 703b.5 2019 1 / 13 The Bargaining Problem Two agents: S, seller and B,
More informationGame Theory. Solutions to Problem Set 4
1 Hotelling s model 1.1 Two vendors Game Theory Solutions to Problem Set 4 Consider a strategy pro le (s 1 s ) with s 1 6= s Suppose s 1 < s In this case, it is pro table to for player 1 to deviate and
More informationInterdependent Value Auctions with an Insider Bidder 1
Interdependent Value Auctions with an Insider Bidder Jinwoo Kim We study the efficiency of standard auctions with interdependent values in which one of two bidders is perfectly informed of his value while
More information1 Games in Normal Form (Strategic Form)
Games in Normal Form (Strategic Form) A Game in Normal (strategic) Form consists of three components. A set of players. For each player, a set of strategies (called actions in textbook). The interpretation
More informationMsc Micro I exam. Lecturer: Todd Kaplan.
Msc Micro I 204-205 exam. Lecturer: Todd Kaplan. Please answer exactly 5 questions. Answer one question from each of sections: A, B, C, and D and answer one additional question from any of the sections
More informationGame Theory: Spring 2017
Game Theory: Spring 2017 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today So far, our players didn t know the strategies of the others, but
More informationNotes on Mechanism Designy
Notes on Mechanism Designy ECON 20B - Game Theory Guillermo Ordoñez UCLA February 0, 2006 Mechanism Design. Informal discussion. Mechanisms are particular types of games of incomplete (or asymmetric) information
More informationGeneralizing mechanism design theory to a case where agents types are adjustable
MPRA Munich Personal RePEc Archive Generalizing mechanism design theory to a case where agents types are adjustable Haoyang Wu Wan-Dou-Miao Research Lab 27 December 2018 Online at https://mpra.ub.uni-muenchen.de/90941/
More informationSolution to Tutorial 9
Solution to Tutorial 9 2011/2012 Semester I MA4264 Game Theory Tutor: Xiang Sun October 27, 2011 Exercise 1. A buyer and a seller have valuations v b and v s. It is common knowledge that there are gains
More informationCompeting Teams. Hector Chade 1 Jan Eeckhout 2. SED June, Arizona State University 2 University College London and Barcelona GSE-UPF
Competing Teams Hector Chade 1 Jan Eeckhout 2 1 Arizona State University 2 University College London and Barcelona GSE-UPF SED June, 2014 The Problem We analyze assortative matching with externalities
More informationA Preliminary Introduction to Mechanism Design. Theory
A Preliminary Introduction to Mechanism Design Theory Hongbin Cai and Xi Weng Department of Applied Economics, Guanghua School of Management Peking University October 2014 Contents 1 Introduction 3 2 A
More informationLecture Slides - Part 4
Lecture Slides - Part 4 Bengt Holmstrom MIT February 2, 2016. Bengt Holmstrom (MIT) Lecture Slides - Part 4 February 2, 2016. 1 / 65 Mechanism Design n agents i = 1,..., n agent i has type θ i Θ i which
More informationIntroduction to Game Theory
Introduction to Game Theory Part 3. Dynamic games of incomplete information Chapter 3. Job Market Signaling Ciclo Profissional 2 o Semestre / 2011 Graduação em Ciências Econômicas V. Filipe Martins-da-Rocha
More informationANSWER KEY 2 GAME THEORY, ECON 395
ANSWER KEY GAME THEORY, ECON 95 PROFESSOR A. JOSEPH GUSE (1) (Gibbons 1.6) Consider again the Cournot duopoly model with demand given by the marginal willingness to pay function: P(Q) = a Q, but this time
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 informationEC476 Contracts and Organizations, Part III: Lecture 2
EC476 Contracts and Organizations, Part III: Lecture 2 Leonardo Felli 32L.G.06 19 January 2015 Moral Hazard: Consider the contractual relationship between two agents (a principal and an agent) The principal
More informationMechanism Design: Basic Concepts
Advanced Microeconomic Theory: Economics 521b Spring 2011 Juuso Välimäki Mechanism Design: Basic Concepts The setup is similar to that of a Bayesian game. The ingredients are: 1. Set of players, i {1,
More informationGame Theory. Wolfgang Frimmel. Perfect Bayesian Equilibrium
Game Theory Wolfgang Frimmel Perfect Bayesian Equilibrium / 22 Bayesian Nash equilibrium and dynamic games L M R 3 2 L R L R 2 2 L R L 2,, M,2, R,3,3 2 NE and 2 SPNE (only subgame!) 2 / 22 Non-credible
More informationGame Theory: introduction and applications to computer networks
Game Theory: introduction and applications to computer networks Introduction Giovanni Neglia INRIA EPI Maestro February 04 Part of the slides are based on a previous course with D. Figueiredo (UFRJ) and
More informationGame Theory Review Questions
Game Theory Review Questions Sérgio O. Parreiras All Rights Reserved 2014 0.1 Repeated Games What is the difference between a sequence of actions and a strategy in a twicerepeated game? Express a strategy
More informationVasilis Syrgkanis Microsoft Research NYC
Vasilis Syrgkanis Microsoft Research NYC 1 Large Scale Decentralized-Distributed Systems Multitude of Diverse Users with Different Objectives Large Scale Decentralized-Distributed Systems Multitude of
More informationGame Theory: Spring 2017
Game Theory: Spring 2017 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today In this second lecture on mechanism design we are going to generalise
More informationMechanism Design: Review of Basic Concepts
Juuso Välimäki Oslo Minicourse in Mechanism Design November 206 Mechanism Design: Review of Basic Concepts Single Agent We start with a review of incentive compatibility in the simplest possible setting:
More informationStatic Information Design
Static Information Design Dirk Bergemann and Stephen Morris Frontiers of Economic Theory & Computer Science, Becker-Friedman Institute, August 2016 Mechanism Design and Information Design Basic Mechanism
More informationSymmetric Separating Equilibria in English Auctions 1
Games and Economic Behavior 38, 19 27 22 doi:116 game21879, available online at http: wwwidealibrarycom on Symmetric Separating Equilibria in English Auctions 1 Sushil Bihchandani 2 Anderson Graduate School
More informationOptimal Auctions with Correlated Bidders are Easy
Optimal Auctions with Correlated Bidders are Easy Shahar Dobzinski Department of Computer Science Cornell Unversity shahar@cs.cornell.edu Robert Kleinberg Department of Computer Science Cornell Unversity
More informationSome problems related to the Progressive Second Price Auction Mechanism
Patrick Maillé Slide 1 Workshop ARC PRIXNeT, March 2003 Some problems related to the Progressive Second Price Auction Mechanism Patrick Maillé Patrick Maillé Slide 2 Outline Patrick Maillé Slide 2 Outline
More informationSolution to Tutorial 9
Solution to Tutorial 9 2012/2013 Semester I MA4264 Game Theory Tutor: Xiang Sun November 2, 2012 Exercise 1. We consider a game between two software developers, who sell operating systems (OS) for personal
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012
Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 Properties of Social Choice Functions Note: This is a only
More informationIntroduction to Mechanism Design
Introduction to Mechanism Design Xianwen Shi University of Toronto Minischool on Variational Problems in Economics September 2014 Introduction to Mechanism Design September 2014 1 / 75 Mechanism Design
More informationAdvanced Microeconomics
Advanced Microeconomics ECON5200 - Fall 2012 Introduction What you have done: - consumers maximize their utility subject to budget constraints and firms maximize their profits given technology and market
More informationMicroeconomic Theory (501b) Problem Set 10. Auctions and Moral Hazard Suggested Solution: Tibor Heumann
Dirk Bergemann Department of Economics Yale University Microeconomic Theory (50b) Problem Set 0. Auctions and Moral Hazard Suggested Solution: Tibor Heumann 4/5/4 This problem set is due on Tuesday, 4//4..
More informationFinal Exam (Solution) Economics 501b Microeconomic Theory
Dirk Bergemann and Johannes Hoerner Department of Economics Yale Uniersity Final Exam (Solution) Economics 5b Microeconomic Theory May This is a closed-book exam. The exam lasts for 8 minutes. Please write
More informationGame theory lecture 4. September 24, 2012
September 24, 2012 Finding Nash equilibrium Best-response or best-reply functions. We introduced Nash-equilibrium as a profile of actions (an action for each player) such that no player has an incentive
More informationGraph Theoretic Characterization of Revenue Equivalence
Graph Theoretic Characterization of University of Twente joint work with Birgit Heydenreich Rudolf Müller Rakesh Vohra Optimization and Capitalism Kantorovich [... ] problems of which I shall speak, relating
More informationIntroduction to Game Theory Lecture Note 2: Strategic-Form Games and Nash Equilibrium (2)
Introduction to Game Theory Lecture Note 2: Strategic-Form Games and Nash Equilibrium (2) Haifeng Huang University of California, Merced Best response functions: example In simple games we can examine
More informationReverse Auctions - The Contractors Game
Elmar G. Wolfstetter 1/12 Reverse Auctions - The Contractors Game June 24, 2014 Elmar G. Wolfstetter 2/12 Motivation Observers are often puzzled by the wide range of bids from similar consultants or contractors
More informationMechanism Design Tutorial David C. Parkes, Harvard University Indo-US Lectures Week in Machine Learning, Game Theory and Optimization
1 Mechanism Design Tutorial David C. Parkes, Harvard University Indo-US Lectures Week in Machine Learning, Game Theory and Optimization 2 Outline Classical mechanism design Preliminaries (DRMs, revelation
More informationEC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Reading EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium Osborne Chapter 4.1 to 4.10 By the end of this week you should be able to: find a mixed strategy Nash Equilibrium of a game explain why mixed
More informationOn the Informed Principal Model with Common Values
On the Informed Principal Model with Common Values Anastasios Dosis ESSEC Business School and THEMA École Polytechnique/CREST, 3/10/2018 Anastasios Dosis (ESSEC and THEMA) Informed Principal with Common
More informationAdvanced Microeconomics
Advanced Microeconomics Leonardo Felli EC441: Room D.106, Z.332, D.109 Lecture 8 bis: 24 November 2004 Monopoly Consider now the pricing behavior of a profit maximizing monopolist: a firm that is the only
More informationAlgorithmic Game Theory Introduction to Mechanism Design
Algorithmic Game Theory Introduction to Mechanism Design Makis Arsenis National Technical University of Athens April 216 Makis Arsenis (NTUA) AGT April 216 1 / 41 Outline 1 Social Choice Social Choice
More informationLecture Notes on Game Theory
Lecture Notes on Game Theory Levent Koçkesen Strategic Form Games In this part we will analyze games in which the players choose their actions simultaneously (or without the knowledge of other players
More informationInefficient Equilibria of Second-Price/English Auctions with Resale
Inefficient Equilibria of Second-Price/English Auctions with Resale Rod Garratt, Thomas Tröger, and Charles Zheng September 29, 2006 Abstract In second-price or English auctions involving symmetric, independent,
More informationMechanism Design. Terence Johnson. December 7, University of Notre Dame. Terence Johnson (ND) Mechanism Design December 7, / 44
Mechanism Design Terence Johnson University of Notre Dame December 7, 2017 Terence Johnson (ND) Mechanism Design December 7, 2017 1 / 44 Market Design vs Mechanism Design In Market Design, we have a very
More informationVirtual Robust Implementation and Strategic Revealed Preference
and Strategic Revealed Preference Workshop of Mathematical Economics Celebrating the 60th birthday of Aloisio Araujo IMPA Rio de Janeiro December 2006 Denitions "implementation": requires ALL equilibria
More informationIntroduction to Game Theory
Introduction to Game Theory Part 1. Static games of complete information Chapter 3. Mixed strategies and existence of equilibrium Ciclo Profissional 2 o Semestre / 2011 Graduação em Ciências Econômicas
More informationSequential Bidding in the Bailey-Cavallo Mechanism
Sequential Bidding in the Bailey-Cavallo Mechanism Krzysztof R. Apt 1,2 and Evangelos Markakis 2 1 CWI, Science Park 123, 1098 XG Amsterdam 2 Institute of Logic, Language and Computation, University of
More informationCS 573: Algorithmic Game Theory Lecture date: April 11, 2008
CS 573: Algorithmic Game Theory Lecture date: April 11, 2008 Instructor: Chandra Chekuri Scribe: Hannaneh Hajishirzi Contents 1 Sponsored Search Auctions 1 1.1 VCG Mechanism......................................
More informationGovernment 2005: Formal Political Theory I
Government 2005: Formal Political Theory I Lecture 11 Instructor: Tommaso Nannicini Teaching Fellow: Jeremy Bowles Harvard University November 9, 2017 Overview * Today s lecture Dynamic games of incomplete
More informationOligopoly Theory. This might be revision in parts, but (if so) it is good stu to be reminded of...
This might be revision in parts, but (if so) it is good stu to be reminded of... John Asker Econ 170 Industrial Organization January 23, 2017 1 / 1 We will cover the following topics: with Sequential Moves
More informationEcon 618: Correlated Equilibrium
Econ 618: Correlated Equilibrium Sunanda Roy 1 Basic Concept of a Correlated Equilibrium MSNE assumes players use a random device privately and independently, that tells them which strategy to choose for
More informationCS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 12: Approximate Mechanism Design in Multi-Parameter Bayesian Settings
CS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 12: Approximate Mechanism Design in Multi-Parameter Bayesian Settings Instructor: Shaddin Dughmi Administrivia HW1 graded, solutions on website
More informationVickrey Auction VCG Characterization. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design
Algorithmic Game Theory Vickrey Auction Vickrey-Clarke-Groves Mechanisms Characterization of IC Mechanisms Mechanisms with Money Player preferences are quantifiable. Common currency enables utility transfer
More informationAPPLIED MECHANISM DESIGN FOR SOCIAL GOOD
APPLIED MECHANISM DESIGN FOR SOCIAL GOOD JOHN P DICKERSON Lecture #3 09/06/2016 CMSC828M Tuesdays & Thursdays 12:30pm 1:45pm REMINDER: SEND ME TOP 3 PRESENTATION PREFERENCES! I LL POST THE SCHEDULE TODAY
More information