Stochastic loss aversion for random medium access

George Kesidis, Youngmi Jin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationGame Theory for Networks - Third International ICST Conference, GameNets 2012, Revised Selected Papers
Pages236-247
Number of pages12
DOIs
StatePublished - Dec 1 2012
Event3rd International ICST Conference on Game Theory for Networks, GameNets 2012 - Vancouver, BC, Canada
Duration: May 24 2012May 26 2012

Publication series

NameLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Volume105 LNICST
ISSN (Print)1867-8211

Other

Other3rd International ICST Conference on Game Theory for Networks, GameNets 2012
CountryCanada
CityVancouver, BC
Period5/24/125/26/12

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Stochastic loss aversion for random medium access'. Together they form a unique fingerprint.

  • Cite this

    Kesidis, G., & Jin, Y. (2012). Stochastic loss aversion for random medium access. In Game Theory for Networks - Third International ICST Conference, GameNets 2012, Revised Selected Papers (pp. 236-247). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vol. 105 LNICST). https://doi.org/10.1007/978-3-642-35582-0_18