In this paper we study resource allocation in decentralized information local public good networks. A network is a local public good network if each user's actions directly affect the utility of an arbitrary subset of network users. We consider networks where each user knows only that part of the network that either affects or is affected by it. Furthermore, each user's utility and action space are its private information, and each user is a self utility maximizer. This network model is motivated by several applications including wireless communications. For this network model we formulate a decentralized resource allocation problem and develop a decentralized resource allocation mechanism (game form) that possesses the following properties: (i) All Nash equilibria of the game induced by the mechanism result in allocations that are optimal solutions of the corresponding centralized resource allocation problem (Nash implementation). (ii) All users voluntarily participate in the allocation process specified by the mechanism (individual rationality). (iii) The mechanism results in budget balance at all Nash equilibria and off equilibrium.

We study multicarrier on-off keying (MCOOK) for fast frequency-hopping (FFH) multiple-access systems. The performance of a sub-optimum receiver is analyzed for Rayleigh fading channels and a closed form expression for bit error rate (BER) has been derived for the binary case. We find that the number of chips per symbol required to optimize the perfor- mance of the system varies from system to system. Comparison with FFH M-ary frequency shift keying (MFSK) shows that in the interference-limited region (large MAI), MCOOK performs better than MFSK and further, the gain in the performance increases with increase in the value of modulation index M.