CSMA Local Area Networking under Dynamic Altruism
Panayotis Antoniadis, Serge Fdida, Christopher Griffin, Youngmi Jin,, George Kesidis

TL;DR
This paper models LAN medium access control using a non-cooperative game with dynamic altruism, analyzing how altruistic behavior influences network performance under various conditions.
Contribution
It introduces a game-theoretic framework incorporating dynamic altruism into LAN access control analysis, extending prior protocol-based models.
Findings
Altruism can improve performance during congestion.
Excessive altruism may cause underutilization of the channel.
Effects vary with user homogeneity and cost models.
Abstract
In this paper, we consider medium access control of local area networks (LANs) under limited-information conditions as befits a distributed system. Rather than assuming "by rule" conformance to a protocol designed to regulate packet-flow rates (e.g., CSMA windowing), we begin with a non-cooperative game framework and build a dynamic altruism term into the net utility. The effects of altruism are analyzed at Nash equilibrium for both the ALOHA and CSMA frameworks in the quasistationary (fictitious play) regime. We consider either power or throughput based costs of networking, and the cases of identical or heterogeneous (independent) users/players. In a numerical study we consider diverse players, and we see that the effects of altruism for similar players can be beneficial in the presence of significant congestion, but excessive altruism may lead to underuse of the channel when demand is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications · Economic theories and models · Economic Policies and Impacts
