Stability of dining clubs in the Kolkata paise restaurant problem with and without cheating

DOI10.1016/J.PHYSA.2023.128767MaRDI QIDQ6158895zbMATH OpenOpenAlexFDO

Authors Akshat Harlalka, Andrew Belmonte, Christopher Griffin

Publication date 31 May 2023

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2302.14142

zbMATH Keywords

evolutionary dynamicsresource allocationgroup formationminority gamesKolkata paise restaurant problem

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Abstract: We introduce the idea of a dining club to the Kolkata Paise Restaurant Problem. In this problem, $N$ agents choose (randomly) among $N$ restaurants, but if multiple agents choose the same restaurant, only one will eat. Agents in the dining club will coordinate their restaurant choice to avoid choice collision and increase their probability of eating. We model the problem of deciding whether to join the dining club as an evolutionary game and show that the strategy of joining the dining club is evolutionarily stable. We then introduce an optimized member tax to those individuals in the dining club, which is used to provide a safety net for those group members who don't eat because of collision with a non-dining club member. When non-dining club members are allowed to cheat and share communal food within the dining club, we show that a new unstable fixed point emerges in the dynamics. A bifurcation analysis is performed in this case. To conclude our theoretical study, we then introduce evolutionary dynamics for the cheater population and study these dynamics. Numerical experiments illustrate the behaviour of the system with more than one dining club and show several potential areas for future research.

Recommendations

• Kolkata Paise Restaurant Problem: An Introduction
• Phase transition in the Kolkata Paise Restaurant problem
• scientific article; zbMATH DE number 5666793
• The distributed Kolkata paise restaurant game
• Stability against robust deviations in the roommate problem
• An optimal distributed solution to the dining philosphers problem
• Randomized dining philosophers without fairness assumption

Cites work

• scientific article; zbMATH DE number 5666793 (Why is no real title available?)
• Econophysics of the Kolkata restaurant problem and related games. Classical and quantum strategies for multi-agent, multi-choice repetitive games
• Phase transition in the Kolkata Paise Restaurant problem
• The distributed Kolkata paise restaurant game
• Three-player quantum Kolkata restaurant problem under decoherence
• Using many-body entanglement for coordinated action in game theory problems

Cited in

(2)

• Kolkata Paise Restaurant Problem: An Introduction
• scientific article; zbMATH DE number 5666793 (Why is no real title available?)

This page was built for publication: Stability of dining clubs in the Kolkata paise restaurant problem with and without cheating

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6158895)