在一定条件下,我们证明随机对策有值函数,两个局中人相对于折扣报酬都有最优策略。
It is proved that under certain condition the stochastic game has a value and both players have optimal strategies for discounted rewards.
局中人通过采取局部行动生成网络,行动的原则是最大化其所在联盟的整体收益。
Networks are formed by allowing each agent to take local actions, and his principle is to maximize the payoff of his own coalition.
局中人数目变化的最小费用支撑树对策问题。
The player number decreasing minimum cost spanning tree game.
Right now we have actions, strategies for people to take, and we know what the outcomes are, but we're missing something that will make this a game.
目前我们涉及行为,策略,局中人,而且我们知道不同的结果,但是我们忽略了一个博弈必备的因素
So far we've looked at this game as played by people and we've looked at this game who are evil gits, as played by people who are indignant angels.
目前为止我们对这个博弈的分析,还停留在局中人都是饭桶恶魔,或者都是愤怒天使的阶段呢
So who are the voters, who are the players?
谁是选民,谁是局中人
应用推荐