[1] Feldman, M., Lai, K., Stoica, I.:Robust incentive techniques for peer-to-peer networks. In:Breese, J., Feigenbaum, J., Seltzer, M. (eds.) Association for Computing Machinery Electronic Commerce, 5th ACM Conference on Electronic Commerce, pp. 102-111. ACM, New York (2004) [2] Schollmeier, R.:A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications. In:Proceedings of the First International Conference on Peer-to-peer Computing, 2001. IEEE, pp. 101-102(2001) [3] Wu, F., Zhang, L.:Proportional response dynamics leads to market equilibrium. In:Johnson, D., Feige, U. (eds.) ACM-Symposium on Theory of Computing, 39th Annual ACM Symposium on Theory of Computing, pp. 354-363. ACM, New York (2007) [4] Cheng, Y., Deng, X., Pi, Y., Yan, X.:Can bandwidth sharing be truthful? In:Hoefer M. (eds) Algorithmic Game Theory. SAGT 2015. Lecture Notes in Computer Science, vol 9347, pp. 190-202. Springer, Berlin, Heidelberg (2015) [5] Cheng, Y., Deng, X., Qi, Q., Yan, X.:Truthfulness of a proportional sharing mechanism in resource exchange. In:Kambhampati, S. (eds) International Joint Conference on Artificial Intelligence. 25th International Joint Conference on Artificial Intelligence, pp. 187-193. AAAI Press, New York (2016) [6] Chen, Z., Cheng, Y., Deng, X., Qi, Q., Yan, X.:Agent incentives of strategic behavior in resource exchange. In:Bilò V., Flammini M. (eds) Algorithmic Game Theory. 10th International Symposium on Algorithmic Game Theory 2017. Lecture Notes in Computer Science, vol 10504. Springer, Cham (2017) [7] Chen, Z., Cheng, Y., Deng, X., Qi, Q., Yan, X.:Limiting User's Sybil Attack in Resource Sharing. In:R. Devanur N., Lu P. (eds) Web and Internet Economics. The 13th Conference on Web and Internet Economics 2017. Lecture Notes in Computer Science, vol. 10660, Springer, Cham (2017) [8] Chen, Z., Cheng, Y., Deng, X., Qi, Q., Yan X.:Incentive ratios of a proportional sharing mechanism in resource sharing. In:Cao Y., Chen J. (eds) Computing and Combinatorics. The 23rd Annual International Computing and Combinatorics Conference 2017. Lecture Notes in Computer Science, vol 10392. Springer, Cham (2017) [9] Chen, N., Deng, X., Zhang, J.:How profitable are strategic behaviors in a market? In:Demetrescu, C., Halldórsson, M. (eds.) European Symposium on Algorithms, 19th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 6942, pp. 106-118. Springer, Heidelberg (2011) [10] Adsul,B.,Babu,C.,Garg,J.,Mehta,R.,Sohoni,M.:Nashequilibriainfishermarket.In:Kontogiannis, S., Koutsoupias, E., Spirakis, P. (eds.) Algorithmic Game Theory. 3rd International Symposium on Algorithmic Game Theory 2010, Lecture Notes in Computer Science, vol. 6386, pp. 30-41. Springer, Heidelberg (2010) [11] Braanzei, S., Chen, Y., Deng, X., Filos-Ratsikas, A., Kristoffer, S., Frederiksen, S., Zhang, J.:The fisher market game:equilibrium and welfare. In:Brodley, C., Stone, P. (eds) AAAI Conference on Artificial Intelligence. 28th AAAI Conference on Artificial Intelligence 2014, AAAI Press, Québec, (2014) [12] Sybil attack. https://en.wikipedia.org/wiki/Sybil-attack [13] Douceur, J.:The sybil attack. In:Druschel, P., Kaashoek, M., Rowstron, A. (eds) International Workshop on Peer-to-Peer Systems. 1st International Workshop on Peer-to-Peer Systems 2002. Lecture Notes in Computer Science, vol 2429, Springer, Heidelberg (2002) [14] 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) [15] Alkalay, C., Vetta, A.:False-name bidding and economic efficiency in combinatorial auctions. In:AAAI, pp. 538-544(2014) [16] Iwasaki, A., Conitzer, V., Omori, Y.:Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms. In:9th International Conference on Autonomous Agents and Multiagent Systems, pp. 633-640(2010) [17] Yokoo, M.:False-name bids in combinatorial auctions. ACM SIGecom Exch. 7(1), 1-4(2007) [18] Chen, N., Deng, X., Zhang, H.:Incentive ratios of fisher markets. In:Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) International Colloquium on Automata, Languages and Programming, 39th InternationalColloquiumInternationalColloquiumonAutomata,LanguagesandProgramming2012. Lecture Notes in Computer Science, vol. 7391, pp. 464-475. Springer, Heidelberg (2012) [19] Polak, I.:The incentive ratio in exchange economies. In:Chan, T.-H., Li, M., Wang, L. (eds.) International Conference on Combinatorial Optimization and Applications, 10th International Conference International Conference on Combinatorial Optimization and Applications 2016. Lecture Notes in Computer Science, vol. 10043, pp. 685-692. Springer, Heidelberg (2016) [20] Arrow, K. J., Debreu, G.:Existence of an equilibrium for a competitive economy. Econom. J. Econom. Soc. 265-290(1954) [21] Devanur, N.R., Papadimitriou, C.H., Saberi, A., Vazirani, V.V.:Market equilibrium via a primal-dualtype algorithm. In:Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 389-395. IEEE (2002) [22] Duan, R., Garg, J., Mehlhorn, K.:An improved combinatorial polynomial algorithm for the linear Arrow-Debreu market. In:Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium On Discrete Algorithms, pp. 90-106(2016) [23] Jain, K., Mahdian, M., Saberi, A.:Approximating market equilibria. In:Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 98-108(2003) [24] Ye, Y.:A path to the Arrow-Debreu competitive market equilibrium. Math. Program. 111(1-2), 315-348(2008) [25] Eaves, B.C.:Finite solution of pure trade markets with Cobb-Douglas utilities. In:Economic Equilibrium:Model Formulation and Solution, pp. 226-239(1985) [26] Codenotti, B., Pemmaraju, S., Varadarajan, K.:On the polynomial time computation of equilibria for certain exchange economies. In:Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 72-81(2005) [27] Codenotti, B., McCune, B., Varadarajan, K.:Market equilibrium via the excess demand function. In:Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 74-83(2005) |