Yair Zick Joint work with Yoram Bachrach, Ian Kash and Peter Key.

Slides:



Advertisements
Similar presentations
Lecture 3: Taxes, Tariffs and Quota (Chapter 5) Relation to work horses Government and taxation Taxes and quotas in general equilibrium Welfare implications.
Advertisements

Fairness and Social Welfare Functions. Deriving the Utility Possibility Frontier (UPF) We begin with the Edgeworth Box that starts with individual 1,and.
L5: Dynamic Portfolio Management1 Lecture 5: Dynamic Portfolio Management The following topics will be covered: Will risks be washed out over time? Solve.
Negotiation A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
Regret Minimization and the Price of Total Anarchy Paper by A. Blum, M. Hajiaghayi, K. Ligett, A.Roth Presented by Michael Wunder.
BUSINESS DRIVEN TECHNOLOGY Outsourcing Collaborative Partnerships
Chapter Thirty-Three Law and Economics. Effects of Laws u Property right assignments affect –asset, income and wealth distributions; v e.g. nationalized.
Chapter Thirty Production. Exchange Economies (revisited) u No production, only endowments, so no description of how resources are converted to consumables.
EC941 - Game Theory Prof. Francesco Squintani Lecture 8 1.
General Equilibrium Theory
6.896: Topics in Algorithmic Game Theory Lecture 15 Constantinos Daskalakis.
P.V. VISWANATH FOR A FIRST COURSE IN INVESTMENTS.
In terms of ownership & control all business fall into one of 2 sectors.
Maxima and Minima. Maximum: Let f(x) be a function with domain DC IR then f(x) is said to attain the maximum value at a point a є D if f(x)
Overlapping Coalition Formation: Charting the Tractability Frontier Y. Zick, G. Chalkiadakis and E. Elkind (submitted to AAMAS 2012)
Yale lectures 5 and 6 Nash Equilibrium – no individual can do strictly better by deviating – self enforcing in agreements Investment game – all invest.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
Arbitration, Fairness and Stability Revenue Division in Collaborative Settings Yair Zick Advisor: Prof. Edith Elkind.
Chapter 7 General Equilibrium and Market Efficiency
Distributed Multiagent Resource Allocation In Diminishing Marginal Return Domains Yoram Bachrach(Hebew University) Jeffrey S. Rosenschein (Hebrew University)
L11: Risk Sharing and Asset Pricing 1 Lecture 11: Risk Sharing and Asset Pricing The following topics will be covered: Pareto Efficient Risk Allocation.
Agent Technology for e-Commerce Chapter 10: Mechanism Design Maria Fasli
Computing Shapley Values, Manipulating Value Distribution Schemes, and Checking Core Membership in Multi-Issue Domains Vincent Conitzer and Tuomas Sandholm.
Query Incentive Networks Jon Kleinberg and Prabhakar Raghavan - Presented by: Nishith Pathak.
Arbitrators in Overlapping Coalition Formation Games
L9: Consumption, Saving, and Investments 1 Lecture 9: Consumption, Saving, and Investments The following topics will be covered: –Consumption and Saving.
Distributed Rational Decision Making Sections By Tibor Moldovan.
Risk Aversion and Capital Allocation to Risky Assets
The Production Game 1 Players: Principal, agent The Order of Play: The principal offers a wage rate, w The agent decides whether to accept of reject the.
DECISION RIGHTS AND CORPORATE CONTROL 5th set of transparencies for ToCF.
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.
Analysis of a Yield Management Model for On Demand IT Services Parijat Dube IBM Watson Research Center with Laura Wynter and Yezekael Hayel.
Contribution Games in Social Networks Elliot Anshelevich Rensselaer Polytechnic Institute (RPI) Troy, New York Martin Hoefer RWTH Aachen University Aachen,
Survey of Accounting: The Maze of Numbers Accounting 220 Responsibility Centers.
Project Assessment Essentials of Corporate Finance Chapters 4, 8, 9, 12 Materials Created by Glenn Snyder – San Francisco State University.
Overlapping Coalition Formation: Charting the Tractability Frontier Y. Zick, G. Chalkiadakis and E. Elkind (AAMAS 2012)
Economics Introduction:
Auction Seminar Optimal Mechanism Presentation by: Alon Resler Supervised by: Amos Fiat.
Copyright 2006 – Biz/ed Business Economics.
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.
COST MANAGEMENT Accounting & Control Hansen▪Mowen▪Guan COPYRIGHT © 2009 South-Western Publishing, a division of Cengage Learning. Cengage Learning and.
Bounding the Cost of Stability in Games with Restricted Interaction Reshef Meir, Yair Zick, Edith Elkind and Jeffrey S. Rosenschein COMSOC 2012 (to appear)
Chapter Thirty-Two Production. Exchange Economies (revisited)  No production, only endowments, so no description of how resources are converted to consumables.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Polynomial Time Algorithms For Market Equilibria.
Lecture 7 Course Summary The tools of strategy provide guiding principles that that should help determine the extent and nature of your professional interactions.
Paul Milgrom and Nancy Stokey Journal of Economic Thoery,1982.
INTERNATIONAL ECONOMICS Lecture 3 | Carlos Cuerpo | Why do countries trade? Some later answers.
OT Should firms employ personalized pricing? joint work with Noriaki Matsushima.
Model Building In this chapter we are going to lean some tools for analyzing the following questions:
Human Resource Planning Types of Planning Aggregate planning Anticipates needs for groups of employees in specific, usually lower level jobs and general.
Introduction Many organizations use decision rules to alleviate incentive problems as opposed to incentive contracts The principal typically retains some.
The benchmark of perfect competition Defining perfect competition Modelling market interactions Welfare and efficiency.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Marek Kapicka Lecture 2 Basic Intertemporal Model
© 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.
Markov Decision Process (MDP)
1 Networks of Tinkerers: a Model of Open-Source Innovation Peter B. Meyer BLS brown bag seminar, March 15, 2006.
1 Production. 2 Exchange Economies (revisited) No production, only endowments, so no description of how resources are converted to consumables. General.
CHAPTER TWENTY-ONE Portfolio Management CHAPTER TWENTY-ONE Portfolio Management Cleary / Jones Investments: Analysis and Management.
Optimization and Stability in Games with Restricted Interactions Reshef Meir, Yair Zick and Jeffrey S. Rosenschein CoopMAS 2012.
L6: Risk Sharing and Asset Pricing1 Lecture 6: Risk Sharing and Asset Pricing The following topics will be covered: Pareto Efficient Risk Allocation –Defining.
Microeconomics 1000 Lecture 13 Oligopoly.
Cost Allocation: Service Departments and Joint Product Costs
Theory of Capital Markets
Markov Decision Processes
Markov Decision Processes
Presented By Aaron Roth
General Equilibrium (Social Efficiency)
Presentation transcript:

