Screening game

A screening game is a two-player principal–agent type game used in economic and game theoretical modeling. Principal–agent problems are situations where there are two players whose interests are not necessarily matching with each other, and where complete honesty is not optimal for one player. This will lead to strategies where the players exchange information based in their actions which is to some degree noisy. This ambiguity prevents the other player from taking advantage of the first. The game is closely related to signaling games, but there is a difference in how information is exchanged.

In the principal-agent model, for instance, there is an employer (the principal) and a worker (the agent). The worker has a given skill level, and chooses the amount of effort he will exert. If the worker knows his ability (which is given at the outset, perhaps by nature), and can acquire credentials or somehow signal that ability to the employer before being offered a wage, then the problem is signaling. What sets apart a screening game is that the employer offers a wage level first, at which point the worker chooses the amount of credentials he will acquire (perhaps in the form of education or skills) and accepts or rejects a contract for a wage level. It is called screening, because the worker is screened by the employer in that the offers may be contingent on the skill level of the worker.

Some economists use the terms signaling and screening interchangeably, and the distinction can be attributed to Stiglitz and Weiss (1989).

References

Stiglitz, Joseph and Andrew Weiss (1989) “Sorting out the Differences Between Screening and Signalling Models,” in Papers in Commemoration of the Economic Theory Seminar at Oxford University, edited by Michael Dempster, Oxford: Oxford University Press.

Topics in game theory
Definitions	Cooperative game Determinacy Escalation of commitment Extensive-form game First-player and second-player win Game complexity Graphical game Hierarchy of beliefs Information set Normal-form game Preference Sequential game Simultaneous game Simultaneous action selection Solved game Succinct game
Equilibrium concepts	Nash equilibrium Subgame perfection Mertens-stable equilibrium Bayesian Nash equilibrium Perfect Bayesian equilibrium Trembling hand Proper equilibrium Epsilon-equilibrium Correlated equilibrium Sequential equilibrium Quasi-perfect equilibrium Evolutionarily stable strategy Risk dominance Core Shapley value Pareto efficiency Gibbs equilibrium Quantal response equilibrium Self-confirming equilibrium Strong Nash equilibrium Markov perfect equilibrium
Strategies	Dominant strategies Pure strategy Mixed strategy Strategy-stealing argument Tit for tat Grim trigger Collusion Backward induction Forward induction Markov strategy Bid shading
Classes of games	Symmetric game Perfect information Repeated game Signaling game Screening game Cheap talk Zero-sum game Mechanism design Bargaining problem Stochastic game Mean-field game n-player game Large Poisson game Nontransitive game Global game Strictly determined game Potential game
Games	Go Chess Infinite chess Checkers Tic-tac-toe Prisoner's dilemma Gift-exchange game Optional prisoner's dilemma Traveler's dilemma Coordination game Chicken Centipede game Volunteer's dilemma Dollar auction Battle of the sexes Stag hunt Matching pennies Ultimatum game Rock paper scissors Pirate game Dictator game Public goods game Blotto game War of attrition El Farol Bar problem Fair division Fair cake-cutting Cournot game Deadlock Diner's dilemma Guess 2/3 of the average Kuhn poker Nash bargaining game Induction puzzles Trust game Princess and Monster game Rendezvous problem
Theorems	Arrow's impossibility theorem Aumann's agreement theorem Folk theorem Minimax theorem Nash's theorem Purification theorem Revelation principle Zermelo's theorem
Key figures	Albert W. Tucker Amos Tversky Antoine Augustin Cournot Ariel Rubinstein Claude Shannon Daniel Kahneman David K. Levine David M. Kreps Donald B. Gillies Drew Fudenberg Eric Maskin Harold W. Kuhn Herbert Simon Hervé Moulin Jean Tirole Jean-François Mertens Jennifer Tour Chayes John Harsanyi John Maynard Smith John Nash John von Neumann Kenneth Arrow Kenneth Binmore Leonid Hurwicz Lloyd Shapley Melvin Dresher Merrill M. Flood Olga Bondareva Oskar Morgenstern Paul Milgrom Peyton Young Reinhard Selten Robert Axelrod Robert Aumann Robert B. Wilson Roger Myerson Samuel Bowles Suzanne Scotchmer Thomas Schelling William Vickrey
Miscellaneous	All-pay auction Alpha–beta pruning Bertrand paradox Bounded rationality Combinatorial game theory Confrontation analysis Coopetition Evolutionary game theory First-move advantage in chess Game mechanics Glossary of game theory List of game theorists List of games in game theory No-win situation Solving chess Topological game Tragedy of the commons Tyranny of small decisions

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

Screening game

See also

References