Games with combinatorial constraints

DOI10.1007/s10559-008-9028-6zbMath1158.91332OpenAlexW1985693255MaRDI QIDQ1008310

N. Yu. Ustian, O. A. Yemets

Publication date: 27 March 2009

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-008-9028-6

zbMATH Keywords

decision-making criteriongames with nature

Mathematics Subject Classification ID

Combinatorial games (91A46) Decision theory for games (91A35)

Related Items (3)

Numerical solution of special matrix games ⋮ Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements ⋮ Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements

Cites Work

• A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
• Construction of convex continuations for functions defined on a hypersphere
• Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Games with combinatorial constraints