Stochastic loss aversion for random medium access

DOI10.1007/978-3-642-35582-0_18MaRDI QIDQ2840939zbMATH OpenOpenAlexFDO

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)

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

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)

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.

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

Cites work

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

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)