Bribery games on inter-dependent regular networks

Verma P, Nandi AK, Sengupta S (2017)
Scientific Reports 7: 42735.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
OA 4.91 MB
Autor*in
Verma, PrateekUniBi ; Nandi, Anjan K.; Sengupta, Supratim
Abstract / Bemerkung
We examine a scenario of social conflict that is manifest during an interaction between government servants providing a service and citizens who are legally entitled to the service, using evolutionary game-theory in structured populations characterized by an inter-dependent network. Bribe-demands by government servants during such transactions, called harassment bribes, constitute a widespread form of corruption in many countries. We investigate the effect of varying bribe demand made by corrupt officials and the cost of complaining incurred by harassed citizens, on the proliferation of corrupt strategies in the population. We also examine how the connectivity of the various constituent networks affects the spread of corrupt officials in the population. We find that incidents of bribery can be considerably reduced in a network-structured populations compared to mixed populations. Interestingly, we also find that an optimal range for the connectivity of nodes in the citizen’s network (signifying the degree of influence a citizen has in affecting the strategy of other citizens in the network) as well as the interaction network aids in the fixation of honest officers. Our results reveal the important role of network structure and connectivity in asymmetric games.
Erscheinungsjahr
2017
Zeitschriftentitel
Scientific Reports
Band
7
Art.-Nr.
42735
eISSN
2045-2322
Page URI
https://pub.uni-bielefeld.de/record/2963990

Zitieren

Verma P, Nandi AK, Sengupta S. Bribery games on inter-dependent regular networks. Scientific Reports. 2017;7: 42735.
Verma, P., Nandi, A. K., & Sengupta, S. (2017). Bribery games on inter-dependent regular networks. Scientific Reports, 7, 42735. https://doi.org/10.1038/srep42735
Verma, Prateek, Nandi, Anjan K., and Sengupta, Supratim. 2017. “Bribery games on inter-dependent regular networks”. Scientific Reports 7: 42735.
Verma, P., Nandi, A. K., and Sengupta, S. (2017). Bribery games on inter-dependent regular networks. Scientific Reports 7:42735.
Verma, P., Nandi, A.K., & Sengupta, S., 2017. Bribery games on inter-dependent regular networks. Scientific Reports, 7: 42735.
P. Verma, A.K. Nandi, and S. Sengupta, “Bribery games on inter-dependent regular networks”, Scientific Reports, vol. 7, 2017, : 42735.
Verma, P., Nandi, A.K., Sengupta, S.: Bribery games on inter-dependent regular networks. Scientific Reports. 7, : 42735 (2017).
Verma, Prateek, Nandi, Anjan K., and Sengupta, Supratim. “Bribery games on inter-dependent regular networks”. Scientific Reports 7 (2017): 42735.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Creative Commons Namensnennung 4.0 International Public License (CC-BY 4.0):
Volltext(e)
Name
Access Level
OA Open Access
Zuletzt Hochgeladen
2022-06-23T12:20:46Z
MD5 Prüfsumme
e32bf2e157b2c73e9a9c0521a8ca331e


Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®
Quellen

PMID: 28205644
PubMed | Europe PMC

Suchen in

Google Scholar