Planning a fair orienteering event Ghent, 2018 Dr. Philip Scarf - - PowerPoint PPT Presentation

planning a fair orienteering event
SMART_READER_LITE
LIVE PREVIEW

Planning a fair orienteering event Ghent, 2018 Dr. Philip Scarf - - PowerPoint PPT Presentation

Planning a fair orienteering event Ghent, 2018 Dr. Philip Scarf Associate Dean Research and Professor of Applied Statistics Sports with issues of fairness: Score orienteering Basketball? Seeding in KO tournaments in general?


slide-1
SLIDE 1
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

Planning a fair orienteering event

Ghent, 2018

slide-2
SLIDE 2
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

Sports with issues of fairness:

  • Score orienteering
  • Basketball?
  • Seeding in KO tournaments in general?
slide-3
SLIDE 3
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

slide-4
SLIDE 4
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

slide-5
SLIDE 5
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

slide-6
SLIDE 6
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

slide-7
SLIDE 7
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

slide-8
SLIDE 8
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

slide-9
SLIDE 9
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

slide-10
SLIDE 10
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

slide-11
SLIDE 11
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

slide-12
SLIDE 12
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

Some observations and questions

  • The planner assigns scores to nodes (controls)
  • Setting a course S in which ni of the nodes have score si for

i=1,…,k (subject to some loose constraints on the ni)

  • Suppose competitor j has a path-length limited to Lj
  • We shall call the orienteering problem “fair” if the maximum

score possible for competitor j is proportional to Lj for all j in C

  • “All else equal, equal points for equal running”
  • Is this a good definition of “fair”?
  • A clearable course benefits the faster runners
  • How does one plan a fair course?
  • What is a fair assignment of scores to nodes?
slide-13
SLIDE 13
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

Some further issues

  • In real orienteering problems, “edge lengths” are stochastic:

what is the effect of this upon the effectiveness of solution algorithms?

  • What are some good solution heuristics for a human

competitor?

  • Is the human brain a good orienteering problem solver?
  • Overtime penalties
slide-14
SLIDE 14
  • Dr. Philip Scarf

Associate Dean Research and Professor of Applied Statistics

No solutions, only questions…