IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v48y2023i3p1522-1552.html
   My bibliography  Save this article

Truthfulness of a Network Resource-Sharing Protocol

Author

Listed:
  • Yukun Cheng

    (School of Business, Suzhou University of Science and Technology, Suzhou, Jiangsu 215009, China)

  • Xiaotie Deng

    (Center of Frontier on Computer Studies, Peking University, Beijing 100871, China)

  • Qi Qi

    (Gaoling School of Artificial Intelligence, Renmin University of China, Beijing 100872, China)

  • Xiang Yan

    (Theoretical Computer Science Laboratory, Huawei, Shanghai 201206, China)

Abstract

We consider a sharing economy over a network in which each vertex agent allocates resources to its neighbors in response to their contributions. General equilibrium theory can be applied here to solve the problem of deciding how to fairly and efficiently allocate resources among agents as resource sharing over the network can be modeled as a pure exchange economy. It is known that proportional sharing dynamics converges to a market equilibrium solution. We are particularly interested in proportional sharing dynamics as a mechanism for network resource sharing. Our focus is on the key issue in internet market design: whether an agent may manipulate its report of its own private information to gain more resources under this mechanism. This work establishes the first mathematical proof that such a practical distributed network resource-sharing protocol is truthful against the manipulative strategies of feasible weight misreporting and edge deletion applied both individually and together.

Suggested Citation

  • Yukun Cheng & Xiaotie Deng & Qi Qi & Xiang Yan, 2023. "Truthfulness of a Network Resource-Sharing Protocol," Mathematics of Operations Research, INFORMS, vol. 48(3), pages 1522-1552, August.
    • Handle: RePEc:inm:ormoor:v:48:y:2023:i:3:p:1522-1552
    DOI: 10.1287/moor.2022.1310
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.1310
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.1310?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:ormoor:v:48:y:2023:i:3:p:1522-1552. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.