Contention resolution under selfishness

DOI10.1007/S00453-013-9773-4zbMath1303.91055OpenAlexW2035509583MaRDI QIDQ487024

Katrina Ligett, Evangelia Pyrga, George Christodoulou

Publication date: 19 January 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-013-9773-4

zbMATH Keywords

algorithmic game theorycontention resolution

Mathematics Subject Classification ID

Applications of game theory (91A80) Network protocols (68M12) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Worst-case equilibria
• Resolution of a conflict of known multiplicity
• Analysis of practical backoff protocols for contention resolution with multiple servers
• Slotted Aloha as a game with partial information
• Tree algorithms for packet broadcast channels
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• Bounds on the performance of protocols for a multiple-access broadcast channel
• A Collision Resolution Protocol for Random Access Channels with Energy Detectors
• How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback
• Contention resolution with constant expected delay
• On contention resolution protocols and associated probabilistic phenomena

This page was built for publication: Contention resolution under selfishness