How do you model the future?   Stochastic approach: The future can be modeled as a distribution over possible events.   Very successful in many contexts.

Slides:

Advertisements

Similar presentations

The Decision Making Process:

Advertisements

A Primal-Dual Approach to Online Optimization Problems.

Kenneth Arrow Uncertainty and the Welfare Economics of Medical Care HSPM 714 J50 Fall 2013.

1 Criticism and disagreement Nurturing Parenting Section 10.5 GOAL To Increase Parent’s Ability to Use disagreement Instead of Criticism.

Online Algorithms Amrinder Arora Permalink:

Online learning, minimizing regret, and combining expert advice

Questions?. Setting a reward function, with and without subgoals Difference between agent and environment AI for games, Roomba Markov Property – Broken.

Institute of Computer Science University of Wroclaw Geometric Aspects of Online Packet Buffering An Optimal Randomized Algorithm for Two Buffers Marcin.

Princeton University COS 423 Theory of Algorithms Spring 2001 Kevin Wayne Competitive Analysis.

Paired Data: One Quantitative Variable Chapter 7.

1 Chapter 12 Value of Information. 2 Chapter 12, Value of information Learning Objectives: Probability and Perfect Information The Expected Value of Information.

Chapter 14 Decision Making

Establishing Credit Presented By:. What is credit? Credit is more than a plastic card you use to buy things --- it is your financial trustworthiness.

1 Online and Stochastic Survivable Network Design Ravishankar Krishnaswamy Carnegie Mellon University joint work with Anupam Gupta and R. Ravi.

Lecture 4 on Individual Optimization Risk Aversion

Other Two-Person Decision Situations Not all social decisions have the same structure as the Prisoners’ Dilemma. It is important to analyze each case because.

Evaluation of Algorithms for the List Update Problem Suporn Pongnumkul R. Ravi Kedar Dhamdhere.

Dynamic Internet Congestion with Bursts Stefan Schmid Roger Wattenhofer Distributed Computing Group, ETH Zurich 13th International Conference On High Performance.

CS 345 Data Mining Online algorithms Search advertising.

Dynamic Power Management for Systems with Multiple Power Saving States Sandy Irani, Sandeep Shukla, Rajesh Gupta.

CS 589 Information Risk Management 23 January 2007.

Online Algorithms for Network Design Adam Meyerson UCLA.

Robust Network Design with Exponential Scenarios By: Rohit Khandekar Guy Kortsarz Vahab Mirrokni Mohammad Salavatipour.

Online Oblivious Routing Nikhil Bansal, Avrim Blum, Shuchi Chawla & Adam Meyerson Carnegie Mellon University 6/7/2003.

1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Search Algorithms Winter Semester 2004/ Jan.

CS 345 Data Mining Online algorithms Search advertising.

Evaluation of Algorithms for the List Update Problem Suporn Pongnumkul R. Ravi Kedar Dhamdhere.

Decision Making What? Art of choosing between two or more courses of action. Always there cannot be a correct decision but … better decision.

EOC Practice EOC Practice Continues.

Yi Xiang and David Soberman April Science to Practice Initiative Adapted from Xiang, Yi and David A. Soberman (2011), “Preview Provision under Competition.”

Using Inference to Make Decisions

Developing Mathematical Thinkers

Lesson 9-1 Pages Simple Events Lesson Check Ch 8.

The Birthday Problem with Applications to Cryptography Amy Prager.

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.

Data Challenges UNITED NATIONS SECRETARY-GENERAL’S STUDY ON VIOLENCE AGAINST CHILDREN.

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.

Chapter 6 – Personal Risk Management Lesson 6

Decision making. Types of decision Programmed decisions Non-programmed decisions.

Jennifer Campbell November 30,  Problem Statement and Motivation  Analysis of previous work  Simple - competitive strategy  Near optimal deterministic.

PUTTING THE “I” BACK IN CIO: BIG DATA, BIG CHANGES Dr. Gerry McCartney Vice President for Information Technology and System CIO Oesterle Professor of Information.

Establishing Credit Presented By:. Credit is more than a plastic card you use to buy things --- it is your financial trustworthiness. What is credit?

1 Online algorithms 叶德仕 2 Online & offline Traditional theoretical analysis is concerned with off-line problems where the complete.

Random Variables If  is an outcome space with a probability measure and X is a real-valued function defined over the elements of , then X is a random.

Principles of Probability 1 “Probability is the very guide of life” -Cicero Image from csiegel3.tripod.com/csiegel3.tripod.com/

 We have also applied VPI in a disaster management setting:  We investigate overlapping coalition formation models. Sequential Decision Making in Repeated.

 young outdoor winter sport  connection between wind and snow  jumping higher and further  utilize of the flat ground and low hills  using like aid.

Anticipating failure in order to prevent it Pre-mortem.

Honors Stats 4 Day 9 Chapter 16. Do Now Check Your Homework Homework: Chapter 16 p. 382 #1, 2, 4, 5, 6, 17, 18 Objective: SWBAT understand and calculate.

What is the link ? Think of a question you would ask here?

Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental

Secretary Markets with Local Information

Another Negotiator’s Dilemma: Shoot Straight or Act Deceptively Against a Counterpart with a Bad Reputation Jeff Schatten Ed Miles.

Better Algorithms for Better Computers

Prof. Dr. Holger Schlingloff 1,2 Dr. Esteban Pavese 1

Algebra 1 Semester 1 Exam review.

Lesson 22. My Favourite Season!

Optimism & Positive Self Talk

Announcements Homework 3 due today (grace period through Friday)

إستراتيجيات ونماذج التقويم

Presented By Aaron Roth

Online algorithms Search advertising

Probability and Statistics

Using Inference to Make Decisions

Lesson 6.5 Percents of Increase and Decrease

Choice Moving on is a process; moving forward is a choice.

Criticism and Confrontation

Module 6 Planning

The Weighted Majority Algorithm

Optimal Power-Down Strategies

Presentation transcript:

How do you model the future?   Stochastic approach: The future can be modeled as a distribution over possible events.   Very successful in many contexts.   Alternative: Think of the future as an adversary, do well against all possible future outcomes.

Toy Example: Ski Optimization I decide to take up skiing. Should I rent or buy skis?   Uncertainty: Will I like skiing? Will there be snow? Will I break my leg? Will the government outlaw skiing?   I want to have a good strategy against all possible outcomes In this case an outcome is the number of times I wind up going skiing.

Ski Rental  A pair of skis (and boots) costs $300.  A ski rental costs $50.  What should you do?  How do you evaluate if you did the right thing?  You give a strategy (algorithm)  You compare against how well someone who knows that future could do.  You take the worst case and call that the competitive ratio

Ski Rental  Let A be my algorithm.  Let OPT be the behavior of someone who knows the future  Consider any realization of the future I (number of times I actually ski)  Competetive ratio  We want a strategy with a small competitive ratio

Optimal Strategy Times skiing lots StrategyRRRRRBBBB Cost

Algorithm 1: Buy Times skiing lots Cost of A Opt Cost Ratio Competitive ratio = 6

Algorithm 2: Rent Times skiing lots Cost of A lots Opt Cost Ratio lots Competitive ratio = lots

Algorithm 3: Rent 6 times and then buy Times skiing lots Cost of A Opt Cost Ratio Competitive ratio = 2

Lessons  Without knowing the future, you can guarantee that no matter what happens, you will never spend more than twice what anyone could have spent.  A good algorithm balances different bad outcomes  If you allow randomization, you can decrease the competetive ratio to e/(e-1), around 1.58.