TY - GEN
T1 - The Sharing-Mart System
T2 - 2nd International ICST Conference on Game Theory in Networks, GAMENETS 2011
AU - Leberknight, Christopher
AU - Pal, Ranjan
AU - Chiang, Mung
AU - Poor, Harold Vincent
PY - 2012
Y1 - 2012
N2 - This paper introduces Sharing-Mart (S-Mart), an online digital trading platform developed at Princeton University to perform social file sharing experiments on top of technological networks as overlays. It describes the S-Mart system, the experiments conducted, and incentivization aspects which can be investigated using S-Mart. In the first part of the paper, the S-Mart system and the experiments conducted are explained, and the economic behaviors and dynamics of package auctions run on S-Mart are described. The major experimental observation that stands out here is that Internet users are less incentivized to share content on competitive applications, whose success depends on the co-operation of other users in the system. To alleviate incentivization issues in these applications, in the second part of the paper a mathematical framework is proposed that derives user population threshold values, which hint at the necessity of a certain base population strength in S-Mart for co-operation to take place amongst all the users. An outline of two experiments to validate the theory is presented.
AB - This paper introduces Sharing-Mart (S-Mart), an online digital trading platform developed at Princeton University to perform social file sharing experiments on top of technological networks as overlays. It describes the S-Mart system, the experiments conducted, and incentivization aspects which can be investigated using S-Mart. In the first part of the paper, the S-Mart system and the experiments conducted are explained, and the economic behaviors and dynamics of package auctions run on S-Mart are described. The major experimental observation that stands out here is that Internet users are less incentivized to share content on competitive applications, whose success depends on the co-operation of other users in the system. To alleviate incentivization issues in these applications, in the second part of the paper a mathematical framework is proposed that derives user population threshold values, which hint at the necessity of a certain base population strength in S-Mart for co-operation to take place amongst all the users. An outline of two experiments to validate the theory is presented.
KW - Auctions
KW - Incentives
KW - Sharing-Mart
UR - http://www.scopus.com/inward/record.url?scp=84869594178&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-30373-9_11
DO - 10.1007/978-3-642-30373-9_11
M3 - Conference contribution
AN - SCOPUS:84869594178
SN - 9783642303722
T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
SP - 153
EP - 168
BT - Game Theory for Networks - Second International ICST Conference, GAMENETS 2011, Revised Selected Papers
Y2 - 16 April 2011 through 18 April 2011
ER -