Flow games

DOI10.4230/LIPICS.FSTTCS.2017.38MaRDI QIDQ5136330zbMATH OpenFDO

Authors Orna Kupferman, Gal Vardi, Moshe Y. Vardi

Publication date 25 November 2020

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2017.38

zbMATH Keywords

algorithmsflow networkstwo-player games

Mathematics Subject Classification ID

Flows in graphs (05C21) Games on graphs (graph-theoretic aspects) (05C57) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games involving graphs (91A43)

Recommendations

• Playing with the Maximum-Flow Problem
• An iterative security game for computing robust and adaptive network flows
• Finding nucleolus of flow game
• The least-core of threshold network flow games
• A game theoretic perspective to flow control in telecommunication networks

Cites work

• A BGP-based mechanism for lowest-cost routing
• A course in game theory.
• A Decision Procedure for the First Order Theory of Real Addition with Order
• A new approach to the maximum-flow problem
• A strongly polynomial minimum cost circulation algorithm
• Algorithmic Game Theory
• Alternation
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 4204092 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 140096 (Why is no real title available?)
• scientific article; zbMATH DE number 3501006 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• Maximal Flow Through a Network
• Network flows. Theory, algorithms, and applications.
• Number of quantifiers is better than number of tape cells
• On saturation games
• On the combinational complexity of certain symmetric Boolean functions
• On the Complexity of Timetable and Multicommodity Flow Problems
• Possible Winners in Partially Completed Tournaments
• Rigorous approximated determinization of weighted automata
• The complexity of theorem-proving procedures
• The Map-Coloring Game
• The Price of Stability for Network Design with Fair Cost Allocation
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Totally Balanced Games and Games of Flow

Cited in

(6)

• Simple flow games
• An iterative security game for computing robust and adaptive network flows
• scientific article; zbMATH DE number 988834 (Why is no real title available?)
• The unfortunate-flow problem
• Spanning-tree games
• Flow logic

This page was built for publication: Flow games

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