468 | | ||'''Summary'''||Opponent models can aid in preventing exploitation, by determining the type of move of the opponent (selfish, [[BR] unfortunate, concession, nice, fortunate, silent), and by taking the opponents preferences into account to[[BR] increase the chance of acceptation. The mirror strategy mirrors the behaviours of the opponent, based on a [[BR]classification of the opponent move. Nice MS does the same, but adds a nice move, which is a move which only [[BR]increases the opponents utility without decreasing ours. Overall the strategy is shown to be effective by [[BR]comparing the result of first testing the strategy against a random agent, and then the other agents. Also, the[[BR] distance to a Kalai-Smorodinsky solution and the distance to the Nash Point is used as a metric. For [[BR]future work the exploitability of MS should be researched.|| |
| 468 | ||'''Summary'''||Opponent models can aid in preventing exploitation, by determining the type of move of the opponent (selfish, [[BR]] unfortunate, concession, nice, fortunate, silent), and by taking the opponents preferences into account to[[BR]] increase the chance of acceptation. The mirror strategy mirrors the behaviours of the opponent, based on a [[BR]]classification of the opponent move. Nice MS does the same, but adds a nice move, which is a move which only [[BR]]increases the opponents utility without decreasing ours. Overall the strategy is shown to be effective by [[BR]]comparing the result of first testing the strategy against a random agent, and then the other agents. Also, the[[BR]] distance to a Kalai-Smorodinsky solution and the distance to the Nash Point is used as a metric. For [[BR]]future work the exploitability of MS should be researched.|| |