Games and Mechanisms Flashcards
Social Choice Settings
Agents with individual preferences and the aim is to aggregate the preferences and select an outcome that reflects the collective preference assuming the agents are truthful
Social Choice Function (SCF)
Maps agent’s preferences to outcomes
Bayesian Game
Agents are strategic, holding private information about their preferences of outcomes. They cannot be relied on to honestly disclose their preferences
Outcome
The result of a game, capturing the allocation of resources and the payments made by each agent
Type
Encapsulates the private information withheld by an agent
Type Space
The set of all possible types of each player
Type Profile
An instance of the set of all type spaces
Common-prior probability distribution
The probability distribution over the set of all type spaces, it is known to all players. It represents the probability the players are in a given type space
Utility
It is quasilinear and captures their payoff for an an outcome is defined under a given type
Mechanism
A pair
<A, M>
Direct Mechanism
The only action available for each agent is to announce their private information:
Quasilinear mechanism
A triple
<A, \chi, p>
Choice Function
Maps from action profiles to outcomes
Payment Function
Maps from action profiles to payments
Direct Quasilinear Mechanism
A triple
<\Theta, \chi, p>
\Theta = A
Efficient Mechanism
In equilibrium, the selected allocation maximises the total social welfare
Dominant Strategy Truthful Mechanism
For every possible agent and true valuation, declaring truthfully maximises utility
Ex Post Individually Rational Mechanism
In equilibrium the utility of each agent is at least 0
i.e. no agent loses by participating
Budget Balanced Mechanism
Regardless of agents’ types, the mechanism collects and disburses the same amount of money to and from agents
Weakly Budget Balanced Mechanism
Regardless of agents’ types, the mechanism does not lose money
Tractable Mechanism
All declarable values, allocations, and payments can be computed in polynomial times
Groves Mechanisms
A class of mechanisms that are both efficient and dominant strategy truthful
Groves Mechanisms: Allocation Function
Selects an allocation that maximises the sum of declared values
Groves Mechanisms: Payment Function
Consists of two components
- Tax: The amount an agent pays, it must not be dependent on their own declared valuation