J. Laurent-Lucchetti (U. Bern) J. Leroux and B. Sinclair-Desgagné (HEC Montréal) Splitting an uncertain (natural) capital.

Slides:



Advertisements
Similar presentations
L5: Dynamic Portfolio Management1 Lecture 5: Dynamic Portfolio Management The following topics will be covered: Will risks be washed out over time? Solve.
Advertisements

M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 3.1.Dynamic Games of Complete but Imperfect Information Lecture
Price Of Anarchy: Routing
Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
1 Strategic choice of financing systems in regulated and interconnected industries Anna BassaniniJerome Pouyet Rome & IDEICREST-LEI & CERAS-ENPC
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.5.Repeated Games Lecture
Choices Involving Risk
EC941 - Game Theory Lecture 7 Prof. Francesco Squintani
Nash Equilibria By Kallen Schwark 6/11/13 Fancy graphs make everything look more official!
Negotiation A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
17. (A very brief) Introduction to game theory Varian, Chapters 28, 29.
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
Decision-Making under Uncertainty – Part I Topic 4.
Ecs289m Spring, 2008 Non-cooperative Games S. Felix Wu Computer Science Department University of California, Davis
Strategic Decisions Making in Oligopoly Markets
Chapter 12 Choices Involving Strategy McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All Rights Reserved.
Intro to Game Theory Revisiting the territory we have covered.
1 “ Pumpkin pies and public goods: The raffle fundraising strategy ” BRIAN DUNCAN (2002) Sandra Orozco Contest and Tournaments November, 2007.
Uncertainty and Consumer Behavior
BEE3049 Behaviour, Decisions and Markets Miguel A. Fonseca.
Static Games and Cournot Competition
Selfish Caching in Distributed Systems: A Game-Theoretic Analysis By Byung-Gon Chun et al. UC Berkeley PODC’04.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
Static Games of Complete Information: Subgame Perfection
Renegotiation Design with Unverifiable Info Dylan B. Minor.
Distributed Rational Decision Making Sections By Tibor Moldovan.
Load Balancing, Multicast routing, Price of Anarchy and Strong Equilibrium Computational game theory Spring 2008 Michal Feldman.
UNIT III: COMPETITIVE STRATEGY Monopoly Oligopoly Strategic Behavior 7/21.
Self Enforcing International Environmental Agreements Barrett 1994 Oxford Economic Papers.
EC941 - Game Theory Francesco Squintani Lecture 3 1.
UNIT II: The Basic Theory Zero-sum Games Nonzero-sum Games Nash Equilibrium: Properties and Problems Bargaining Games Bargaining and Negotiation Review.
© 2009 Institute of Information Management National Chiao Tung University Lecture Notes II-2 Dynamic Games of Complete Information Extensive Form Representation.
1 EC9B6 Voting and Communication Lecture 1 Prof. Francesco Squintani
NOBEL WP Szept Stockholm Game Theory in Inter-domain Routing LÓJA Krisztina - SZIGETI János - CINKLER Tibor BME TMIT Budapest,
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
Bargaining with uncertain commitment: An agreement theorem
Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Optimizing Scrip Systems: Efficiency, Crashes, Hoarders, and Altruists By Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern Presentation by Avner May 12/10/08.
1 Efficiency and Nash Equilibria in a Scrip System for P2P Networks Eric J. Friedman Joseph Y. Halpern Ian Kash.
Intermediate Microeconomics
Keeping up with the Joneses, reference dependence, and equilibrium indeterminacy FUR XII conference, LUISS, Roma, 23 June 2006 Livio Stracca European Central.
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
A Game Approach for Multi-Channel Allocation in Multi-Hop Wireless Networks Lin Gao, Xinbing Wang Dept. of Electronic Engineering Shanghai Jiao Tong University.
How tough should you be Inflation targeting, fiscal feedbacks, and multiple equilibria Alexandre Schwartsman Unibanco.
International Environmental Agreements with Uncertain Environmental Damage and Learning Michèle Breton, HEC Montréal Lucia Sbragia, Durham University Game.
Decision Making Under Uncertainty and Risk 1 By Isuru Manawadu B.Sc in Accounting Sp. (USJP), ACA, AFM
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
Introduction to Game Theory application to networks Joy Ghosh CSE 716, 25 th April, 2003.
Chapter 5 Uncertainty and Consumer Behavior. ©2005 Pearson Education, Inc.Chapter 52 Q: Value of Stock Investment in offshore drilling exploration: Two.
Chapter 5 Choice Under Uncertainty. Chapter 5Slide 2 Topics to be Discussed Describing Risk Preferences Toward Risk Reducing Risk The Demand for Risky.
A Study of Central Auction Based Wholesale Electricity Markets S. Ceppi and N. Gatti.
Is employee ownership so senseless? Aubert N. Grand B. Lapied A. Rousseau P.
Complexity of Determining Nonemptiness of the Core Vincent Conitzer, Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Equilibria in Network Games: At the Edge of Analytics and Complexity Rachel Kranton Duke University Research Issues at the Interface of Computer Science.
Decision theory under uncertainty
Explicit versus Implicit Contracts for Dividing the Benefits of Cooperation Marco Casari and Timothy Cason Purdue University.
Uncertainty and Consumer Behavior Chapter 5. Uncertainty and Consumer Behavior 1.In order to compare the riskiness of alternative choices, we need to.
Econ 3010: Intermediate Price Theory (Microeconomics) Professor Dickinson Appalachian State University Lecture Notes Outline— Section 3.
Intermediate Microeconomics Game Theory. So far we have only studied situations that were not “strategic”. The optimal behavior of any given individual.
Rossella Bargiacchi Contact:
1 Nash Demand Game Nash Program (non cooperative games) Demand Game S Topics 3.
Day 9 GAME THEORY. 3 Solution Methods for Non-Zero Sum Games Dominant Strategy Iterated Dominant Strategy Nash Equilibrium NON- ZERO SUM GAMES HOW TO.
Risk Aversion and Optimal Reserve Prices in First and Second-Price Auctions Audrey Hu University of Amsterdam Stephen A. Matthews University of Pennsylvania.
Game theory Chapter 28 and 29
A useful reduction (SAT -> game)
FAMILY BARGAINING: A STACKELBERG APPROACH Joaquín Andaluz, Miriam Marcén and JoséAlbertoMolina University of Zaragoza.
Game theory Chapter 28 and 29
Strategic Decision Making in Oligopoly Markets
Unit 4 SOCIAL INTERACTIONS.
Presentation transcript:

