RT Monograph
SR 00
A1 Zaporozhets, Vera
T1 A Note on Lobbying a Legislature
YR 2016
FD 2016-07
VO 16-673
SP 7
K1 Legislative lobbying
K1 Combinatorial optimization
K1 Knapsack problem
AB We study a simple in?uence game, in which a lobby tries to manipulate the decision of a legislature via monetary offers to one or more members. We compute the minimum budget needed for the lobby to pass the bill and the distribution of this budget between the legislators. We also show the connection of the problem to the combinatorial optimization.
T2 TSE Working Paper
PB TSE Working Paper
PP Toulouse
AV Published
LK https://publications.ut-capitole.fr/id/eprint/22221/
UL http://tse-fr.eu/pub/30553