Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Polynomial Time Algorithms For Market Equilibria.

Slides:



Advertisements
Similar presentations
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Markets and the Primal-Dual Paradigm.
Advertisements

6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 16.
Algorithmic Game Theory and Internet Computing Amin Saberi Algorithmic Game Theory and Networked Systems.
CPSC 455/555 Combinatorial Auctions, Continued… Shaili Jain September 29, 2011.
A Lemke-Type Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities Ruta Mehta Indian Institute of Technology – Bombay Joint.
Combinatorial Algorithms for Market Equilibria Vijay V. Vazirani.
6.896: Topics in Algorithmic Game Theory Lecture 14 Constantinos Daskalakis.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Combinatorial Approximation Algorithms for Convex Programs?!
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Combinatorial Algorithms for Convex Programs (Capturing Market Equilibria.
Auction Algorithms for Market Equilibrium Rahul Garg IBM India Research Sanjiv Kapoor Illionis Institute of Technology.
General Equilibrium Theory
Algorithmic Game Theory and Internet Computing
6.896: Topics in Algorithmic Game Theory Lecture 15 Constantinos Daskalakis.
Applied general equilibrium models: Theoretical part M.A. Keyzer and C.F.A. van Wesenbeeck.
Principles of Microeconomics & Principles of Macroeconomics: Ch.7 First Canadian Edition Overview u Welfare Economics u Consumer Surplus u Producer Surplus.
6.853: Topics in Algorithmic Game Theory
1 An Analysis for Troubled Assets Reverse Auction Saeed Alaei (University of Maryland-College Park) Azarakhsh Malekian (University of Maryland-College.
Dynamic Spectrum Management: Optimization, game and equilibrium Tom Luo (Yinyu Ye) December 18, WINE 2008.
Demand, Supply and Equilibrium
Exchanges = markets with many buyers and many sellers Let’s consider a 1-item 1-unit exchange first.
Algorithmic Game Theory and Internet Computing Amin Saberi Stanford University Computation of Competitive Equilibria.
Robinson Crusoe model 1 consumer & 1 producer & 2 goods & 1 factor: –two price-taking economic agents –two goods: the labor (or leisure x 1 ) of the consumer.
Arbitrage in Combinatorial Exchanges Andrew Gilpin and Tuomas Sandholm Carnegie Mellon University Computer Science Department.
Harcourt Brace & Company Chapter 7 Consumers, Producers and the Efficiency of Markets.
Vijay V. Vazirani Georgia Tech A Postmortem of the Last Decade and Some Directions for the Future.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Algorithms for the Linear Case, and Beyond …
Supply and Demand Chapter 3 Copyright © 2010 by the McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Computational complexity of competitive equilibria in exchange markets Katarína Cechlárová P. J. Šafárik University Košice, Slovakia Budapest, Summer school,
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Markets and the Primal-Dual Paradigm.
General Equilibrium Theory A General Economy m consumers n producers (n goods) Resources m X n demand equations n supply equations Prices A Pure Exchange.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech New Market Models and Algorithms.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani New Market Models and Algorithms.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Extending General Equilibrium Theory to the Digital Economy.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Polynomial Time Algorithms For Market Equilibria.
1 Online algorithms Typically when we solve problems and design algorithms we assume that we know all the data a priori. However in many practical situations.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Combinatorial Algorithms for Convex Programs (Capturing Market Equilibria.
Introduction to Matching Theory E. Maskin Jerusalem Summer School in Economic Theory June 2014.
6.896: Topics in Algorithmic Game Theory Lecture 13b Constantinos Daskalakis.
Approximating Market Equilibria Kamal Jain, Microsoft Research Mohammad Mahdian, MIT Amin Saberi, Georgia Tech.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Market Equilibrium: The Quest for the “Right” Model.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Joint work with Jugal Garg & Ruta Mehta Dichotomies in Equilibrium Computation: Market.
University of Pittsburgh CS 3150 Page 1 out of 20 Market Equilibrium via a Primal-Dual-Type Algorithm Written By Nikhil R. Devanur, Christos H. Papadimitriou,
Comp 553: Algorithmic Game Theory Fall 2014 Yang Cai Lecture 23.
Intermediate Microeconomic Theory
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Primal-Dual Algorithms for Rational Convex Programs II: Dealing with Infeasibility.
2) Combinatorial Algorithms for Traditional Market Models Vijay V. Vazirani.
Levy, Solomon and Levy's Microscopic Simulation of Financial Markets points us towards the future of financial economics." Harry M. Markowitz, Nobel Laureate.
General competitive equilibrium. General equilibrium: How does an idealized private ownership competitive economy works ?  l goods (indexed by j ) 
UNIT 7 PAGES OVERVIEW OF THE US ECONOMY. OVERVIEW OF BASIC ECONOMIC SYSTEMS Traditional : based on customs and traditions Command : government.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani 3) New Market Models, Resource Allocation Markets.
A P.O. Is a C.E. © 1998 by Peter Berck. What Is It Good? §Sum of surplus and profits allows for policies that make income less evenly distributed. §A.
Algorithmic Game Theory and Internet Computing
Qing Cui 2014/09/30.  Introduction of matching theory  Stable Marriage, extensions and maximum-weighted stable matching problem. By Prof. Chen
How Intractable is the ‘‘Invisible Hand’’: Polynomial Time Algorithms for Market Equilibria Vijay V. Vazirani Georgia Tech.
General Equilibrium (cont)
Algorithmic Game Theory and Internet Computing
Market Equilibrium Ruta Mehta.
General Equilibrium (cont)
Comp/Math 553: Algorithmic Game Theory Lecture 09
Algorithmic Game Theory and Internet Computing
General Equilibrium (cont)
Vijay V. Vazirani Georgia Tech
General Equilibrium (cont)
Algorithmic Game Theory and Internet Computing
General Equilibrium (cont)
General Equilibrium (cont)
Algorithmic Game Theory and Internet Computing
L12 General Equilibrium.
L12 General Equilibrium.
L13 General Equilibrium.
Presentation transcript:

Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Polynomial Time Algorithms For Market Equilibria

1) History and Basic Notions

