Distributed algorithms with dynamical random transitions

DOI10.1002/rsa.10060zbMath1057.68133OpenAlexW2061704454MaRDI QIDQ4798174

René Schott, Nadine Guillotin-Plantard

Publication date: 19 March 2003

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10060

zbMATH Keywords

dynamical systemsresource sharingdynamical random walksbanker algorithm

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Distributed algorithms (68W15)

Related Items (5)

Large deviations analysis for distributed algorithms in an ergodic Markovian environment ⋮ Dynamic random walks on Heisenberg groups ⋮ Hitting time of a corner for a reflected diffusion in the square ⋮ Analysis of distributed systems via quasi-stationary distributions ⋮ Data structures with dynamical random transitions

Cites Work

• Unnamed Item

This page was built for publication: Distributed algorithms with dynamical random transitions