Strategic Contention Resolution in Multiple Channels

  title={Strategic Contention Resolution in Multiple Channels},
  author={George Christodoulou and Themistoklis Melissourgos and Paul G. Spirakis},
We consider the problem of resolving contention in communication networks with selfish users. In a contention game each of \(n \ge 2\) identical players has a single information packet that she wants to transmit using one of \(k \ge 1\) multiple-access channels. To do that, a player chooses a slotted-time protocol that prescribes the probabilities with which at a given time-step she will attempt transmission at each channel. If more than one players try to transmit over the same channel… 
Algorithms and complexity of problems arising from strategic settings
This thesis deals with an evolutionary setting where it is shown that for a wide range of symmetric bimatrix games, deciding ESS existence is intractable, and presents a general framework for constructing approximation schemes for problems that can be written as an Existential Theory of the Reals formula with variables constrained in a bounded convex set.


Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback
The model and results of the single-channel case studied in [2] are extended by providing equilibria characterizations for more than one channels, and giving specific anonymous, equilibrium protocols with finite and infinite expected latency.
Contention Resolution under Selfishness
This paper presents asymptotically optimal contention resolution protocols that are robust to selfish users, in two different channel feedback models, and gives a protocol that has expected cost Θ(n+clogn) and is in o-equilibrium, where n is the number of users.
Strategic Contention Resolution with Limited Feedback
This paper focuses on \emph{acknowledgment-based} protocols, where a user gets feedback from the channel only when she attempts transmission, and provides an age-based equilibrium protocol, which has infinite expected finishing time, but every player finishes in linear time with high probability.
A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback
A 3-player age-based protocol that can prevent users from unilaterally deviating to a persistent protocol in order to decrease their expected transmission time and it is shown that this protocol is preferable to any deadline protocol in which, after some fixed time, attempt transmission with probability 1 in every subsequent step.
Efficient contention resolution protocols for selfish agents
A very simple protocol for the agents that is in Nash equilibrium and is also very efficient --- other than with exponentially negligible probability --- all n agents will successfully transmit within cn time, for some small constant c.
Modeling and Analysis of Generalized Slotted-Aloha MAC Protocols in Cooperative, Competitive and Adversarial Environments
Modelling and evaluating the throughput that can be achieved in a system where nodes compete for bandwidth using a generalized version of slotted- Aloha protocols reveals that under heavy loads, greedy strategies reduce the utilization, and that attackers cannot do much better than attacking during randomly selected slots.
Analysis of Backoff Protocols for Multiple Access Channels
It is proved that binary exponential backoff is unstable if the arrival rate of new messages at each station is $\lam/N$ for any $\lam >{1\over 2}$ and the number of stations N, is sufficiently large.
Generalized TDMA: The Multi-Accessing Tree Protocol
The tree algorithm, a new basic protocol for accessing a satellite channel by a large number of independent users, is considered and an example is presented comparing the average delay properties of tree and TDMA protocols when applied to direct access and to reservation access systems.
Analysis of backoff protocols for multiple access channels
It is proved that binary exponential backoff is unstable if the arrival rate of new messages at each station is &lgr;/N for any number of stations N exceeding 1 and any overall arrival rate &l gr; exceeding .567 + 1/4N - 2.
Tree algorithms for packet broadcast channels
A new class of high-speed, high-throughput, stable, multiaccessing algorithms is presented and it is shown that these algorithms are stable (in that all moments of delay exist) and are optimal in a certain sense.