Trading in Networks: I. Model Prof. Michael Kearns Networked Life MKSE 112 Fall 2012.

Slides:



Advertisements
Similar presentations
Price Of Anarchy: Routing
Advertisements

Networked Trade: Theory and Behavior Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.
Competitive Contagion Scoring Review Let P be the population distribution of seed choices on graph G For every seed set s that appears with non-zero probability.
Federal Communications Commission NSMA Spectrum Management Conference May 20, 2008 Market Based Forces and the Radio Spectrum By Mark Bykowsky, Kenneth.
A Network Formation Game for Bipartite Exchange Economies [Even-Dar, K. & Suri]
Behavioral Finance Shleifer on Noise Jan 29, 2015 Behavioral Finance Economics 437.
Tutorial 6 of CSCI2110 Bipartite Matching Tutor: Zhou Hong ( 周宏 )
Models of Network Formation Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.
6.896: Topics in Algorithmic Game Theory Lecture 14 Constantinos Daskalakis.
Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2014 Prof. Michael Kearns.
Interdependent Security Games and Networks Networked Life CSE 112 Spring 2006 Prof. Michael Kearns.
Networked Games: Coloring, Consensus and Voting Prof. Michael Kearns Networked Life MKSE 112 Fall 2012.
Economic Exchange on Networks Networked Life CSE 112 Spring 2007 Prof. Michael Kearns.
Strategic Models of Network Formation Networked Life CIS 112 Spring 2010 Prof. Michael Kearns.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
On Balanced Signed Graphs and Consistent Marked Graphs Fred S. Roberts DIMACS, Rutgers University Piscataway, NJ, USA.
Game Theory: Whirlwind Review Matrix (normal form) games, mixed strategies, Nash equil. –the basic objects of vanilla game theory –the power of private.
Experiments in Behavioral Network Science: Brief Coloring and Consensus Postmortem (Revised and Updated 4/2/07) Networked Life CSE 112 Spring 2007 Michael.
Trading in Networks Networked Life CIS 112 Spring 2010 Prof. Michael Kearns.
Introduction to Game Theory and Behavior Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.
Economic Models of Network Formation Networked Life CIS 112 Spring 2008 Prof. Michael Kearns.
Exchange Economies and Networks Networked Life CSE 112 Spring 2005 Prof. Michael Kearns.
Economic Models of Network Formation Networked Life CSE 112 Spring 2006 Prof. Michael Kearns.
Experiments in Behavioral Network Science 2: Kings and Pawns Networked Life CSE 112 Spring 2007 Michael Kearns & Stephen Judd.
Behavioral Graph Coloring Michael Kearns Computer and Information Science University of Pennsylvania Collaborators: Nick Montfort Siddharth Suri Special.
Learning dynamics,genetic algorithms,and corporate takeovers Thomas H. Noe,Lynn Pi.
Interactions in Networks In part, based on Chapters 10 and 11 of D. Easly, J. Kleinberg, Networks, Crowds, and Markets, Cambridge University press.
Computer Science, Economics, and the Effects of Network Structure
Contagion in Networks Networked Life NETS 112 Fall 2013 Prof. Michael Kearns.
Introduction to Game Theory and Strategic Behavior Networked Life MKSE 112 Fall 2012 Prof. Michael Kearns.
Presented by Qian Zou.  The purpose of conducting the experiments.  The methodology for the experiments.  The Experimental Design : Cohesion Experiments.
1 2. Independence and Bernoulli Trials Independence: Events A and B are independent if It is easy to show that A, B independent implies are all independent.
Some Analysis of Coloring Experiments and Intro to Competitive Contagion Assignment Prof. Michael Kearns Networked Life NETS 112 Fall 2014.
Lecture 7 Course Summary The tools of strategy provide guiding principles that that should help determine the extent and nature of your professional interactions.
Data Analysis Econ 176, Fall Populations When we run an experiment, we are always measuring an outcome, x. We say that an outcome belongs to some.
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
Planar Graphs Graph Coloring
Lecture 1 on Bargaining Setting the Agenda This lecture focuses on the well known problem of how to split the gains from trade or, more generally, mutual.
Matching Lecture 19: Nov 23.
Networked Games: Coloring, Consensus and Voting Prof. Michael Kearns Networked Life NETS 112 Fall 2013.
13-1 Economics: Theory Through Applications This work is licensed under the Creative Commons Attribution-Noncommercial-Share Alike 3.0 Unported.
How Do “Real” Networks Look?
Economics 2010 Lecture 9 Markets and efficiency. Competition and Efficiency  The Key Question  Allocative Efficiency  The Invisible Hand  Obstacles.
Navigation in Networks, Revisited Networked Life MKSE 112 Fall 2012 Prof. Michael Kearns.
1 CAPM & APT. 2 Capital Market Theory: An Overview u Capital market theory extends portfolio theory and develops a model for pricing all risky assets.
OVERCOMING COORDINATION FAILURE THROUGH NEIGHBORHOOD CHOICE ~AN EXPERIMENTAL STUDY~ Maastricht University Arno Riedl Ingrid M.T. Rohde Martin Strobel.
Contagion in Networks Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
Networked Games: Coloring, Consensus and Voting
Markowitz Risk - Return Optimization
Networked Games: Coloring, Consensus and Voting
Trading in Networks: I. Model
Structural Properties of Networks: Introduction
How Do “Real” Networks Look?
Networked Life NETS 112 Fall 2018 Prof. Michael Kearns
How Do “Real” Networks Look?
How Do “Real” Networks Look?
Networked Games: Coloring, Consensus and Voting
Models of Network Formation
Networked Games: Coloring, Consensus and Voting
Models of Network Formation
Networked Life NETS 112 Fall 2017 Prof. Michael Kearns
Models of Network Formation
How Do “Real” Networks Look?
Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
Networked Life NETS 112 Fall 2016 Prof. Michael Kearns
Models of Network Formation
Introduction to (Networked) Game Theory
Production Possibilities Schedules
Network Models Michael Goodrich Some slides adapted from:
Networked Life NETS 112 Fall 2019 Prof. Michael Kearns
Presentation transcript:

