Hit-or-Wait: Coordinating Opportunistic Low-effort Contributions to - - PowerPoint PPT Presentation

hit or wait coordinating opportunistic low effort
SMART_READER_LITE
LIVE PREVIEW

Hit-or-Wait: Coordinating Opportunistic Low-effort Contributions to - - PowerPoint PPT Presentation

1 Hit-or-Wait: Coordinating Opportunistic Low-effort Contributions to Achieve Global Outcomes in On-the-go Crowdsourcing Yongsung Kim Darren Gergle Haoqi Zhang @DeltaLabNU 2 Imagine that you lost your wallet on your way to the venue


slide-1
SLIDE 1

Hit-or-Wait: Coordinating Opportunistic Low-effort Contributions to Achieve Global Outcomes in On-the-go Crowdsourcing

@DeltaLabNU

Yongsung Kim Darren Gergle Haoqi Zhang

1

slide-2
SLIDE 2

Imagine that you lost your wallet

  • n your way to the venue

2

slide-3
SLIDE 3

3

How might we leverage CHI attendee’s existing routine and route to help you find your wallet?

slide-4
SLIDE 4

Opportunistic/Pull-based

4

slide-5
SLIDE 5

5

Directed/Push-based

Nope, already headed to the party

slide-6
SLIDE 6

6

Our goal: leverage existing route to notify when it is convenient for helpers

slide-7
SLIDE 7

7

Our goal: and achieve globally effective outcomes

slide-8
SLIDE 8

Conceptual approach

  • Achieve globally effective outcomes in

physical crowdsourcing by indirectly coordinating opportunistic contributions with people on-the-go.

8

slide-9
SLIDE 9

9

Helper Convenience

Quality of service

Opportunistic Approach Directed Approach

Teodoro et al. CHI 2014 Thebault-Spieker et al. CSCW 2015

Sadilek et al. ICWSM 2013 Kim et al. HCOMP 2016 Doryab et al. Ubicomp 2018

Our Approach

slide-10
SLIDE 10

When do we notify people of a task?

10

slide-11
SLIDE 11

When do we notify people of a task?

  • we do not want to notify all the time, but only

notify at the “best moment”

11

slide-12
SLIDE 12

When do we notify people of a task?

  • we do not want to notify all the time, but only

notify at the “best moment”

  • we can optimize task assignment [Kandappu et al. CSCW

2016], but people may not accept the task and

we also do not know where they may go next

12

slide-13
SLIDE 13

When do we notify people of a task?

  • we do not want to notify all the time, but only

notify at the “best moment”

  • we can optimize task assignment [Kandappu et al. CSCW 2016],

but people may not accept the task and we also do not know where they may go next

  • we may send low-valued tasks or miss
  • pportunities to notify.

13

slide-14
SLIDE 14

Opportunistic Hit-or-Wait

  • Uses decision-theory to decide **on-the-fly**

whether to notify a helper of a task right now

  • r wait for better opportunities in the future,

in ways that reason both about system needs across tasks and about a helper’s changing patterns of mobility.

14

slide-15
SLIDE 15

Hit-or-Wait Example

15

slide-16
SLIDE 16

16

Wait

slide-17
SLIDE 17

17

Hit!

slide-18
SLIDE 18

Our approach: Modeling a sequence of Hit-or- Wait decisions with a Markov Decision Process (MDP)

  • State s: task location
  • Reward function R(s, a): value of notifying a task at state s
  • Transition function P(s’|s): likelihood of reaching state s’

from state s.

  • Action: {hit, wait}
  • if hit, it moves to terminal state
  • if wait, it moves to next state

18

slide-19
SLIDE 19

Modeling a sequence of Hit-or-Wait decisions with a Markov Decision Process (MDP)

19

slide-20
SLIDE 20
  • 1. Encode value of notifying a

helper of a task

20

likelihood of finding item search count

slide-21
SLIDE 21
  • 2. Model likelihood of reaching

next location from current location

21

