skip to main content
10.1145/3183713.3196929acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Dynamic Pricing in Spatial Crowdsourcing: A Matching-Based Approach

Published:27 May 2018Publication History

ABSTRACT

In spatial crowdsourcing, requesters submit their task-related locations and increase the demand of a local area. The platform prices these tasks and assigns spatial workers to serve if the prices are accepted by requesters. There exist mature pricing strategies which specialize in tackling the imbalance between supply and demand in a local market. However, in global optimization, the platform should consider the mobility of workers; that is, any single worker can be the potential supply for several areas, while it can only be the true supply of one area when assigned by the platform. The hardness lies in the uncertainty of the true supply of each area, hence the existing pricing strategies do not work. In the paper, we formally define this <u>G</u>lobal <u>D</u>ynamic <u>P</u>ricing(GDP) problem in spatial crowdsourcing. And since the objective is concerned with how the platform matches the supply to areas, we let the matching algorithm guide us how to price. We propose a <u>MA</u>tching-based <u>P</u>ricing <u>S</u>trategy (MAPS) with guaranteed bound. Extensive experiments conducted on the synthetic and real datasets demonstrate the effectiveness of MAPS.

References

  1. Mohammad Asghari, Dingxiong Deng, Cyrus Shahabi, Ugur Demiryurek, and Yaguang Li. 2016. Price-aware Real-time Ride-sharing at Scale: An Auction-based Approach GIS 2016. 3:1--3:10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer. 2002. Finite-time Analysis of the Multiarmed Bandit Problem. Machine Learning, Vol. 47, 2--3 (2002), 235--256. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Moshe Babaioff, Shaddin Dughmi, Robert D. Kleinberg, and Aleksandrs Slivkins. 2011 b. Dynamic Pricing with Limited Supply. ACM Transactions on Economics and Computation, Vol. 3, 1 (2011), 4:1--4:26. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Moshe Babaioff, Shaddin Dughmi, and Alex Slivkins. 2011 a. Detail-free, Posted-Price Mechanisms for Limited Supply Online Auctions Workshop on Bayesian Mechanism Design 2011.Google ScholarGoogle Scholar
  5. Richard E. Barlow, Albert W. Marshall, and Frank Proschan. 1963. Properties of Probability Distributions with Monotone Hazard Rate. The Annals of Mathematical Statistics (1963), 375--389.Google ScholarGoogle Scholar
  6. Omar Besbes and Assaf J. Zeevi. 2009. Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms. Operations Research, Vol. 57, 6 (2009), 1407--1420. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Avrim Blum, Vijay Kumar, Atri Rudra, and Felix Wu. 2003. Online Learning in Online Auctions. In SODA 2003. 202--204. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Gruia Cualinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. 2007. Maximizing a Submodular Set Function Subject to a Matroid Constraint IPCO 2007. 182--196. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Lei Chen and Cyrus Shahabi. 2016. Spatial Crowdsourcing: Challenges and Opportunities. IEEE Data Engineering Bulletin Vol. 39, 4 (2016), 14--25.Google ScholarGoogle Scholar
  10. Zhao Chen, Rui Fu, Ziyuan Zhao, Zheng Liu, Leihao Xia, Lei Chen, Peng Cheng, Caleb Chen Cao, Yongxin Tong, and Chen Jason Zhang. 2014. gMission: A General Spatial Crowdsourcing Platform. PVLDB, Vol. 7, 13 (2014), 1629--1632. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Anand Inasu Chittilappilly, Lei Chen, and Sihem Amer-Yahia. 2016. A Survey of General-Purpose Crowdsourcing Techniques. IEEE Transactions on Knowledge and Data Engineering, Vol. 28, 9 (2016), 2246--2266. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Fan R. K. Chung and Lincoln Lu. 2006. Survey: Concentration Inequalities and Martingale Inequalities: A Survey. Internet Mathematics, Vol. 3, 1 (2006), 79--127.Google ScholarGoogle ScholarCross RefCross Ref
  13. Nilesh N. Dalvi and Dan Suciu. 2007. Management of Probabilistic Data: Foundations and Challenges PODS 2007. 1--12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Dingxiong Deng, Cyrus Shahabi, and Ugur Demiryurek. 2013. Maximizing the Number of Worker's Self-selected Tasks in Spatial Crowdsourcing GIS 2013. 324--333. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Dingxiong Deng, Cyrus Shahabi, and Linhong Zhu. 2015. Task Matching and Scheduling for Multiple Workers in Spatial Crowdsourcing GIS 2015. 21:1--21:10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Nikhil R. Devanur and Jason D. Hartline. 2009. Limited and Online Supply and the Bayesian Foundations of Prior-free Mechanism Design EC 2009. 41--50. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, and Vijay V. Vazirani. 2008. Market Equilibrium via a Primal-dual Algorithm for a Convex ProgramJ. ACM Vol. 55, 5 (2008), 22:1--22:18. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Eugene F. Fama. 1998. Market Efficiency, Long-term Returns, and Behavioral Finance1. Journal of Financial Economics Vol. 49, 3 (1998), 283--306.Google ScholarGoogle ScholarCross RefCross Ref
  19. Hector Garcia-Molina, Manas Joglekar, Adam Marcus, Aditya G. Parameswaran, and Vasilis Verroios. 2016. Challenges in Data Crowdsourcing. IEEE Transactions on Knowledge and Data Engineering, Vol. 28, 4 (2016), 901--911. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Shawn R. Jeffery, Minos N. Garofalakis, and Michael J. Franklin. 2006. Adaptive Cleaning for RFID Data Streams. In VLDB 2006. 163--174. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Leyla Kazemi and Cyrus Shahabi. 2012. GeoCrowd: Enabling Query Answering with Spatial Crowdsourcing GIS 2012. 189--198. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Frank Kelly. 1997. Charging and Rate Control for Elastic Traffic. European Transactions on Telecommunications, Vol. 8, 1 (1997), 33--37.Google ScholarGoogle ScholarCross RefCross Ref
  23. Robert D. Kleinberg and Frank Thomson Leighton. 2003. The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions FOCS 2003. 594--605. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Guoliang Li, Jiannan Wang, Yudian Zheng, and Michael J. Franklin. 2016. Crowdsourced Data Management: A Survey. IEEE Transactions on Knowledge and Data Engineering, Vol. 28, 9 (2016), 2296--2319. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Guoliang Li, Yudian Zheng, Ju Fan, Jiannan Wang, and Reynold Cheng. 2017. Crowdsourced Data Management: Overview and Challenges SIGMOD 2017. 1711--1716. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. JiaXu Liu, Yudian Ji, Weifeng Lv, and Ke Xu. 2017. Budget-Aware Dynamic Incentive Mechanism in Spatial Crowdsourcing. Journal of Computer Science and Technology Vol. 32, 5 (2017), 890--904.Google ScholarGoogle ScholarCross RefCross Ref
  27. Mohamed Musthag and Deepak Ganesan. 2013. Labor Dynamics in a Mobile Micro-task Market. In CHI 2013. 641--650. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Roger B. Myerson. 1981. Optimal Auction Design. Mathematics of Operations Research Vol. 6, 1 (1981), 58--73. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Paat Rusmevichientong, Benjamin Van Roy, and Peter W. Glynn. 2006. A Nonparametric Approach to Multiproduct Pricing. Operations Research, Vol. 54, 1 (2006), 82--98. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Yaron Singer and Manas Mittal. 2013. Pricing Mechanisms for Crowdsourcing Markets. In WWW 2013. 1157--1166. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Adish Singla and Andreas Krause. 2013. Truthful Incentives in Crowdsourcing Tasks Using Regret Minimization Mechanisms WWW 2013. 1167--1178. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Tianshu Song, Yongxin Tong, Libin Wang, Jieying She, Bin Yao, Lei Chen, and Ke Xu. 2017. Trichromatic Online Matching in Real-Time Spatial Crowdsourcing ICDE 2017. 1009--1020.Google ScholarGoogle Scholar
  33. Hien To, Gabriel Ghinita, and Cyrus Shahabi. 2014. A Framework for Protecting Worker Location Privacy in Spatial Crowdsourcing. PVLDB, Vol. 7, 10 (2014), 919--930. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Yongxin Tong, Lei Chen, and Cyrus Shahabi. 2017 a. Spatial Crowdsourcing: Challenges, Techniques, and Applications. PVLDB, Vol. 10, 12 (2017), 1988--1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Yongxin Tong, Jieying She, Bolin Ding, Lei Chen, Tianyu Wo, and Ke Xu. 2016 a. Online Minimum Matching in Real-Time Spatial Data: Experiments and Analysis. PVLDB, Vol. 9, 12 (2016), 1053--1064. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Yongxin Tong, Jieying She, Bolin Ding, Libin Wang, and Lei Chen. 2016 b. Online Mobile Micro-Task Allocation in Spatial Crowdsourcing ICDE 2016. 49--60.Google ScholarGoogle Scholar
  37. Yongxin Tong, Libin Wang, Zimu Zhou, Bolin Ding, Lei Chen, Jieping Ye, and Ke Xu. 2017 b. Flexible Online Task Assignment in Real-Time Spatial Data. PVLDB, Vol. 10, 11 (2017), 1334--1345. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Luan Tran, Hien To, Liyue Fan, and Cyrus Shahabi. 2018. A Real-Time Framework for Task Assignment in Hyperlocal Spatial Crowdsourcing. ACM Transactions on Intelligent Systems and Technology, Vol. 9, 3 (2018), 37:1--37:26. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Dynamic Pricing in Spatial Crowdsourcing: A Matching-Based Approach

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGMOD '18: Proceedings of the 2018 International Conference on Management of Data
      May 2018
      1874 pages
      ISBN:9781450347037
      DOI:10.1145/3183713

      Copyright © 2018 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 27 May 2018

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      SIGMOD '18 Paper Acceptance Rate90of461submissions,20%Overall Acceptance Rate785of4,003submissions,20%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader