Comp 553: Algorithmic Game Theory Fall 2014 Yang Cai Lecture 23.

Slides:



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

UTILITY MAXIMIZATION AND CHOICE
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 16.
Economic Simulations Using Mathematica Kota Minegishi.
Combinatorial Algorithms for Market Equilibria Vijay V. Vazirani.
6.896: Topics in Algorithmic Game Theory Lecture 14 Constantinos Daskalakis.
Chapter Thirty Production. Exchange Economies (revisited) u No production, only endowments, so no description of how resources are converted to consumables.
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.
Ch.7 The Capital Asset Pricing Model: Another View About Risk
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.
6.853: Topics in Algorithmic Game Theory
Chapter Twenty-Nine Exchange. u Two consumers, A and B. u Their endowments of goods 1 and 2 are u E.g. u The total quantities available and units of good.
Dynamic Spectrum Management: Optimization, game and equilibrium Tom Luo (Yinyu Ye) December 18, WINE 2008.
ECON6021 Microeconomic Analysis
Theory of Consumer Behavior
Chapter Nine Buying and Selling. Endowments u The list of resource units with which a consumer starts is his endowment. u A consumer’s endowment will.
Algorithmic Game Theory and Internet Computing Amin Saberi Stanford University Computation of Competitive Equilibria.
Chapter Nine Buying and Selling. u Trade involves exchange -- when something is bought something else must be sold. u What will be bought? What will be.
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.
Chapter 5: Theory of Consumer Behavior
1. The Market Economy Fall Outline A. Introduction: What is Efficiency? B. Supply and Demand (1 Market) C. Efficiency of Consumption (Many Markets)
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Markets and the Primal-Dual Paradigm.
CHAPTER 30 EXCHANGE.
Utility Maximization and Choice
Lecture # 2 Review Go over Homework Sets #1 & #2 Consumer Behavior APPLIED ECONOMICS FOR BUSINESS MANAGEMENT.
Module 12: Indifference Curves and Budget Constraints
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech New Market Models and Algorithms.
© 2010 W. W. Norton & Company, Inc. 9 Buying and Selling.
Chapter Nine Buying and Selling. u Trade involves exchange -- when something is bought something else must be sold. u What will be bought? What will be.
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.
Microeconomics Course E John Hey. Examinations Go to Read.
Microeconomics Corso E John Hey. Chapter 5 We know that the indifference curves of an individual are given by the preferences of that individual. We know.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Combinatorial Algorithms for Convex Programs (Capturing Market Equilibria.
Yang Cai Oct 08, An overview of today’s class Basic LP Formulation for Multiple Bidders Succinct LP: Reduced Form of an Auction The Structure of.
6.896: Topics in Algorithmic Game Theory Lecture 13b Constantinos Daskalakis.
AAEC 2305 Fundamentals of Ag Economics Chapter 5 Theory of Markets.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Polynomial Time Algorithms For Market Equilibria.
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.
1 Chapter 4 UTILITY MAXIMIZATION AND CHOICE Copyright ©2005 by South-Western, a division of Thomson Learning. All rights reserved.
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.
1 Endowments. 2 Buying and Selling Trade involves exchange -- when something is bought something else must be sold. What will be bought? What will be.
Demand and Behavior in Markets
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Copyright © 2008 Pearson Addison-Wesley. All rights reserved. Chapter 4 Consumer and Firm Behavior: The Work-Leisure Decision and Profit Maximization.
Lecture 2Hayek Hypothesis and Institution as a Variable "Markets as Economizers of Information: Experimental Examination of the ‘Hayek Hypothesis’," Economic.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani 3) New Market Models, Resource Allocation Markets.
© 2010 W. W. Norton & Company, Inc. 32 Production.
Chapter 32 Production. Exchange Economies (revisited) No production, only endowments, so no description of how resources are converted to consumables.
Algorithmic Game Theory and Internet Computing
Chapter 9 BUYING AND SELLING. 9.1 Net and Gross Demands Endowments : (  1,  2 )  how much of the two goods the consumer has before he enters the market.
1 Production. 2 Exchange Economies (revisited) No production, only endowments, so no description of how resources are converted to consumables. General.
How Intractable is the ‘‘Invisible Hand’’: Polynomial Time Algorithms for Market Equilibria Vijay V. Vazirani Georgia Tech.
Microeconomics 2 John Hey. Lecture 26: The Labour Market The supply of labour (consumer: leisure time/money trade-off). The demand for labour (theory.
Chapter 4 Consumer and Firm Behavior: The Work-Leisure Decision and Profit Maximization.
Theory of Capital Markets
Algorithmic Game Theory and Internet Computing
Theory of Consumer Behavior
Chapter 5.
Vijay V. Vazirani Georgia Tech
Chapter 33 Production.
Chapter 9 Buying and Selling.
Chapter 2. Simplex method
Presentation transcript:

Comp 553: Algorithmic Game Theory Fall 2014 Yang Cai Lecture 23

Exchange Market Model traders divisible goods trader i has: - endowment of goods non-negative reals amount of goods trader comes to the marketplace with consumption set for trader i specifies trader i’s utility for bundles of goods - utility function

Fisher Market Model can be obtained as a special case of an exchange market, when endowment vectors are parallel: in this case, relative incomes of the traders are independent of the prices. n traders with: k divisible goods owned by seller; money m i, and utility function u i seller has q j units of good j

Competitive (or Walrasian) Market Equilibrium total demand total supply Def: A price vector is called a competitive market equilibrium iff there exists a collection of optimal bundles of goods, for all traders i = 1,…, n, such that the total supply meets the total demand, i.e. [ For Fisher Markets: ]

Arrow-Debreu Theorem 1954 Theorem [Arrow-Debreu 1954]: Suppose Then a competitive market equilibrium exists. (i) is closed and convex (iii a) (iii b) (iii c) (ii) (all coordinates positive)

Fisher’s Model Suppose all endowment vectors are parallel… Equivalently, we can imagine the following situation:  relative incomes of the traders are independent of the prices. n traders, with specified money m i Arrow-Debreu Thm  (under the Arrow-Debreu conditions) there exist prices that the seller can assign on the goods so that the traders spend all their money to buy optimal bundles and supply meets demand k divisible goods owned by seller; seller has q j units of good j

Computation

Utility Functions CES (Constant Elasticity of Substitution) utility functions: linear utility form Leontief utility form Cobb-Douglas form

 Buyers’ optimization program (under price vector p): Fisher’s Model with CES utility functions  Global Constraint:

 The space of feasible allocations is: Eisenberg-Gale’s Convex Program e.g., choosing as a global objective function the sum of the traders’ utility functions won’t work…  But how do we aggregate the trader’s optimization problems into one global optimization problem?

Observation: The global optimization problem should not favor (or punish) Buyer i should he  Eisenberg and Gale’s idea: Use the following objective function (take its logarithm to convert into a concave function) Eisenberg-Gale’s Convex Program  Split himself into two buyers with half the money  Double all her u ij ’ s

Eisenberg-Gale’s Convex Program Remarks:- No budget constraints! - It is not necessary that the utility functions are CES; everything works as long as they are concave, and homogeneous

Eisenberg-Gale’s Convex Program KKT Conditions  - primal variables + Langrange multipliers comprise a competitive eq. - interpret Langrange multipliers as prices 1. Gives a poly-time algorithm for computing a market equilibrium in Fisher’s model. 2. At the same time provides a proof that a market equilibrium exists in this model. Linear case: proof on the board.