Solution techniques for quantified linear programs and the links to gaming

DOI10.1007/978-3-319-09165-5_10MaRDI QIDQ2947911zbMATH OpenOpenAlexFDO

Authors Ulf Lorenz, Thomas Opfer, Jan Wolf

Publication date 29 September 2015

Published in Computers and Games (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09165-5_10

zbMATH Keywords

quantified linear programstwo-person zero-sum games

Mathematics Subject Classification ID

2-person games (91A05) Algorithmic game theory and complexity (91A68) Experimental studies (91A90)

Recommendations

• Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition
• Quantified linear programs: a computational study
• Polyhedral and algorithmic properties of quantified linear programs
• Multistage optimization with the help of quantified linear programming
• On a decision procedure for quantified linear programs

Cited in

(6)

• Multistage robust discrete optimization via quantified integer programming
• Multistage optimization with the help of quantified linear programming
• Quantified linear programs: a computational study
• Polyhedral and algorithmic properties of quantified linear programs
• Limited memory solution of bound constrained convex quadratic problems arising in video games
• Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition

This page was built for publication: Solution techniques for quantified linear programs and the links to gaming

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