1 / 4

SCG Court: A Crowdsourcing Platform for Innovation

SCG Court: A Crowdsourcing Platform for Innovation. Supported by Novartis. Karl Lieberherr Northeastern University College of Computer and Information Science Boston, MA joint work with Ahmed Abdelmeged. blamed decisions: propose( Alice,c ) refute( A,B,c ) strengthen( Alice,Bob,c,cs )

nevan
Download Presentation

SCG Court: A Crowdsourcing Platform for Innovation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. SCG Court: A Crowdsourcing Platform for Innovation Supported by Novartis • Karl Lieberherr • Northeastern University • College of Computer and Information Science • Boston, MA • joint work with Ahmed Abdelmeged

  2. blamed decisions: propose(Alice,c) refute(A,B,c) strengthen(Alice,Bob,c,cs) agree(A,B,c) 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) Crowdsourcing

  3. blamed decisions: propose(Alice,c) refute(A,B,c) strengthen(Alice,Bob,c,cs) agree(A,B,c) 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. Crowdsourcing

  4. 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. Crowdsourcing

More Related