Markets

Stock Markets

Internet

Revolution in definition of markets

Revolution in definition of markets New markets defined by  Google  Amazon  Yahoo!  Ebay

Revolution in definition of markets Massive computational power available

Revolution in definition of markets Massive computational power available Important to find good models and algorithms for these markets

Adwords Market Created by search engine companies  Google  Yahoo!  MSN Multi-billion dollar market Totally revolutionized advertising, especially by small companies.

New algorithmic and game-theoretic questions Queries are coming on-line. Instantaneously decide which bidder gets it. Monika Henzinger, 2004: Find on-line alg. to maximize Google’s revenue.

New algorithmic and game-theoretic questions Queries are coming on-line. Instantaneously decide which bidder gets it. Monika Henzinger, 2004: Find on-line alg. to maximize Google’s revenue. Mehta, Saberi, Vazirani & Vazirani, 2005: 1-1/e algorithm. Optimal.

How will this market evolve??

The study of market equilibria has occupied center stage within Mathematical Economics for over a century.

The study of market equilibria has occupied center stage within Mathematical Economics for over a century. This talk: Historical perspective & key notions from this theory.

2). Algorithmic Game Theory Combinatorial algorithms for traditional market models

3). New Market Models Resource Allocation Model of Kelly, 1997

3). New Market Models Resource Allocation Model of Kelly, 1997 For mathematically modeling TCP congestion control Highly successful theory

A Capitalistic Economy Depends crucially on pricing mechanisms to ensure: Stability Efficiency Fairness

Adam Smith The Wealth of Nations 2 volumes, 1776.

Adam Smith The Wealth of Nations 2 volumes, ‘invisible hand’ of the market

Supply-demand curves

Leon Walras, 1874 Pioneered general equilibrium theory

Irving Fisher, 1891 First fundamental market model

