Searcharxiv⌕ Search

arXiv subjects

Katerina Papadaki

Publications and source records attributed to Katerina Papadaki.

8 recordsLinked to original sources

Virtual Double Oracle: Faster Convergence by Leveraging Strategies That Were Watching All Along

Double Oracle (DO) and PSRO approximate Nash equilibria in two-player zero-sum games by iteratively expanding a strategy population with best responses supplied by an oracle. Online Double Oracle (ODO) interleaves multiplicative weights updates (MWU) with population discovery and obtains an $O(\sqrt{k\ln k/T})$ rate, where $T$ is the number of learning rounds and $k$ is the larger of the two players' final population sizes. We identify the reinitialisation step as an underexplored design choice: at each expansion, MWU-based methods reset newly discovered strategies to a uniform prior. We introduce Virtual Double Oracle (VDO), which exploits a bilinear identity (a strategy's full hindsight loss history collapses to its utility against the time-averaged opponent) to initialise each new strategy with the MWU weight it would have had from the start. We prove that VDO achieves $O(\sqrt{k/T})$ exploitability over the discovered population as it grows, provided the cumulative cost of adding strategies is at most linear in $k$, a condition supported by our empirical measurements. Discounted VDO (dVDO) moderates historical preferences to reduce over-concentration at reinitialisation. Experiments across matrix games, poker, and Goofspiel show that, with a suitable discount, dVDO can substantially reduce finite-horizon exploitability relative to both VDO and uniform-reset ODO, and can improve the discovered strategy populations.

cs.LG↗

Learning to Incentivise: Using Reinforcement Learning for Sustainable Urban Mobility

Traffic management has traditionally focused on toll-based and road pricing solutions. However, road pricing often raises concerns about accessibility and public dissatisfaction, leading to its prohibition in some places, such as Finland. This study optimises the dynamic allocation of incentives to drivers, encouraging them to reroute onto alternative (potentially longer) paths to achieve greater societal benefit, reduced total travel time (TTT) and total emissions in the transportation network, contributing to sustainable urban mobility. We employ a multi-agent reinforcement learning approach to dynamically assign incentives to drivers to reduce both TTT and emissions, with travel times estimated using traffic simulation software. We demonstrate that, with an unlimited budget and an objective of minimising travel time, the incentive scheme reduces TTT by 16%, compared to the dynamic User-Equilibrium (UE) with a budget equivalent to about 11% of the UE total time. When the goal is to minimise emissions, a 9% reduction in CO2 emissions is observed under an unlimited budget. We demonstrate a critical trade-off: minimising TTT leads to an increase in emissions, while prioritising emission reductions raises TTT. However, with the right combination of weights in the multi-objective function, both TTT and total emissions are improved beyond the baseline.

cs.MA↗

Wide Area Linear Optical Polarimeter Control Software

The WALOPControl software is designed to facilitate comprehensive control and operation of the WALOP (Wide Area Linear Optical Polarimeter) polarimeters, ensuring safe and concurrent management of various instrument components and functionalities. This software encompasses several critical requirements, including control of the filter wheel, calibration half-wave plate, calibration polarizer, guider positioning, focusers, and 4 concurrent CCD cameras. It also manages the host telescope and dome operations while logging operational parameters, user commands, and environmental conditions for troubleshooting and stability. It provides a user-friendly graphical user interface, secure access control, a notification system for errors, and a modular configuration for troubleshooting are integral to the software's architecture. It is accessible over the internet with the backend developed using NodeJS and ExpressJS, featuring a RESTful API that interacts with a MongoDB database, facilitating real-time status updates and data logging. The frontend utilizes the React.JS framework, with Redux for state management and Material UI for the graphical components. The system also allows for automatic observations based on user-defined schedules. A Continuous Integration and Continuous Deployment (CI CD) pipeline ensures the software's reliability through automated testing and streamlined deployment. The WALOPControl software is a key component of the PASIPHAE (Polar-Areas Stellar Imaging in Polarimetry High Accuracy Experiment) project, which aims to study the dust and magnetic field of the Milky Way by observing the polarization of starlight.

astro-ph.IM↗

The WALOP-North Instrument I: Optical Design, Filter Design, Calibration