Yair Zick Joint work with Yoram Bachrach, Ian Kash and Peter Key

 The school of computer science must decide on its 2015 budget allocation. How should the budget be divided? Dean’s Business Office Office of Alumni Relations SCS Career Center

Dean’s Business Office Computer Science Dpt. $50M $40M $60M $50M $70M $55M Helpdesk$10M $15M  Budget division on one year will affect revenue on the next.  What is the best way to divide revenue?

 Key Observation: the way profits are divided affects revenue in subsequent rounds.  An underfunded department will not be as efficient.  Extra funding may not lead to extra benefit.  Limitation: individual departments do not care about total utility, want to maximize their own share of the budget.

 Find a sequence of budget divisions (a contract) that maximizes total utility up to time-step T (optimal contract at time T)  Given an optimal contract at time T, how different is it from a contract that maximizes individual utility at time T?

 Agents who care about their future revenue tend to be more collaborative (will prefer revenue divisions that are near optimal)  Agents who are invested in others are more collaborative.  Homogeneous utility functions.

t =0123 w1w1 w 1 (0) x1V1x1V1 x1V2x1V2 x1V3x1V3 w2w2 w 2 (0) x2V1x2V1 x2V2x2V2 x2V3x2V3 total - V 1 = v ( w (0)) V 2 = v ( x 1 V 1, x 2 V 1 ) V 3 = v ( x 1 V 2, x 2 V 2 ) Players want to maximize their utility Social Welfare of the contract  Utility Function - v : R 2 ! R +  Initial Endowments – w (0) = ( w 1 (0), w 2 (0))  Sharing Contract - ( x 1, x 2 ) s.t. x 1 + x 2 = 1

v ( x, y ) = 4 xy w (0) = (0.5,0.5) t =01234 w1w1 0.5 w2w2 (0.5,0.5): t =01234 w1w1 0.5¾(¾) 2 (¾) 8 (¾) 16 w2w2 0.5¼¼∙¾¼∙(¾) 7 ¼∙(¾) 15 (3/4,1/4): … If player 1 only cares about utility up to time 2, then the second contract is better. Otherwise....

 First objective: find a sequence of revenue divisions that maximize revenue up to time T  Theorem: if the utility function is homogeneous, there exist optimal stationary contracts: contracts that offer the same revenue division at all time steps.  In fact: these contracts are precisely the maxima of v ( x )

 A function is homogeneous of degree k if v ( cx ) = c k v ( x )  If v is homogeneous, then it’s much easier to work with:  finding an optimal contract  finding total revenue at time t (easily derive a closed-form rather than recursive formula).

 Are there stationary contracts that are both optimal and individually optimal? (i.e. no agent wants to change them)  If v is differentiable, NO – an inevitable tension between individual gain and social welfare.  But…

individually optimal contracts become “nearly” optimal

individually optimal contracts are not optimal…

 First case: allow individuals to choose any revenue division they want at each round.  Fix a time step q ; let x q ( T ) be the best contract for player i at time q, if his goal is to maximize total revenue up to time T

 Theorem: let x q ( T ) be the best contract for player i at time q, if his goal is to maximize total revenue up to time T. If the utility function is  Differentiable  Homogeneous of degree 1 or more then lim T !1 x q ( T ) exists and is a critical point of v If v is concave, then the limit is an optimal contract.

 Theorem: If the utility function is  Differentiable  Homogeneous of degree 1 or more then lim T !1 x q ( T ) exists and is a critical point of v If v is concave, then the limit is an optimal contract.

 Theorem: if we limit individuals to picking fixed contracts (i.e. the same revenue division at all time-steps), then as their horizon increases, the contracts they will pick converge to an optimal contract.  Conclusion: far-sighted agents understand that what’s best for the group is also (nearly) best for them!

 The setting we describe is not a game (no player actions)  But – we can easily derive strategic games  utility function depends on players’ private information.  Each player proposes a contract, center aggregates contracts. Our results show that non-myopic agents will be much less strategic!

 When considering long-term gains, fair payoff divisions can be reached.  Optimal contracts (for differentiable production functions) are never individually optimal  … but can be so in the limit.

 Possible applications:  Networks, weighted matching, exchange markets…  Agents with divisible resources  Uncertain environments?  Beyond resource allocation settings?

 Revenue Reinvestment: we assume that each agent invests all of his revenue back into the function  reasonable, if we assume agents are (non-corrupt) institutes.  We can allow agents to keep a constant share of the profits, everything carries through.  If we allow strategic reinvestments (you choose how much to put back for the next round), things get interesting.  Non-myopic agents will invest everything into the function in early rounds, reap rewards at later rounds.