TY - GEN
T1 - Stochastic loss aversion for random medium access
AU - Kesidis, George
AU - Jin, Youngmi
PY - 2012
Y1 - 2012
N2 - We consider a slotted-ALOHA LAN with loss-averse, noncooperative greedy users. To avoid non-Pareto equilibria, particularly deadlock, we assume probabilistic loss-averse behavior. This behavior is modeled as a modulated white noise term, in addition to the greedy term, creating a diffusion process modeling the game. We observe that when player's modulate with their throughput, a more efficient exploration of play-space (by Gibbs sampling) results, and so finding a Pareto equilibrium is more likely over a given interval of time.
AB - We consider a slotted-ALOHA LAN with loss-averse, noncooperative greedy users. To avoid non-Pareto equilibria, particularly deadlock, we assume probabilistic loss-averse behavior. This behavior is modeled as a modulated white noise term, in addition to the greedy term, creating a diffusion process modeling the game. We observe that when player's modulate with their throughput, a more efficient exploration of play-space (by Gibbs sampling) results, and so finding a Pareto equilibrium is more likely over a given interval of time.
UR - http://www.scopus.com/inward/record.url?scp=84873972848&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84873972848&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-35582-0_18
DO - 10.1007/978-3-642-35582-0_18
M3 - Conference contribution
AN - SCOPUS:84873972848
SN - 9783642355813
T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
SP - 236
EP - 247
BT - Game Theory for Networks - Third International ICST Conference, GameNets 2012, Revised Selected Papers
T2 - 3rd International ICST Conference on Game Theory for Networks, GameNets 2012
Y2 - 24 May 2012 through 26 May 2012
ER -