Potential games, path independence and Poisson's binomial distribution

DOI10.1007/s00186-018-0631-7zbMath1418.91033OpenAlexW2785928650MaRDI QIDQ1616794

Debapriya Sen

Publication date: 7 November 2018

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://mpra.ub.uni-muenchen.de/84409/1/MPRA_paper_84409.pdf

zbMATH Keywords

path independencepotential gamesstorage requirementPoisson's binomial distributionzero strategy

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• An improved algorithm for detecting potential games
• Decompositions and potentials for normal form games
• Convergence to approximate Nash equilibria in congestion games
• Anti-coordination and social interactions
• Probabilistic bounds on the coefficients of polynomials with only real zeros
• Potential games
• On Decomposed Subspaces of Finite Games
• Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
• How bad is selfish routing?
• On the Distribution of the Number of Successes in Independent Trials
• On the Distribution of the Number of Successes in Independent Trials
• Minimum-effort coordination games: Stochastic potential and logit equilibrium

This page was built for publication: Potential games, path independence and Poisson's binomial distribution