Abstract
In a resource exchange system, resources are shared among multiple interconnected peers. Peers act as both suppliers and customers of resources by making a certain amount of their resources directly available to other network participants. Their utilities are determined by the total amount of resources received from all neighbors. According to a preset mechanism, the allocation of the shared resources depends on the information that agents submit to the mechanism. The participating agents, however, may try to strategically manipulate its submitted information to influence the allocation with the expectation of its utility improvement. In this paper, we consider the tit-for-tat popular proportional response mechanism and discuss the incentives an agent may lie, by a vertex splitting strategy. We apply the concept of incentive ratio to characterize the multiplication factor by which utility of an agent can be increased with the help of the vertex splitting strategy. Because of the bounded rationality in the decentralized resource exchange system, a smaller incentive ratio makes the agents have the less incentive to play strategically. However the incentive ratio is proved to be unbounded in linear exchange market recently. In this paper we focus on the setting on trees, our linear exchange market proves to have the incentive ratio of exact two under the proportional response mechanism against the vertex splitting strategic behaviors of participating agents.
This is a preview of subscription content, log in via an institution to check access.
References
Adsul, B., Babu, C.S., Garg, J., Mehta, R., Sohoni, M.: Nash equilibria in fisher market. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 30–41. Springer, Heidelberg (2010). doi:10.1007/978-3-642-16170-4_4
Alkalay, C., Vetta, A.: False-name bidding and economic efficiency in combinatorial auctions. In: AAAI, pp. 538–544 (2014)
Braanzei, S., Chen, Y.L., Deng, X.T., Filos-Ratsikas, A., Kristoffer, S., Frederiksen, S., Zhang, J.: The fisher market game: equilibrium and welfare. In: AAAI (2014)
Chen, N., Deng, X., Zhang, H., Zhang, J.: Incentive ratios of fisher markets. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 464–475. Springer, Heidelberg (2012). doi:10.1007/978-3-642-31585-5_42
Chen, N., Deng, X., Zhang, J.: How profitable are strategic behaviors in a market? In: Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 106–118. Springer, Heidelberg (2011). doi:10.1007/978-3-642-23719-5_10
Cheng, Y., Deng, X., Pi, Y., Yan, X.: Can bandwidth sharing be truthful? In: Hoefer, M. (ed.) SAGT 2015. LNCS, vol. 9347, pp. 190–202. Springer, Heidelberg (2015). doi:10.1007/978-3-662-48433-3_15
Cheng, Y., Deng, X., Qi, Q., Yan, X.: Truthfulness of a proportional sharing mechanism in resource exchange. In: IJCAI, pp. 187–193 (2016)
Dalakov, G.: History of Computers and Computing, Internet, Internet conquers the world, BitTorrent. http://historycomputer.com/Internet/Conquering/BitTorrent.html
Feldman, M., Lai, K., Stoica, I., et al.: Robust incentive techniques for peer-to-peer networks. In: Proceedings of the 5th ACM conference on Electronic commerce, pp. 102–111. ACM (2004)
Georgiadis, L., Iosifidisy, G., Tassiulas, L.: Exchange of services in networks: competition, cooperation, and fairness. In: Proceedings of the 2015 ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2015), pp. 43–56 (2015)
Iwasaki, A., Conitzer, V., Omori, Y., et al.: Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, vol. 1. International Foundation for Autonomous Agents and Multiagent Systems, pp. 633–640 (2010)
Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999). doi:10.1007/3-540-49116-3_38
Polak, I.: The incentive ratio in exchange economies. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 685–692. Springer, Cham (2016). doi:10.1007/978-3-319-48749-6_49
Schollmeier, R.: A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications. In: 2001 Proceedings of First International Conference on Peer-to-Peer Computing, pp. 101–102. IEEE (2001)
Schor, J.: Debating the sharing economy. J. Self-Gov. Manag. Econ. 4(3), 7–22 (2016)
Roughgarden, T., Tardos, E.: How bad is selfish routing. J. ACM 49(2), 236–259 (2002)
Wu, F., Zhang, L.: Proportional response dynamics leads to market equilibrium. In: STOC, pp. 354–363 (2007)
Yokoo, M.: False-name bids in combinatorial auctions. ACM SIGecom Exchanges 7(1), 1–4 (2007)
Yokoo, M., Sakurai, Y., Matsubara, S.: The effect of false-name bids in combinatorial auctions: new fraud in Internet auctions. Games Econ. Behav. 46, 174–188 (2004)
Acknowledgments
This research was partially supported by the National Nature Science Foundation of China (Nos. 11301475, 11426026, 61632017, 61173011), by a Project 985 grant of Shanghai Jiao Tong University, and by the Research Grant Council of Hong Kong (ECS Project No. 26200314, GRF Project No. 16213115 and GRF Project No. 16243516).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Chen, Z., Cheng, Y., Deng, X., Qi, Q., Yan, X. (2017). Agent Incentives of Strategic Behavior in Resource Exchange. In: Bilò, V., Flammini, M. (eds) Algorithmic Game Theory. SAGT 2017. Lecture Notes in Computer Science(), vol 10504. Springer, Cham. https://doi.org/10.1007/978-3-319-66700-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-66700-3_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66699-0
Online ISBN: 978-3-319-66700-3
eBook Packages: Computer ScienceComputer Science (R0)