based on a generalized two-hop relay with limited packet redundancy f (f-cast) for packet
routing. We formulate such problem as a forwarding game, where each node i individually
decides a probability τ i (ie, a strategy) to deliver out its own traffic and helps to forward other
traffic with probability 1-τ i, τ i∈[0, 1], while its payoff is the achievable throughput capacity of
its own traffic. We derive closed-form result for the per node throughput capacity (ie, payoff …