• DocumentCode
    1946458
  • Title

    Optimizing information credibility in social swarming applications

  • Author

    Liu, Bin ; Terlecky, Peter ; Bar-Noy, Amotz ; Govindan, Ramesh ; Neely, Michael J.

  • Author_Institution
    Univ. of Southern California, Los Angeles, CA, USA
  • fYear
    2011
  • fDate
    10-15 April 2011
  • Firstpage
    556
  • Lastpage
    560
  • 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. 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 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 while being 3 orders of magnitude more computationally efficient. More interesting, a time-averaged version of the problem is amenable to a novel stochastic utility optimization formulation, and can be solved optimally, while in some cases yielding decentralized solutions.
  • Keywords
    mobile handsets; stochastic programming; user interfaces; believability intuition; discrete optimization problem; information credibility; smartphone technology; social swarming application; stochastic utility optimization formulation; Approximation algorithms; Approximation methods; Complexity theory; Context; Dynamic programming; Heuristic algorithms; Optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2011 Proceedings IEEE
  • Conference_Location
    Shanghai
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4244-9919-9
  • Type

    conf

  • DOI
    10.1109/INFCOM.2011.5935225
  • Filename
    5935225