I am currently trying to learn game theory on my own.
I have a question regarding the solution methods for static games with complete information vs that of incomplete information. The textbook which I have for my reference often associates static games with incomplete information with a probability belief. However, right now, I am thinking of a game whereby a player does not have any idea about the other player's payoff function.
In this case, how can I solve the problem? Would the approach using the first order equations work here?
Well, it gets complicated. There are simple cases, of course, where you have a dominant strategy where you don't care what the other person does, but that's not very interesting. Basically, you need some idea about the other person's payoff function. Approaches to knowing very little, that is, not knowing the probability distribution of the other person's payoffs are associated with the terms Knightian Uncertainty, the Ellsberg Paradox, and Gilboa-Schmeidly preferences. For an example of a paper that tries to put these into game theory, see http://www.bus.indiana.edu/BEPP/documents/FrankRiedel.pdf, but it is rather advanced.