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

Fingerprint

White noise
Local area networks
Throughput
Sampling

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

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
Kesidis, George ; Jin, Youngmi. / Stochastic loss aversion for random medium access. Game Theory for Networks - Third International ICST Conference, GameNets 2012, Revised Selected Papers. 2012. pp. 236-247 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).
@inproceedings{78cd115467d7467a97ebe4f5f4785c50,
title = "Stochastic loss aversion for random medium access",
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.",
author = "George Kesidis and Youngmi Jin",
year = "2012",
month = "12",
day = "1",
doi = "10.1007/978-3-642-35582-0_18",
language = "English (US)",
isbn = "9783642355813",
series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering",
pages = "236--247",
booktitle = "Game Theory for Networks - Third International ICST Conference, GameNets 2012, Revised Selected Papers",

}

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. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, vol. 105 LNICST, pp. 236-247, 3rd International ICST Conference on Game Theory for Networks, GameNets 2012, Vancouver, BC, Canada, 5/24/12. https://doi.org/10.1007/978-3-642-35582-0_18

Stochastic loss aversion for random medium access. / Kesidis, George; Jin, Youngmi.

Game Theory for Networks - Third International ICST Conference, GameNets 2012, Revised Selected Papers. 2012. p. 236-247 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vol. 105 LNICST).

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

TY - GEN

T1 - Stochastic loss aversion for random medium access

AU - Kesidis, George

AU - Jin, Youngmi

PY - 2012/12/1

Y1 - 2012/12/1

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

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

ER -

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