Ad hoc WLAN with selfish, secretive, and short-sighted stations

Since the possibility of selfish MAC-layer misbehavior of wireless stations became apparent, game-theoretic solutions combining incentive compatibility with high bandwidth utilization have been sought. Existing studies e.g., of IEEE 802.11 DCF or S-ALOHA, mostly rely on stations' unique identities and farsightedness (fear of punishment or discounting future utilities). In contrast, we model selfish stations as both secretive (unwilling to betray identity) and short-sighted. We study a contention scheme called session-level bidding in terms of a Bayesian (incomplete-information) game and analyze the stations' utilities and network throughput arising at a symmetrical Bayesian equilibrium.