It Pays to Pay in Bi-Matrix Games - a Rational Explanation for Bribery

Gupta, Anshul and Schewe, Sven ORCID: 0000-0002-9093-9518 (2015) It Pays to Pay in Bi-Matrix Games - a Rational Explanation for Bribery. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems. AAMAS, 3 . International Foundation for Autonomous Agents and Multiagent Systems, pp. 1361-1369. ISBN 9781450337717

Text incentiveEq1_AAMAS.pdf - Unspecified Download (265kB)

Abstract

We discuss bribery as a rational behaviour in two player bi-matrix games in game settings, where one player can assign the strategies to the other player. This can be observed as leader (or: Stackelberg) equilibria, where a leader assigns the strategy to herself and to the other player, who follows this lead unless he has an incentive not to. We make the rational assumption that a leader can further incentivise decisions of her follower, by bribing him with a small payoff value, and show that she can improve her gain this way. This results in an asymmetric equilibrium for a strategy profile: the incentive equilibrium. By 'asymmetric equilibrium', we refer to the strategy profile where a leader might benefit from deviation, while her follower does not. We observe that this concept is strong enough to obtain social optimum in the classic example of the prisoners' dilemma. We show that computing such incentive equilibria is no more expensive than computing leader equilibria: as opposed to Nash equilibria, they are both tractable. We evaluated our techniques on a large set of benchmarks (100,000 bi-matrix games) and provide the experimental results for incentive equilibrium.

Item Type:	Book Section
Uncontrolled Keywords:	Nash Equilibrium, Bi-matrix Games, Leader Equilibrium
Depositing User:	Symplectic Admin
Date Deposited:	22 Feb 2017 10:56
Last Modified:	21 Jan 2023 05:20
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3005476