[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fVNcX_xTwpdyv5znqVbpYYYkkdPZQ7o5yXhi06SDEzyo":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":18,"related":19,"source":23,"type":24},[],"2024-10-17 14:07:36",997976275,[8,9,10,11],"合作博弈与非合作博弈","静态博弈与动态博弈","完全信息博弈与不完全信息博弈","囚徒困境与纳什均衡",{"courseId":13,"courseImg":14,"courseName":15,"workId":16,"workName":17},"1000076607","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd7ea7086329261ddbccb0e9e00c955b1.jpg","[智慧共享课]人工智能引论","58823390","第八章单元测试","下面对博弈研究分类不正确的是( )",[20,25,34,43,52],{"answer":21,"createTime":5,"id":6,"options":22,"question":18,"source":23,"type":24},[],[8,9,10,11],"v2",0,{"answer":26,"createTime":5,"id":27,"options":28,"question":33,"source":23,"type":24},[],997976291,[29,30,31,32],"1944年冯·诺伊曼与奥斯卡·摩根斯特恩合著《博弈论与经济行为》的出版","纳什均衡思想的提出","囚徒困境思想的提出","冯·诺伊曼计算机的实现","标志着现代博弈理论的初步形成的事件是( )",{"answer":35,"createTime":5,"id":36,"options":37,"question":42,"source":23,"type":24},[],997976379,[38,39,40,41],"其他玩家策略不变,只改变玩家i的策略后,所产生的收益之差","所有玩家策略均改变,所产生的收益之差","至少改变1个以上玩家的策略, 所产生的收益之差","每个玩家策略不变,只改变收益函数,所产生的收益之差","在遗憾最小化算法中,玩家i按照如下方法来计算其在每一轮产生的悔恨值( )",{"answer":44,"createTime":5,"id":45,"options":46,"question":51,"source":23,"type":24},[],997976386,[47,48,49,50],"博弈过程中,博弈方通过概率形式随机从可选策略中选择一个策略而达到的纳什均衡被称为混合策略纳什均衡","博弈过程中,博弈方通过非概率形式随机从可选策略中选择一个策略而达到的纳什均衡被称为混合策略纳什均衡","博弈过程中,博弈方以概率形式随机从可选收益中选择一个收益,而达到的纳什均衡被称为混合策略纳什均衡","博弈过程中,博弈方以非概率形式随机从可选收益中选择一个收益,而达到的纳什均衡被称为混合策略纳什均衡","下面对混合策略纳什均衡描述正确的是( )",{"answer":53,"createTime":5,"id":54,"options":55,"question":60,"source":23,"type":24},[],997976402,[56,57,58,59],"参与者所作出的这样一种策略组合,在该策略组合上,任何参与者单独改变策略都不会得到好处","在一个策略组合上,当所有其他人都改变策略时,也无法破坏先前的博弈平衡,则该策略组合就是一个纳什均衡","参与者所作出的这样一种策略组合,在该策略组合上,若干参与者改变策略后,大家都不会得到更多好处","参与者所作出的这样一种策略组合,在该策略组合上,有且只有1个参与者改变策略后,其收益会增加","下面对纳什均衡描述正确的是( )"]