The Wide Area Linear Optical Polarimeter North (WALOP-North) is an optical polarimeter designed for the needs of the PASIPHAE survey. It will be installed on the 1.3m telescope at the Skinakas Observatory in Crete, Greece. After commissioning, it will measure the polarization of millions of stars at high Galactic latitude, aiming to measure hundreds of stars per $deg^2$. The astronomical filter used in the instrument is a modified, polarimetrically-neutral broadband SDSS-r. This instrument will be pioneering one due to its large field-of-view (FoV) of $30\times 30$ $arcmin^2$ and high accuracy polarimetry measurements. The accuracy and sensitivity of the instrument in polarization fraction will be at the 0.1\% and 0.05\% level, respectively. Four separate 4k$\times$4k CCDs will be used as the instrument detectors, each imaging one of the $0°, 45°, 90°$ and $135°$ polarized FoV separately, therefore making the instrument a four-channel, one-shot polarimeter. Here, we present the overall optical design of the instrument, emphasizing on the aspects of the instrument that are different from WALOP-South. We also present a novel design of filters appropriate for polarimetry along with details on the management of the instrument size and its polarimetric calibration.

astro-ph.IM↗

Continuous Patrolling Games

We study a patrolling game played on a network $Q$, considered as a metric space. The Attacker chooses a point of $Q$ (not necessarily a node) to attack during a chosen time interval of fixed duration. The Patroller chooses a unit speed path on $Q$ and intercepts the attack (and wins) if she visits the attacked point during the attack time interval. This zero-sum game models the problem of protecting roads or pipelines from an adversarial attack. The payoff to the maximizing Patroller is the probability that the attack is intercepted. Our results include the following: (i) a solution to the game for any network $Q$, as long as the time required to carry out the attack is sufficiently short, (ii) a solution to the game for all tree networks that satisfy a certain condition on their extremities, and (iii) a solution to the game for any attack duration for stars with one long arc and the remaining arcs equal in length. We present a conjecture on the solution of the game for arbitrary trees and establish it in certain cases.

cs.DM↗

WALOP-South: A Four-Camera One-Shot Imaging Polarimeter for PASIPHAE Survey. Paper II -- Polarimetric Modelling and Calibration

The Wide-Area Linear Optical Polarimeter (WALOP)-South instrument is an upcoming wide-field and high-accuracy optical polarimeter to be used as a survey instrument for carrying out the Polar-Areas Stellar Imaging in Polarization High Accuracy Experiment (PASIPHAE) program. Designed to operate as a one-shot four-channel and four-camera imaging polarimeter, it will have a field of view of $35\times 35$ arcminutes and will measure the Stokes parameters $I$, $q$, and $u$ in a single exposure in the SDSS-r broadband filter. The design goal for the instrument is to achieve an overall polarimetric measurement accuracy of 0.1 % over the entire field of view. We present here the complete polarimetric modeling of the instrument, characterizing the amount and sources of instrumental polarization. To accurately retrieve the real Stokes parameters of a source from the measured values, we have developed a calibration method for the instrument. Using this calibration method and simulated data, we demonstrate how to correct instrumental polarization and obtain 0.1 % accuracy in the degree of polarization, $p$. Additionally, we tested and validated the calibration method by implementing it on a table-top WALOP-like test-bed polarimeter in the laboratory.

astro-ph.IM↗

Periodic Patrols on the Line and Other Networks

We consider a patrolling game on a graph recently introduced by Alpern et al. (2011) where the Patroller wins if he is at the attacked node while the attack is taking place. This paper studies the periodic patrolling game in the case that the attack duration is two periods. We show that if the Patroller's period is even, the game can be solved on any graph by finding the fractional covering number and fractional independence number of the graph. We also give a complete solution to the periodic patrolling game on line graphs of arbitrary size, extending the work of Papadaki et al. (2016) to the periodic domain. This models the patrolling problem on a border or channel, which is related to a classical problem of operational research going back to Morse and Kimball (1951). A periodic patrol is required to start and end at the same location, for example the place where the Patroller leaves his car to begin a foot patrol.

math.OC↗

Optimal Power Allocation in Block Fading Gaussian Channels with Causal CSI and Secrecy Constraints

The optimal power allocation that maximizes the secrecy capacity of block fading Gaussian (BF-Gaussian) networks with causal channel state information (CSI), M-block delay tolerance and a frame based power constraint is examined. In particular, we formulate the secrecy capacity maximization as a dynamic program. We propose suitable linear approximations of the secrecy capacity density in the low SNR, the high SNR and the intermediate SNR regimes, according to the overall available power budget. Our findings indicate that when the available power resources are very low (low SNR case) the optimal strategy is a threshold policy. On the other hand when the available power budget is infinite (high SNR case) a constant power policy maximizes the frame secrecy capacity. Finally, when the power budget is finite (medium SNR case), an approximate tractable power allocation policy is derived.

cs.IT↗