Trading in Networks: I. Model Prof. Michael Kearns Networked Life MKSE 112 Fall 2012

Roadmap Networked trading motivation A simple model and its equilibrium A detailed example

Networked Games vs. Trading Models and experiments so far (coloring, consensus, biased voting): –simple coordination games –extremely simple actions (pick a color) –“trivial” equilibrium theories (“good” equilibrium or “trapped” players) –no equilibrium predictions about network structure and individual wealth Networked trading: –a “financial” game –complex action space (set of trades with neighbors) –nontrivial equilibrium theory –detailed predictions about network structure and individual wealth

Networked Trading: Motivation Settings where there are restrictions on who can trade with whom International trade: restrictions, embargos and boycotts Financial markets: some transactions are forbidden –e.g. trades between brokerage and proprietary trading in investment banks Geographic constraints: must find a local housecleaning service Natural to model by a network: –vertices representing trading parties –presence of edge between u and v: trading permitted between parties –absence of edge: trading forbidden

A Simple Model of Networked Trading Imagine a world with only two goods or commodities for trading –let’s call them Milk and Wheat Two types of traders: –Milk traders: start game with 1 unit (fully divisible) of Milk, but only value Wheat –Wheat traders: start game with 1 unit of Wheat, but only value Milk –trader’s payoff = amount of the “other” good they obtain through trades –“mutual interest in trade” –equal number of each type  same total amount of Milk and Wheat Only consider bipartite networks: –all edges connect a Milk trader to a Wheat trader –can only trade with your network neighbors! –all trades are irrevocable –no resale or arbitrage allowed

Equilibrium Concept Imagine we assigned a price or exchange rate to each vertex/trader –e.g. “I offer my 1 unit of Milk for 1.7 units of Wheat” –e.g. “I offer my 1 unit of Wheat for 0.8 units of Milk” –note: “market” sets the prices, not traders (“invisible hand”) –unlike a traditional game --- traders just react to prices Equilibrium = set of prices + trades such that: –1. market clears: everyone trades away their initial allocation –2. rationality (best responses): a trader only trades with best prices in neighborhood –e.g. if a Milk trader’s 4 neighbors offer 0.5, 1.0, 1.5, 1.5 units Wheat, they can trade only with those offering 1.5 –note: set of trades must ensure supply = demand at every vertex Simplest example: complete bipartite network –every pair of Milk and Wheat traders connected by an edge –equilibrium prices: everyone offers their initial 1 unit for 1 unit of the other good –equilibrium trades: pair each trader with a unique partner of other type –market clears: everyone engages in 1-for-1 trade with their partner –rationality: all prices are equal, so everyone trading with best neighborhood prices

22/3 1/2 3/2 equilibrium prices as shown (amount of the other good demanded) equilibrium trades: a: sends ½ unit each to w and y, gets 1 from each b: sends 1 unit to x, gets 2/3 from x c: sends ½ unit each to x and z, gets 1/3 from each d: sends 1 unit to z, gets 2/3 from z equilibrium check, blue side: w: traded with a, sent 1 unit x: traded with b and c, sent 1 unit y: traded with a, sent 1 unit z: traded with c and d, sent 1 unit adcb wxyz A More Complex Example

22/3 1/2 3/2 How did I figure this out? Not easy in general Some edges unused by equilibrium Trader wealth = equilibrium price at their vertex If two traders trade, their wealths are reciprocal (w and 1/w) Equilibrium prices (wealths) are always unique Network structure led to variation in wealth adcb wxyz Remarks

Suppose we add the single green edge Now equilibrium has no wealth variation! adcb wxyz

