SCG Court: A Crowdsourcing Platform for Innovation

Karl LieberherrNortheastern University

College of Computer and Information ScienceBoston, MA

joint work with Ahmed Abdelmeged

Supported by Novartis

Essence of Game Rules• actors:

– proposer=verifier (1. arg to propose, oppose, refute, usually Alice),

– opposer=falsifier (2. arg to propose, oppose, refute, usually Bob)

• LifeOfClaim(c) = propose(Alice,c) followed by (oppose(Alice,Bob,c)|agree(Alice,Bob,c)).

• oppose(Alice,Bob,c) = (refute(Alice,Bob,c)|strengthen(Alice,Bob,c,cs)), where stronger(c,cs).

• strengthen(Alice,Bob,c,cs) = !refute(Bob,Alice,cs).• agree(Alice,Bob,c) =!refute(Bob,Alice,c)

4/24/2011 2

blamed decisions:propose(Alice,c)refute(A,B,c)strengthen(Alice,Bob,c,cs)agree(A,B,c)

Crowdsourcing

Essence of Game Rules• LifeOfClaim(c) = propose(Alice,c) followed by

(oppose(Alice,Bob,c)|agree(Alice,Bob,c)).• oppose(Alice,Bob,c) = (refute(Alice,Bob,c) |

strengthen(Alice,Bob,c,cs)), where stronger(c,cs).

• refute(Alice,Bob,c)– If Bob refutes, refutation is successful and Bob wins reputation.

• strengthen(Alice,Bob,c,cs) = !refute(Bob,Alice,cs).– If Bob defends, strengthening is successful: Bob gains reputation.

• agree(Alice,Bob,c) =!refute(Bob,Alice,c)– If Bob defends, agreement is successful: no reputation change.– If Alice refutes, Bob loses reputation.

4/24/2011 3

blamed decisions:propose(Alice,c)refute(A,B,c)strengthen(Alice,Bob,c,cs)agree(A,B,c)

Crowdsourcing

Winning/Losingunder violations

• If Alice first violates a game rule, Bob is the winner.

• If Bob first violates a game rule, Alice is the winner.

• If none violate a game rule: the claim predicate decides.

4/24/2011 4Crowdsourcing