Similar Search Results

An algorithm for computing the nucleolus of disjunctive additive games with an acyclic permission structure

Brink, René van den; Katsev, Ilya; Laan, Gerard van der - 2008

-called peer group games being non-negative additive games on a permission tree. We provide a polynomial time algorithm for …

Persistent link: https://www.econbiz.de/10011377258

A review of methods and algorithms for optimizing construction scheduling

Zhou, J.; Love, Peter; Wang, X.; Teo, Kok Lay; Irani, Zahir - In: Journal of the Operational Research Society : OR 64 (2013) 8, pp. 1091-1105

Persistent link: https://www.econbiz.de/10009788183

A polyhedral description of kernels

Chen, Qin; Chen, Xujin; Zang, Wenan - In: Mathematics of operations research 41 (2016) 3, pp. 969-990

Persistent link: https://www.econbiz.de/10011520783

Effective asymptotics analysis for finance

Grunspan, Cyril; Van der Hoeven, Joris - In: International journal of theoretical and applied finance 23 (2020) 2, pp. 1-23

Persistent link: https://www.econbiz.de/10012270910

Multi-objective optimization methods for allocation and prediction

Ye, Qing Chuan - 2019

Persistent link: https://www.econbiz.de/10012146284

On the query complexity of Black-Peg AB-mastermind

Ouali, Mourad el; Glazik, Christian; Sauerland, Volkmar; … - In: Games 9 (2018) 1/2, pp. 1-12

Mastermind is a two players zero sum game of imperfect information. Starting with Erdos and Rényi (1963), its combinatorics have been studied to date by several authors, e.g., Knuth (1977), Chvátal (1983), Goodrich (2009). The first player, called “codemaker”, chooses a secret code and the...

Persistent link: https://www.econbiz.de/10011771356