Summary (Relatively) simple networked trading model Equilibrium = prices + trades such that market clears, traders rational Some networks don’t have wealth variation at equilibrium, some do Next: What is the general relationship between structure and prices?

Trading in Networks: II. Network Structure and Equilibrium Networked Life Prof. Michael Kearns

Roadmap Perfect matchings and equilibrium equality Characterizing wealth inequality at equilibrium Economic fairness of Erdös-Renyi and Preferential Attachment

Trading Model Review Bipartite network, equal number of Milk and Wheat traders Each type values only the other good Equilibrium = prices + trades such that market clears, traders rational

Perfect Matchings …… …… Red/Milk Traders Blue/Wheat Traders A pairing of reds and blues so everyone has exactly one partner So really a subset of the edges with each vertex in exactly one edge Some networks may have many different perfect matchings Some networks may have no perfect matchings

Perfect Matchings …… …… Red/Milk Traders Blue/Wheat Traders A pairing of reds and blues so everyone has exactly one partner So really a subset of the edges with each vertex in exactly one edge Some networks may have many different perfect matchings Some networks may have no perfect matchings

22/3 1/2 3/2 adcb wxyz Examples adcb wxyz Has no perfect matchingHas a perfect matching

Perfect Matchings and Equality Theorem: There will be no wealth variation at equilibrium (all exchange rates = 1) if and only if the bipartite trading network contains a perfect matching. Characterizes sufficient “trading opportunities” for fairness What if there is no perfect matching?

Neighbor Sets …… …… Let S be any set of traders on one side Let N(S) be the set of traders on the other side connected to any trader in S; these are the only trading partners for S collectively Intuition: if N(S) is much smaller than S, S may be in trouble S are “captives” of N(S) Note: If there is a perfect matching, N(S) always at least as large as S

Characterizing Inequality For any set S, let v(S) denote the ratio (size of S)/(size of N(S)) Theorem: If there is a set S such that v(S) > 1, then at equilibrium the traders in S will have wealth at most 1/v(S), and the traders in N(S) will have wealth at least v(S). Example: v(S) = 10/3  S gets at most 3/10, N(S) at least 10/3 Greatest inequality: find S maximizing v(S) Can iterate to find all equilibrium wealths Corollary: adding edges can only reduce inequality Network structure completely determines equilibrium wealths Note: trader/vertex degree not directly related to equilibrium wealth

22/3 1/2 3/2 adcb wxyz Examples Revisited adcb wxyz Has no perfect matchingHas a perfect matching

Inequality in Formation Models Bipartite version of Erdös-Renyi: even at low edge density, very likely to have a perfect matching  no wealth variation at equilibrium Bipartite version of Preferential Attachment: wealth variation will grow rapidly with population size Erdös-Renyi generates economically “fairer” networks

Summary Ratios v(S) completely characterize equilibrium Determined entirely by network structure More subtle and global than trader degrees Next: comparing equilibrium predictions with human behavior

Trading in Networks: III. Behavioral Experiments Networked Life Prof. Michael Kearns

Roadmap Experimental framework and trading mechanism/interface Networks used in the experiments Visualization of actual experiments Results and comparison to equilibrium theory predictions

Equilibrium Theory Review Equilibrium prices/wealths entirely determined by network structure Largest/smallest wealths determined by largest ratios: v(S) = (size of S)/(size of N(S)) N(S) “winners”, S “losers” Network has a perfect matching: all wealths = 1

Experimental Framework Same framework as coloring, consensus and biased voting experiments 36 simultaneous human subjects in lab of networked workstations In each experiment, subjects play our trading model on varying networks In equilibrium theory, prices are magically given (“invisible hand”) In experiments, need to provide a mechanism for price discovery Experiments used simple limit order trading with neighbors –networked version of standard financial/equity market mechanism Each player starts with 10 fully divisible units of Milk or Wheat –payments proportional to the amount of the other good obtained

Pairs2-Cycle4-Cycle ClanClan + 5%Clan + 10% Erdos-Renyi, p=0.2E-R, p=0.4Pref. Att. TreePref. Att. Dense

Collective Performance and Structure overall behavioral performance is strong structure matters; many (but not all) pairs distinguished overall mean ~ 0.88 fraction of possible wealth realized network structure

Equilibrium vs. Behavior correlation ~ -0.8 (p < 0.001)correlation ~ 0.96 (p < 0.001) greater equilibrium variation  behavioral performance degrades greater equilibrium variation  greater behavioral variation equilibrium variance behavioral wealth behavioral variance

Best Model for Behavioral Wealths? The equilibrium wealth predictions are better than: –degree distribution and other centrality/importance measures –uniform distribution Best behavioral prediction: 0.75(equilibrium prediction) (uniform) “Networked inequality aversion” (recall Ultimatum Game)

Summary Trading model most sophisticated “rational dynamics” we’ve studied Has a detailed equilibrium theory based entirely on network structure Equilibrium theory matches human behavior pretty well