Showing 1 - 10 of 3,441
Persistent link: https://www.econbiz.de/10009241502
Persistent link: https://www.econbiz.de/10009632700
Persistent link: https://www.econbiz.de/10002263801
Persistent link: https://www.econbiz.de/10002240098
Persistent link: https://www.econbiz.de/10002513183
-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
Persistent link: https://www.econbiz.de/10000008609
replies to all probabilistic beliefs over the set. We present an algorithm that computes all minimal sCURB sets in any given … finite game. Runtime measurements on two-player games (where the concepts of CURB and sCURB coincide) show that the algorithm … is considerably faster than the earlier developed algorithm, that of Benisch et al. (2006). -- curb sets ; rational …
Persistent link: https://www.econbiz.de/10003912049
We revisit classic algorithmic search and optimization problems from the perspective of competition. Rather than a single optimizer minimizing expected cost, we consider a zero-sum game in which an optimization problem is presented to two players, whose only goal is to outperform the opponent....
Persistent link: https://www.econbiz.de/10009427188
Persistent link: https://www.econbiz.de/10011300957