  The problem of how to achieve cooperation among rational peers in order to
discourage free riding is one that has received a lot of attention in
peer-to-peer computing and is still an important one. The field of game theory
is applied to the task of finding solutions that will encourage cooperation
while discouraging free riding. The cooperative conduct of peers is typically
portrayed as a traditional version of the game known as the "Prisoners'
Dilemma." It is common knowledge that if two peers engage in a situation known
as the Prisoner's Dilemma more than once, collaboration can be achieved through
the use of punishment. Nevertheless, this is not the case when there is only
one interaction between peers. This short article demonstrates that Kantian
peers prefer to cooperate and attain social welfare even when they interacted
only once. This, dissuade peers from freeriding.
