arXiv subjects

Kalliopi Kastampolidou

Publications and source records attributed to Kalliopi Kastampolidou.

6 recordsLinked to original sources

arXiv2026

AI-Farol: Co-Evolutionary Dynamics in a Multi-Agent Two-Sided Learning Framework

The El Farol Bar game is a classical model of coordination under uncertainty that traditionally treats the venue as a passive constraint. In this work, we reconceptualize the problem by modeling the bar as a strategic player endowed with AI-driven learning capabilities. We extend the original framework in two principal directions: first, by introducing partial observability, whereby agents observe only subsets of past attendees; and second, by transforming the bar from a passive capacity threshold into an active mechanism designer that adjusts pricing policies to balance revenue, utilization, and sustainability constraints. Agents employ AI-based learning to form beliefs and adapt attendance strategies under incomplete information, while the bar applies policy learning to optimize dynamic pricing. The resulting two-sided learning system frames coordination as a co-evolutionary process between boundedly rational agents and an adaptive institution, offering insights into congestion management, resource allocation, and mechanism design in complex adaptive systems.

cs.GT↗

arXiv2026

Extending the El Farol Bar Game with Partial Observability and Incentive Design

The El Farol Bar game is a classic model of coordination under uncertainty, traditionally treating the venue as a passive constraint. In this work, we re-conceptualize the problem by modeling the bar as a strategic player equipped with AI-driven learning capabilities. We extend the original framework to include partial observability, i.e., agents observe only subsets of past attendees, and transform the bar from a passive capacity threshold into an active mechanism designer that adjusts pricing policies to balance revenue, utilization, and sustainability constraints. Agents employ AI-based learning to form beliefs and adapt attendance strategies under incomplete information, while the bar uses policy learning to optimize dynamic pricing. The resulting two-sided learning system frames coordination as a co-evolutionary process between boundedly rational agents and an adaptive institution, offering insights into congestion management, resource allocation, and mechanism design in complex adaptive systems.

cs.GT↗

arXiv2023

Quantum Tapsilou -- a quantum game inspired from the traditional Greek coin tossing game tapsilou

This paper introduces a new quantum game called Quantum Tapsilou that is inspired by the classical traditional Greek coin tossing game tapsilou. The new quantum game, despite its increased complexity and scope, retains the most important characteristic of the traditional game. In the classical game, both players have $\frac { 1 } { 4 }$ probability to win. The quantum version retains this characteristic feature, that is both players have the same probability to win, only now this probability varies considerably and depends on previous moves and choices. The two most important novelties of Quantum Tapsilou can be attributed to its implementation of entanglement via the use of rotation gates instead of Hadamard gates, which generates Bell-like states with unequal probability amplitudes, and the integral use of groups. In Quantum Tapsilou both players agree on a specific cyclic rotation group of order $n$, for some sufficiently large $n$. The game is based on the chosen group, in the sense that both players will draw their moves from its elements. More specifically, both players will pick rotations from this group to realize their actions using the corresponding $R_{ y }$ rotation gates. In the Quantum Tapsilou game, it is equally probable for both players to win. This fact is in accordance with a previous result in the literature showing that quantum games where both players choose their actions from the same group, exhibit perfect symmetry by providing each player with the possibility to pick the move that counteracts the other player's action.

quant-ph↗

arXiv2022

Viewing biological and computer viruses as manifestations of games

Computer viruses exhibit many similarities with biological viruses. Thus, a closer examination of this association might lead to some new perspectives and, even, to new enhanced capabilities that will facilitate the overall effort to tackle and, why not, eradicate them. Game theory has long been considered as a useful tool for modeling viral behavior. In this paper, we establish certain, important we hope, correlations between a well-known virus, namely VirLock, with the bacteriophage $\phi6$. Moreover, following this line of thought, we also suggest efficient and, at the same time, practical strategies that may significantly alleviate the infection problems caused by VirLock and any other virus having similar traits.

cs.GT↗

arXiv2021

Correlation of biological and computer viruses through evolutionary game theory

Computer viruses have many similarities to biological viruses, and their association may offer new perspectives and new opportunities in the effort to tackle and even eradicate them. Evolutionary game theory has been established as a useful tool for modeling viral behaviors. This work attempts to correlate a well-known virus, namely Virlock, with the bacteriophage $\phi6$. Furthermore, the paper suggests certain efficient strategies and practical ways that may reduce infection by Virlock and similar such viruses.

cs.GT↗

arXiv2021

DKPRG or how to succeed in the Kolkata Paise Restaurant gamevia TSP

The Kolkata Paise Restaurant Problem is a challenging game, in which $n$ agents must decide where to have lunch during their lunch break. The game is very interesting because there are exactly $n$ restaurants and each restaurant can accommodate only one agent. If two or more agents happen to choose the same restaurant, only one gets served and the others have to return back to work hungry. In this paper we tackle this problem from an entirely new angle. We abolish certain implicit assumptions, which allows us to propose a novel strategy that results in greater utilization for the restaurants. We emphasize the spatially distributed nature of our approach, which, for the first time, perceives the locations of the restaurants as uniformly distributed in the entire city area. This critical change in perspective has profound ramifications in the topological layout of the restaurants, which now makes it completely realistic to assume that every agent has a second chance. Every agent now may visit, in case of failure, more than one restaurants, within the predefined time constraints.

econ.TH↗