Showing 1 - 10 of 13,113
amp;#65279;An N-player game can be approximated by adding a coordinator who interacts bilaterally with each player. The coordinator proposes strategies to the players, and his payoff is maximized when each player's optimal reply agrees with his proposal. When the feasible set of proposals is finite,...
Persistent link: https://www.econbiz.de/10012729411
Persistent link: https://www.econbiz.de/10011870632
valuable contribution to the important field of computational network theory …
Persistent link: https://www.econbiz.de/10012401978
Persistent link: https://www.econbiz.de/10013437429
Persistent link: https://www.econbiz.de/10013173368
-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/10013272714
Persistent link: https://www.econbiz.de/10012494639
oligopoly producers in two-stage zonal power markets. In part II of this paper, we propose a solution algorithm which decomposes … the proposed MILP model into several subproblems and solve them in parallel and iteratively. Our solution algorithm … and the proposed solution algorithm finds a representative SPNE in each subinterval. Each subinterval is independent from …
Persistent link: https://www.econbiz.de/10011943407
Persistent link: https://www.econbiz.de/10013366470