Network Coloring and Colored Coin Games

DOI10.1007/978-1-4614-6825-7_4zbMath1356.91032OpenAlexW84143075MaRDI QIDQ2961393

Moritz Schauer, Christos Pelekis

Publication date: 20 February 2017

Published in: Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-6825-7_4

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Games involving graphs (91A43) Microeconomic theory (price theory and economic markets) (91B24) Combinatorial probability (60C05) Stochastic games, stochastic differential games (91A15) Coloring of graphs and hypergraphs (05C15) Probabilistic games; gambling (91A60)

Related Items (3)

Bernoulli trials of fixed parity, random and randomly oriented graphs ⋮ A note on the network coloring game: a randomized distributed \((\Delta+1)\)-coloring algorithm ⋮ On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Spatial dispersion as a dynamic coordination problem
• The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions
• On the expectation of the maximum of IID geometric random variables
• On the Distribution of the Number of Successes in Independent Trials
• Strategic Coloring of a Graph
• A Game Theoretic Approach for Efficient Graph Coloring
• Mean, Median and Mode in Binomial Distributions
• Maximally dependent random variables
• A class of dependent random variables and their maxima

This page was built for publication: Network Coloring and Colored Coin Games