Agent incentives of strategic behavior in resource exchange

Abstract In this paper, we focus on the resource exchange over networks with autonomous participants (or agents), which goes beyond the peer-to-peer (P2P) bandwidth sharing idea. In such a resource exchange system, participants act as both suppliers and consumers of resources. Each agent obtains the utility by exchanging its resources with its neighbors according to the preset rules. However, agents may play strategically to improve their utilities by influencing the allocation, since the allocation find depends on what they submit. We consider a tit-for-tat popular proportional response dynamics and discuss the sybil attack strategy, which is a grave threat in P2P system. We are interested in the robustness of the proportional response dynamics in withstanding such a strategy. In this work, we prove that when the underlying network of a resource exchange system is a tree, any unilateral sybil attack could gain no more than twice as much utility.

[1]  Xiaotie Deng,et al.  Can Bandwidth Sharing Be Truthful? , 2015, SAGT.

[2]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[3]  P. Pardalos,et al.  Pareto optimality, game theory and equilibria , 2008 .

[4]  Leandros Tassiulas,et al.  Exchange of Services in Networks , 2015, SIGMETRICS.

[5]  Ion Stoica,et al.  Robust incentive techniques for peer-to-peer networks , 2004, EC '04.

[6]  Rüdiger Schollmeier,et al.  A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications , 2001, Proceedings First International Conference on Peer-to-Peer Computing.

[7]  Fang Wu,et al.  Proportional response dynamics leads to market equilibrium , 2007, STOC '07.

[8]  J. Schor DEBATING THE SHARING ECONOMY , 2016 .

[9]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[10]  Ido Polak The Incentive Ratio in Exchange Economies , 2016, COCOA.

[11]  Panos M. Pardalos,et al.  A new game of information sharing and security investment between two allied firms , 2018, Int. J. Prod. Res..

[12]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[13]  Ning Chen,et al.  Incentive Ratios of Fisher Markets , 2012, ICALP.

[14]  Adrian Vetta,et al.  False-Name Bidding and Economic Efficiency in Combinatorial Auctions , 2014, AAAI.

[15]  Ning Chen,et al.  How Profitable Are Strategic Behaviors in a Market? , 2011, ESA.

[16]  Panos M. Pardalos,et al.  A game-theoretic analysis of information security investment for multiple firms in a network , 2017, J. Oper. Res. Soc..

[17]  Vincent Conitzer,et al.  Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms , 2010, AAMAS.

[18]  Makoto Yokoo,et al.  False-name bids in combinatorial auctions , 2007, SECO.

[19]  Xiaotie Deng,et al.  Truthfulness of a Proportional Sharing Mechanism in Resource Exchange , 2016, IJCAI.

[20]  Makoto Yokoo,et al.  The effect of false-name bids in combinatorial auctions: new fraud in internet auctions , 2004, Games Econ. Behav..

[21]  Ruta Mehta,et al.  Nash Equilibria in Fisher Market , 2010, SAGT.