aviator
发表于 2025-3-28 16:03:13
http://reply.papertrans.cn/16/1530/152951/152951_41.png
MUT
发表于 2025-3-28 21:06:03
http://reply.papertrans.cn/16/1530/152951/152951_42.png
遣返回国
发表于 2025-3-29 00:56:46
The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements, equilibrium of a given three-player game in strategic form with integer payoffs is trembling hand perfect. Analogous results are shown for a number of other solution concepts, including proper equilibrium, (the strategy part of) sequential equilibrium, quasi-perfect equilibrium and CURB..The proofs
Talkative
发表于 2025-3-29 05:26:14
Complexity of Safe Strategic Voting, model, a potential manipulator . announces how he intends to vote, and some of the other voters whose preferences coincide with those of . may follow suit. Depending on the number of followers, the outcome could be better or worse for . than the outcome of truthful voting. A manipulative vote is ca
创作
发表于 2025-3-29 08:08:07
http://reply.papertrans.cn/16/1530/152951/152951_45.png
Ptosis
发表于 2025-3-29 15:19:59
When the Players Are Not Expectation Maximizers,Much of Game Theory, including the Nash equilibrium concept, is based on the assumption that players are expectation maximizers. It is known that if players are risk averse, games may no longer have Nash equilibria . We show that
无表情
发表于 2025-3-29 17:40:30
http://reply.papertrans.cn/16/1530/152951/152951_47.png
使人烦燥
发表于 2025-3-29 20:32:28
Algorithmic Game Theory978-3-642-16170-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
Texture
发表于 2025-3-30 00:28:29
0302-9743 Overview: 978-3-642-16169-8978-3-642-16170-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
ear-canal
发表于 2025-3-30 04:04:19
https://doi.org/10.1007/978-3-642-16170-4Braess‘s paradox; Hedonic games; Nash equilibrium; algorithmic game theory; auctions; coalition formation