Optimizing Information Credibility in Social Swarming Applications
Bin Liu, Peter Terlecky, Amotz Bar-Noy, Ramesh Govindan, Michael J., Neely

TL;DR
This paper introduces a novel approach to optimize the selection of smartphone reporters in social swarming applications to maximize information credibility, offering efficient algorithms and a new stochastic utility framework.
Contribution
It is the first to formulate and solve the problem of extracting credible information from smartphone networks using centralized, approximate, and stochastic optimization methods.
Findings
Approximate decentralized solution performs within 20% of optimal.
Proposed algorithms are three orders of magnitude more efficient.
Time-averaged problem admits an optimal stochastic utility solution.
Abstract
With the advent of smartphone technology, it has become possible to conceive of entirely new classes of applications. Social swarming, in which users armed with smartphones are directed by a central director to report on events in the physical world, has several real-world applications: search and rescue, coordinated fire-fighting, and the DARPA balloon hunt challenge. In this paper, we focus on the following problem: how does the director optimize the selection of reporters to deliver credible corroborating information about an event. We first propose a model, based on common intuitions of believability, about the credibility of information. We then cast the problem posed above as a discrete optimization problem, and introduce optimal centralized solutions and an approximate solution amenable to decentralized implementation whose performance is about 20% off on average from the optimal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Caching and Content Delivery · Opportunistic and Delay-Tolerant Networks