J. Laurent-Lucchetti (U. Bern) J. Leroux and B. Sinclair-Desgagné (HEC Montréal) Splitting an uncertain (natural) capital

Introduction Topic: Strategic behavior under the threat of dramatic events when experts disagree. Issues of climate change: o shutdown of thermohaline circulation, o permafrost meltdown… Other issues: o epidemiological outbreaks, o resistance to antibiotics…

Introduction (cont.) How are agents expected to behave? Can risk aversion alone help avoid dramatic outcomes? Is there a role for coordination devices (i.e., Kyoto protocol, COP15, etc.) ? What are the implications for precautionary policies?

Related Literature Decision theory, Nash demand game, commons problem. Bramoullé &Treich (JEEA, 2009): global public bad context. o Emissions are always lower under uncertainty and welfare may be higher. o Cooperation is less likely under uncertainty (gains from cooperation are lower). Nkuiya (2011), Morgan & Prieur (2011). Contribution game to discrete public good: Nitzan and Romano, JPubE, 1990; McBride, JPubE, 2006; Barbieri and Malueg, 2009; Rapoport (many); Dragicevic and Engle-Warnick, 2011.

Contribution Introduce a strong discontinuity in the (uncertain) available amount of a common resource. In sharp contrast with previous results, introducing uncertainty does not always lead to lower consumption, even if all agents are risk averse. “Dangerous" equilibria may exist, where agents behave as if ignoring the possibility of a bad outcome, even if all agents are risk averse.

Contribution (cont.) Cooperation can be beneficial to all agents. Under mild conditions, a move from an dangerous eq. to a “cautious” eq. is a Pareto improvement. Support for precautionary policies and coordination devices.

The Simple Model

n agents simultaneously consume a common resource. The amount of resource available, r, is uncertain: r = Each agent i chooses a consumption level: x i ≥ 0. If ∑x i ≤ r, each agent receives x i. Otherwise, they receive nothing. Simultaneous “Divide the dollar” game with uncertainty on “the dollar”. 1 with prob. p<1 a < 1 with prob. (1-p)

The Simple Model (cont.) Utility of an agent i: u i (x i ). u i ’s are concave (risk aversion and risk neutrality) non- decreasing and u i (0)=0. Expected payoff of an agent i: v i (x i, X -i )= u i (x i ) Ι(X≤a)+p u i (x i ) Ι(a<X≤1) where X = ∑x i = x i +X -i

Best responses For each agent i: If X -i > a: o If X -i < 1: demand x i = 1-X -i o If X -i ≥ 1 : demand x i = 0 or anything higher. If X -i ≤ a: o Demand x i = a-X -i if u i (a-X -i ) ≥ pu i (1-X -i ); o Demand x i = 1-X -i otherwise.

Equilibria Three types of equilibria: “Cautious” equilibria: X* = a, certain outcome. “Dangerous” equilibria: X*=1, agents ignore the possibility of a shortage. “Crazy” equilibria: X* > 1, coordination problem.

