Hello. First of all, forgive me if I post on the wrong category, I didn't find a better one.
There's a real life problem that I'd like to understand using game theory, but I have no formation on it and I am reading some introductory articles that aren't completely helpful, as my problem isn't quite featured on what I have read so far.
My problem is of openness and closeness of information. Say, as an example, two people have to be honest on whether one finds the other ugly.
If player A is honest and says B is ugly, B gains information, and A loses reputation. So, my first problem is, I have not seen an exemplified game where there's shared scores for the move of a single player, and don't know if it can be represented as such.
My hypothetical score is, if A is honest, 2 for B and -1 for A. 2 is chosen because if both are honest, the result for a single player would be 2-1=1, which is better than mutual closure, of gain 0 for each.
This is an image with my guess at the representation.
The second problem is, is this the best representation of the problem, considering players can lie and pretend they are being honest while not giving information damning for themselves? I'm honestly confused in this part.
My game seems to be imperfect information, non-cooperative and variable sum.
There's a real life problem that I'd like to understand using game theory, but I have no formation on it and I am reading some introductory articles that aren't completely helpful, as my problem isn't quite featured on what I have read so far.
My problem is of openness and closeness of information. Say, as an example, two people have to be honest on whether one finds the other ugly.
If player A is honest and says B is ugly, B gains information, and A loses reputation. So, my first problem is, I have not seen an exemplified game where there's shared scores for the move of a single player, and don't know if it can be represented as such.
My hypothetical score is, if A is honest, 2 for B and -1 for A. 2 is chosen because if both are honest, the result for a single player would be 2-1=1, which is better than mutual closure, of gain 0 for each.
This is an image with my guess at the representation.
The second problem is, is this the best representation of the problem, considering players can lie and pretend they are being honest while not giving information damning for themselves? I'm honestly confused in this part.
My game seems to be imperfect information, non-cooperative and variable sum.