Optimal Contracting Within NASA: - PowerPoint PPT Presentation

About This Presentation
Title:

Optimal Contracting Within NASA:

Description:

HQ: Menu of missions for near future. ICs: Review menu, provide cost estimates ... Project is a lottery. Failure is worse than cancellation. Interaction is repeated ... – PowerPoint PPT presentation

Number of Views:35
Avg rating:3.0/5.0
Slides: 38
Provided by: healyEcon
Category:

less

Transcript and Presenter's Notes

Title: Optimal Contracting Within NASA:


1
Optimal Contracting Within NASA
  • An Applied Mechanism Design Problem

Paul J. Healy (CMU Tepper), John Ledyard
(Caltech), Charles Noussair (Emory), Harley
Thronson, Peter Ulrich, and Giulio Varsi (NASA)
2
  • Mars Climate Orbiter
  • Launched 12/11/98
  • Lost 9/23/99 (orbit entry)
  • English-to-Metric problem
  • Mars Polar Lander
  • Launched 1/3/99
  • Lost 12/3/99 (landing)
  • Landing software glitch?

Total Cost 327 Million Deeper issue Cost
overruns
3
NASA Mission Acquisition
  • HQ Principal
  • ICs Agents

4
Budget Allocation Cost Caps
  • HQ Menu of missions for near future
  • ICs Review menu, provide cost estimates
  • HQ Assigns missions to ICs
  • ICs Refine cost estimates
  • HQ Assign cost caps for each mission
  • ICs Build mission
  • HQ Fund mission up to cost cap
  • Adverse Selection Moral Hazard

5
IC Realizes a Cost Overrun
DescopeMission (Less Science)
Increase Risk (Fewer Tests)
Cancel Mission
Request From HQ
IC
Reject Request
Cancel Mission Reallocate
Reallocate From Other Missions
Ask Congress For
HQ
Congress Approval (Damages Reputation)
6
Mars Orbiter Lander
  • Review Board
  • Program was under-funded by 30.
  • JPL requested additional 19 million
    rejected.
  • Ed Weiler
  • Poor engineering decisions were made because
    people were trying to emphasize keeping within
    the cost cap.
  • HQ should have a reserve of money for overruns.
  • Dan Goldin
  • The Lockheed Martin team was overly
    aggressive, because their focus was on winning
    the contract.

7
Theory A Fixed Project
  • Agent
  • Luck L Effort e
  • Cost C(e) L e Disutility f(e) (f gt 0,
    f gt 0)
  • Payment from Principal T
  • Payoff U(T,e) T C(e) - f(e)
  • Principal
  • Observes C, not L or e. Payment to agent T
  • Benefit of project S Cost of capital ?
  • Payoff V(T,e) S U(T,e) (1 ?)T

8
Mechanism Design Problem Whats the right T
when L is unknown?
9
Cost Cap Low type reduces effort, gets higher
transfer High type earns lt0 if
he participates
10
Menu of Optimal Linear Contracts
  • Agent Announce CE Principal Pay T T(CE,C)
  • Cost caps are backwards!

11
Optimal Contract Features
  • High cost types get enough money
  • Low cost types dont misrepresent
  • (Strong cost saving incentives)
  • Multiple agents
  • Use cost estimates as bids
  • Solves adverse selection problem
  • Second best some distortion occurs

12
Theory vs. Reality
  • ICs cost estimates sharpen in time
  • Luck innovation while building
  • Project size, complexity can vary (S not fixed)
  • IC also cares about outcome (S)
  • Project is a lottery
  • Failure is worse than cancellation
  • Interaction is repeated
  • f(e) and C(e) are not known, not observable
  • Common knowledge priors, utility maximizing

13
Proposal MCCS
  • IC HQ negotiate cost baseline CB
  • 3 linear contracts Hi, Base, Low
  • (Each is a function of CB)
  • IC begins building, innovating
  • (Costs change, partly due to luck)
  • IC picks a contract
  • HQ pays IC based on contract, cost
  • IC HQ can keep savings for future

14
Proposal MCCS
15
Hypothesis
  • MCCS outperforms cost caps
  • ? payoffs ? delays ? innovations
  • Why?
  • Low types have cost-saving incentive
  • High types get enough money
  • Risk sharing ? more innovation ? lower cost
  • Intertemporal budgets ? insurance

16
Experiment
  • 1HQ 1 or 2 ICs
  • Static menu of 2 missions, 3 levels each
  • HQ has annual budget of 1500 francs
  • HQ allocates budget via Cost Cap or MCCS
  • Money earmarked for IC and mission and level
  • IC Innovation
  • Spend more ? higher prob. of big cost reductions
  • IC Building
  • Chooses Science (S) and Reliability (R)
  • Mission crashes with probability 1-R
  • Payout S if succeeds, -F if fails, 0 if
    cancelled
  • Dont care about money unspent funds are wasted

17
Timing
  • HQ/IC negotiate cost caps/baselines
  • ICs attempt 1st innovation
  • Renegotiation (cost caps only)
  • 2nd Innovation attempt
  • IC Builds Science (S) Reliability (R)
  • (Receive transfer, pay C(S,R))
  • Project launched success/fail
  • HQ Expected Payoff RS - (1-R)F

18
Luck Bonus
  • ICs cost is changed by 3 luck shocks
  • 1st Before negotiation
  • 2nd During innovation
  • 3rd Pre-build
  • IC gets a bonus if a level 1 mission flies
  • Only difference between IC and HQ.

19
(No Transcript)
20
(No Transcript)
21
(No Transcript)
22
(No Transcript)
23
Treatments No. of Periods
24
  • Results Total Earnings
  • HQ IC earn more under MCCS
  • MCCS with experienced subjects gt benchmarks
  • (MCCS Cost Cap) gt (C.B. N.C.B)

25
Results Contd
  • MCCS vs. Cost Cap
  • More innovation
  • Lower final costs
  • Fewer missions cancelled
  • Experience increases payouts
  • Issues with MCCS
  • Overinvest in innovation effort
  • Overinvest in science
  • Fair distribution of missions

26
Summary
  • NASA Project Ongoing
  • Single contract cost sharing
  • Different parameters, functional forms
  • Bending theory to fit the problem
  • Lab as a Testbed
  • Results/Design feedback loop

27
(No Transcript)
28
HQ Payoffs Inexperienced
29
HQ Payoffs Experienced
30
IC Payoffs Inexperienced
31
IC Payoffs Experienced
32
Delays Inexperienced
33
Delays Experienced
34
Innovations Inexperienced
35
Innovations Experienced
36
Summary of Results
  • Payoffs MCCS gt Cost Cap Benchmarks
  • Delays MCCS lt Cost Cap
  • Innovation MCCS gt Cost Cap
  • MCCS gets better with experience
  • Failures under MCCS
  • Too much innovation effort
  • Science/Reliability ratio too high
  • Fairness HQ splits missions among 2 ICs

37
  • C(S,R,e) aS2 b ln(1/(1-R)) e L
  • P 1 ze prob. reduce a by 1/3
  • Tk Ak Bk(Ck-C)
  • Ck dkCB
  • Bk Bk
  • Ak Ck ?kCB
Write a Comment
User Comments (0)
About PowerShow.com