IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2009.06117.html
   My bibliography  Save this paper

The Platform Design Problem

Author

Listed:
  • Christos Papadimitriou
  • Kiran Vodrahalli
  • Mihalis Yannakakis

Abstract

On-line firms deploy suites of software platforms, where each platform is designed to interact with users during a certain activity, such as browsing, chatting, socializing, emailing, driving, etc. The economic and incentive structure of this exchange, as well as its algorithmic nature, have not been explored to our knowledge. We model this interaction as a Stackelberg game between a Designer and one or more Agents. We model an Agent as a Markov chain whose states are activities; we assume that the Agent's utility is a linear function of the steady-state distribution of this chain. The Designer may design a platform for each of these activities/states; if a platform is adopted by the Agent, the transition probabilities of the Markov chain are affected, and so is the objective of the Agent. The Designer's utility is a linear function of the steady state probabilities of the accessible states minus the development cost of the platforms. The underlying optimization problem of the Agent -- how to choose the states for which to adopt the platform -- is an MDP. If this MDP has a simple yet plausible structure (the transition probabilities from one state to another only depend on the target state and the recurrent probability of the current state) the Agent's problem can be solved by a greedy algorithm. The Designer's optimization problem (designing a custom suite for the Agent so as to optimize, through the Agent's optimum reaction, the Designer's revenue), is NP-hard to approximate within any finite ratio; however, the special case, while still NP-hard, has an FPTAS. These results generalize from a single Agent to a distribution of Agents with finite support, as well as to the setting where the Designer must find the best response to the existing strategies of other Designers. We discuss other implications of our results and directions of future research.

Suggested Citation

  • Christos Papadimitriou & Kiran Vodrahalli & Mihalis Yannakakis, 2020. "The Platform Design Problem," Papers 2009.06117, arXiv.org, revised Jul 2021.
    • Handle: RePEc:arx:papers:2009.06117
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2009.06117
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    2. Yishay Mansour & Aleksandrs Slivkins & Vasilis Syrgkanis, 2019. "Bayesian Incentive-Compatible Bandit Exploration," Operations Research, INFORMS, vol. 68(4), pages 1132-1161, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jianwen Ren & Yingqiang Xu & Shiyuan Wang, 2018. "A Distributed Robust Dispatch Approach for Interconnected Systems with a High Proportion of Wind Power Penetration," Energies, MDPI, vol. 11(4), pages 1-18, April.
    2. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    3. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    4. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.
    5. Sarhadi, Hassan & Naoum-Sawaya, Joe & Verma, Manish, 2020. "A robust optimization approach to locating and stockpiling marine oil-spill response facilities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    6. Li, Shukai & Liu, Ronghui & Yang, Lixing & Gao, Ziyou, 2019. "Robust dynamic bus controls considering delay disturbances and passenger demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 88-109.
    7. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    8. Akhtar Hussain & Van-Hai Bui & Hak-Man Kim, 2016. "Robust Optimization-Based Scheduling of Multi-Microgrids Considering Uncertainties," Energies, MDPI, vol. 9(4), pages 1-21, April.
    9. M. J. Naderi & M. S. Pishvaee, 2017. "Robust bi-objective macroscopic municipal water supply network redesign and rehabilitation," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 31(9), pages 2689-2711, July.
    10. Kandpal, Bakul & Pareek, Parikshit & Verma, Ashu, 2022. "A robust day-ahead scheduling strategy for EV charging stations in unbalanced distribution grid," Energy, Elsevier, vol. 249(C).
    11. Jun-ya Gotoh & Michael Jong Kim & Andrew E. B. Lim, 2020. "Worst-case sensitivity," Papers 2010.10794, arXiv.org.
    12. Guo, Shiliang & Li, Pengpeng & Ma, Kai & Yang, Bo & Yang, Jie, 2022. "Robust energy management for industrial microgrid considering charging and discharging pressure of electric vehicles," Applied Energy, Elsevier, vol. 325(C).
    13. Zhang, Hanxiao & Li, Yan-Fu, 2022. "Robust optimization on redundancy allocation problems in multi-state and continuous-state series–parallel systems," Reliability Engineering and System Safety, Elsevier, vol. 218(PA).
    14. Evers, L. & Dollevoet, T.A.B. & Barros, A.I. & Monsuur, H., 2011. "Robust UAV Mission Planning," Econometric Institute Research Papers EI 2011-07, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    15. Shen, Feifei & Zhao, Liang & Wang, Meihong & Du, Wenli & Qian, Feng, 2022. "Data-driven adaptive robust optimization for energy systems in ethylene plant under demand uncertainty," Applied Energy, Elsevier, vol. 307(C).
    16. Baringo, Luis & Boffino, Luigi & Oggioni, Giorgia, 2020. "Robust expansion planning of a distribution system with electric vehicles, storage and renewable units," Applied Energy, Elsevier, vol. 265(C).
    17. Mohammad Reza Ghatreh Samani & Seyyed-Mahdi Hosseini-Motlagh, 2021. "A robust framework for designing blood network in disaster relief: a real-life case," Operational Research, Springer, vol. 21(3), pages 1529-1568, September.
    18. Thomas Schmitt & Tobias Rodemann & Jürgen Adamy, 2021. "The Cost of Photovoltaic Forecasting Errors in Microgrid Control with Peak Pricing," Energies, MDPI, vol. 14(9), pages 1-13, April.
    19. Hasani, Aliakbar & Khosrojerdi, Amirhossein, 2016. "Robust global supply chain network design under disruption and uncertainty considering resilience strategies: A parallel memetic algorithm for a real-life case study," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 20-52.
    20. Ruiwei Jiang & Siqian Shen & Yiling Zhang, 2017. "Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations," Operations Research, INFORMS, vol. 65(6), pages 1638-1656, December.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2009.06117. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.