Stochastic loss aversion for random medium access

DOI10.1007/978-3-642-35582-0_18zbMATH Open1268.91039arXiv1201.1776OpenAlexW1762018142MaRDI QIDQ2840939FDOQ2840939

Authors: George Kesidis, Youngmi Jin 

Publication date: 24 July 2013

Published in: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (Search for Journal in Brave)

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 results, and so finding a Pareto equilibrium is more likely over a given interval of time.

Full work available at URL: https://arxiv.org/abs/1201.1776

Recommendations

• Slotted Aloha as a game with partial information
• scientific article; zbMATH DE number 6381644
• Games to induce specified equilibria
• Stochastic game model of data transmission for two players based on slotted ALOHA protocol
• scientific article; zbMATH DE number 5613787

zbMATH Keywords

Pareto equilibriaALOHA MACdiffusion machine

Mathematics Subject Classification ID

Applications of game theory (91A80) Stochastic network models in operations research (90B15) Stochastic games, stochastic differential games (91A15) Games involving graphs (91A43) Application models in control theory (93C95)

Cites Work

• A survey on networking games in telecommunications
• Title not available (Why is that?)
• Simulated annealing via Sobolev inequalities
• Learning, Mutation, and Long Run Equilibria in Games
• Evolving aspirations and cooperation
• Convergence to equilibrium in local interaction games
• Learning aspiration in repeated games
• Aspiration-based reinforcement learning in repeated interaction games: An overview
• Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria
• Nonstationary Markov chains and convergence of the annealing algorithm
• Stochastic neural networks
• Fixed-Rate Equilibrium in Wireless Collision Channels
• Stochastic loss aversion for random medium access

Cited In (1)

• Stochastic loss aversion for random medium access

This page was built for publication: Stochastic loss aversion for random medium access

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840939)