Stochastic Loss Aversion for Random Medium Access

George Kesidis; Youngmi Jin

Game Theory for Networks. Third International ICST Conference, GameNets 2012, Vancouver, BC, Canada, May 24-26, 2012, Revised Selected Papers

Research Article

Stochastic Loss Aversion for Random Medium Access

Download

374 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1007/978-3-642-35582-0_18,
    author={George Kesidis and Youngmi Jin},
    title={Stochastic Loss Aversion for Random Medium Access},
    proceedings={Game Theory for Networks. Third International ICST Conference, GameNets 2012, Vancouver, BC, Canada, May 24-26, 2012, Revised Selected Papers},
    proceedings_a={GAMENETS},
    year={2012},
    month={12},
    keywords={ALOHA MAC Pareto equilibria diffusion machine},
    doi={10.1007/978-3-642-35582-0_18}
}

George Kesidis
Youngmi Jin
Year: 2012
Stochastic Loss Aversion for Random Medium Access
GAMENETS
Springer
DOI: 10.1007/978-3-642-35582-0_18

George Kesidis¹^,*, Youngmi Jin²^,*

1: Penn State University
2: KAIST

*Contact email: gik2@psu.edu, youngmi_jin@kaist.ac.kr

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.

Keywords: ALOHA MAC Pareto equilibria diffusion machine

Published: 2012-12-11

: http://dx.doi.org/10.1007/978-3-642-35582-0_18

Stochastic Loss Aversion for Random Medium Access

Abstract

About EAI

Community

Publish with EAI