slide-22
SLIDE 22
  • 3. Compare the expected value of notifying

now with the expected value from making a decision later if we wait

22

slide-23
SLIDE 23

Studies

  • A simulation study
  • A field deployment

23

slide-24
SLIDE 24

Simulation study

  • compare hit-or-wait with other approaches
  • understand how hit-or-wait mechanism works
  • understand how model accuracy affects the

performance

24

slide-25
SLIDE 25

Simulation setup

  • Dataset: 5,983 running routes from 2,419 users in RunKeeper
  • Measure:
  • Search Quality: likelihood of finding an item given searches
  • Conditions:
  • Hit-or-Wait
  • Node Counting
  • Optimal solution (full knowledge of routes)

25

slide-26
SLIDE 26

Hit-or-Wait maximizes user contributions without explicit coordination

26

slide-27
SLIDE 27

27

slide-28
SLIDE 28

A field deployment

  • How does Hit-or-Wait work in practice?
  • What are some failure cases in practice?
  • What are users’ perception of their

contributions?

28

slide-29
SLIDE 29

Field deployment setup

  • 10-day study with 25 users (13M, 12F) in lost and found Scenario
  • Dataset: Pre-study (N=11) with location tracking
  • Measures:
  • Search quality
  • Value of hit or wait decisions
  • Conditions:
  • Hit-or-Wait
  • Optimal (full knowledge)

29

slide-30
SLIDE 30

Results

  • 248 notifications sent and 60 searches

conducted along their routes (24.19% acceptance rate)

  • Among the searches, 4 different participants

found 4 items out of the 9 search requests

30

slide-31
SLIDE 31

Hit-or-Wait reached 84% of

  • ptimal solution in practice

31

slide-32
SLIDE 32

Hit-or-Wait made effective wait decisions

32

slide-33
SLIDE 33

Failure cases in misprediction

33

slide-34
SLIDE 34

Failure cases in misprediction

34

slide-35
SLIDE 35

Follow-up interviews

  • 7 participants who helped at least once
  • Hit-or-Wait example visualizations
  • 35
slide-36
SLIDE 36

Users wanted to have better understanding in how they contributed to the global goal

  • “Maybe also having information like if

someone does find the item, then I would know I was being helpful...I was helping part

  • f that even if I wasn’t the exact person to

find it.” — P7

36

slide-37
SLIDE 37

Applicability of Hit-or-Wait

  • Volunteer-based peer-to-peer services where the

system goal is to effectively provide help for each other.

  • Low-effort sensing and community sensing

where the goal is to ensure data coverage and details.

37

slide-38
SLIDE 38

Decision theory as a way to support communities

38

Context-sensitive task notifications

[Kim et al. HCOMP 2016, Ikeda et al. CHI 2017, Doryab et al. Ubicomp 2018]

slide-39
SLIDE 39

Decision theory as a way to support communities

39

Context-sensitive task notifications

[Kim et al. HCOMP 2016, Ikeda et al. CHI 2017, Doryab et al. Ubicomp 2018]

This work: Individual-level Coordination

slide-40
SLIDE 40

Decision theory as a way to support communities

40

Context-sensitive task notifications

[Kim et al. HCOMP 2016, Ikeda et al. CHI 2017, Doryab et al. Ubicomp 2018]

This work: Individual-level Coordination Future work: Community-level Coordination

slide-41
SLIDE 41

Takeaways

  • Hit-or-Wait allows volunteers to go about their

routine, but indirectly coordinates their contributions to achieve better system needs and helper convenience.

  • Introduces ways to use decision-theoretic

approach to not only optimize but to support convenient interactions

41

slide-42
SLIDE 42

Hit-or-Wait: Coordinating Opportunistic Low-effort Contributions to Achieve Global Outcomes in On-the-go Crowdsourcing

@DeltaLabNU

Yongsung Kim Darren Gergle Haoqi Zhang

42

Hit

  • r

Wait

and chat after the session me at

@DeltaLabNU