Omniadisce

Applied maths 19.7: Mastery check — operations research and game theory

Lesson Intermediate

Join free to take this lesson

Anyone can look around, but taking a lesson needs a free account. With one, your answers are checked step by step and your progress is saved, so you can stop and pick up where you left off on any device.

15 steps · about 25 min

By the end you can

  • Find shortest routes, critical paths, slack and maximum flows
  • Solve small integer programmes and knapsack problems
  • Use the M/M/1 formulas and Little's law
  • Compute EMV and the value of perfect information
  • Find mixed equilibria of 2 × 2 games and reason about auctions

Who it is for: You have worked through lessons 19.1-19.6.

The steps

  1. How the mastery check works
  2. Shortest route
  3. Critical path
  4. Maximum flow
  5. Rounding
  6. Knapsack
  7. Time in the system
  8. Utilisation and queue
  9. Little's law
  10. EMV
  11. Value of perfect information
  12. A mixed equilibrium
  13. Equilibria
  14. Second-price auction
  15. From unit 5: at least one arrival

Discussion 0 comments

Log in to join the discussion.

× Enlarged view