Cut-offs Proposition 1: Each risk-averse and risk-neutral agent i has a unique cut- off, X i, such that: u i (a-X -i )> p*u i (1-X -i ) if X -i < X i u i (a-X -i ) X i

x2x2 x1x1 X1X1 Best response for 1: a-x 2 Best response for 1: 1-x 2 Best responses for agent 1 1 a 1 a

x2x2 x1x1 Best responses for agent 2 1 a 1 a X2X2 Best response for 2: 1-x 1 Best response for 2: a-x 1

x2x2 x1x1 X2X2 X1X1 Best response for 2: 1-x 1 Best response for 2: a-x 1 Best response for 1: a-x 2 Best response for 1: 1-x 2 Dangerous equilibria Cautious equilibria 1 a 1 a Crazy equilibria 45˚

Equilibria Proposition 2: The game admits at least one non-crazy equilibrium: If ∑ X i < (n-1)a, no cautious equilibrium exists; If ∑ X i > n-1, no dangerous equilibrium exists; If (n-1) a < ∑ X i < n-1, both types of eqs coexist.

Comparative statics As p increases, X i decreases: o the set of dangerous eqs expands o while the set of cautious eqs shrinks. As a increases, X i increases: o the set of dangerous eqs shrinks. o the effect on the set of cautious eqs is ambiguous. If agents become more risk averse: o the set of cautious eqs expands o the set of dangerous eqs shrinks.

Coordinated action Strong Nash equilibria: An equilibrium x is strong if, for any coalition T, and any x’ such that x’ N\T = x N\T : v i (x’) > v i (x) for any i in T v j (x’) < v j (x) for some j in T Coalition-proof equilibria: only self-enforcing deviations.

Coordinated action Theorem 1: All cautious Nash equilibria are strong.

Coordinated action Theorem 2: A dangerous equilibrium, x, is coalition-proof if there does not exist a cautious eq, x’, such that: with δ i ≥0 for all i in T. x’ i = x i – δ i for all i in T x’ i = x i for all i not in T

Coordinated action Corollaries: All cautious equilibria are Pareto efficient and Pareto- dominate many oblivious equilibria. Oblivious eqs are only vulnerable to deviations in which all coalition members reduce their demands The coordination problem can only be solved to the extent that all agents make a simultaneous effort. Remark: No crazy equilibrium is coalition-proof.

Extensions

Extension: multiple thresholds Set of thresholds: r = All cautious eqs are strong. A move from any risky eq. to a « more cautious » eq. is a Pareto improvement. a with prob. (p a ) b with prob. (p b ) … 1 with prob. (1-p a -p b …)

Extension: continuous distributions Uncertainty about threshold: F(r). F(r) is multimodal: experts disagree. v i (x i, X -i )= u i (x i )F(x i +X -i ≤r) If experts disagree sufficiently (« multimodal enough »): multiple equilibria, more and more risky. Any cautious eq. is strong and Pareto efficient. A cautious eq. Pareto dominates any eq. in which no agent consumes less.

Conclusion Simple demand game, introduces threshold effects with uncertainty on the size of the threshold. Cautious and dangerous eqs can coexist even if all are risk averse. Cautious eq. are Pareto efficient and dominates « most » dangerous eqs. Gains from coordinated action can be substantial.

Coexistence of equilibria Even if all agents are risk-averse, oblivious equilibria may exist: Ex: p=0.8, a=0.8, u 1 =u 2 = x ½ (0.4, 0.4) is a cautious eq.: o v i (0.4,0.4)= 0.63 > 0.62 = 0.8*0.6 ½ = v i (0.6,0.4) (0.5, 0.5) is an dangerous eq.: o v i (0.5,0.5)= 0.8*0.5 ½ = 0.56 > 0.54 = v i (0.3,0.5) (1.5, 1.5) is a crazy eq. (and many others) o v i = 0

Proof- Proposition 1 Proof: Define f i (X -i )= u i (a-X -i )- p*u i (1-X -i ). Clearly, f i (a)<0, and f’ i (X -i )=-u’ i (a-X -i ) + p*u’ i (1-X -i ) < 0 by concavity of u -i If f i (0)<0, X i = 0; If f i (0)>0, X i > 0.

Proof- Theorem 1 Sketch of proof by contradiction: For members of coalition T to be better off requires increased demands  outcome no longer certain. Consider an agent j Є T s.t. X’ -j >X -j. She can do no better than to demand 1-X’ -j. However: v j (1-X’ -j,X’ -j ) < v j (1-X -j,X -j ) ≤ v j (a-X -j,X -j ) because x is an equilibrium

Proof- Theorem 2 Sketch of proof: x’ exists  x not coalition-proof. For all i in T, u i (x’ i )≥ p u i (x’ i +1-a) = p u i (x i + ∑δ j ) ≥ p u i (x i ) for all i in T. Thus x’ constitutes a self-enforcing deviation from x.