Fisher’s Model, 1891 milk cheese wine bread ¢ $$$$$$$$$ $ $$$$ People want to maximize happiness – assume linear utilities. Find prices s.t. market clears

Fisher’s Model n buyers, with specified money, m(i) for buyer i k goods (unit amount of each good) Linear utilities: is utility derived by i on obtaining one unit of j Total utility of i,

Fisher’s Model n buyers, with specified money, m(i) k goods (each unit amount, w.l.o.g.) Linear utilities: is utility derived by i on obtaining one unit of j Total utility of i, Find prices s.t. market clears, i.e., all goods sold, all money spent.

Arrow-Debreu Model, 1954 Exchange Economy Second fundamental market model Celebrated theorem in Mathematical Economics

Kenneth Arrow Nobel Prize, 1972

Gerard Debreu Nobel Prize, 1983

Arrow-Debreu Model n agents, k goods

Arrow-Debreu Model n agents, k goods Each agent has: initial endowment of goods, & a utility function

Arrow-Debreu Model n agents, k goods Each agent has: initial endowment of goods, & a utility function Find market clearing prices, i.e., prices s.t. if  Each agent sells all her goods  Buys optimal bundle using this money  No surplus or deficiency of any good

Utility function of agent i Continuous, monotonic and strictly concave For any given prices and money m, there is a unique utility maximizing bundle for agent i.

Agents: Buyers/sellers Arrow-Debreu Model

Initial endowment of goods Agents Goods

Agents Prices Goods = $25 = $15 = $10

Incomes Goods Agents =$25 =$15 =$10 $50 $40 $60 $40 Prices

Goods Agents Maximize utility $50 $40 $60 $40 =$25 =$15 =$10 Prices

Find prices s.t. market clears Goods Agents $50 $40 $60 $40 =$25 =$15 =$10 Prices Maximize utility

Observe: If p is market clearing prices, then so is any scaling of p Assume w.l.o.g. that sum of prices of k goods is 1. k-1 dimensional unit simplex

Arrow-Debreu Theorem For continuous, monotonic, strictly concave utility functions, market clearing prices exist.

Proof Uses Kakutani’s Fixed Point Theorem.  Deep theorem in topology

Proof Uses Kakutani’s Fixed Point Theorem.  Deep theorem in topology Will illustrate main idea via Brouwer’s Fixed Point Theorem (buggy proof!!)

Brouwer’s Fixed Point Theorem Let be a non-empty, compact, convex set Continuous function Then

Brouwer’s Fixed Point Theorem

Idea of proof Will define continuous function If p is not market clearing, f(p) tries to ‘correct’ this. Therefore fixed points of f must be equilibrium prices.

Use Brouwer’s Theorem

When is p an equilibrium price? s(j): total supply of good j. B(i): unique optimal bundle which agent i wants to buy after selling her initial endowment at prices p. d(j): total demand of good j.

When is p an equilibrium price? s(j): total supply of good j. B(i): unique optimal bundle which agent i wants to buy after selling her initial endowment at prices p. d(j): total demand of good j. For each good j: s(j) = d(j).

What if p is not an equilibrium price? s(j) p(j) s(j) > d(j) => p(j) Also ensure

Let S(j) S(j) > d(j) => N is s.t.

is a cts. fn. => is a cts. fn. of p => f is a cts. fn. of p

is a cts. fn. => is a cts. fn. of p => f is a cts. fn. of p By Brouwer’s Theorem, equilibrium prices exist.

is a cts. fn. => is a cts. fn. of p => f is a cts. fn. of p By Brouwer’s Theorem, equilibrium prices exist. q.e.d.!

Bug??

Boundaries of

B(i) is not defined at boundaries!!

Kakutani’s Fixed Point Theorem convex, compact set non-empty, convex, upper hemi-continuous correspondence s.t.

Fisher reduces to Arrow-Debreu Fisher: n buyers, k goods AD: n+1 agents  first n have money, utility for goods  last agent has all goods, utility for money only.

Money