TMThemistoklis Melissourgos

Themistoklis Melissourgos

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Themistoklis Melissourgos has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A genetic algorithm for the optimization of multi-threshold trading strategies in the directional changes paradigm

    by Ozgur Salman, Themistoklis Melissourgos, Michael Kampouridis

    This paper proposes a novel genetic algorithm to optimize recommendations from multiple trading strategies derived from the Directional Changes (DC) paradigm. DC is an event-based approach that differs from the traditional physical time data, which employs fixed time intervals and uses a physical time scale. The DC method records price movements when specific events occur instead of using fixed intervals. The determination of these events relies on a threshold, which captures significant changes in price of a given asset. This work employs eight trading strategies that are developed based on directional changes. These strategies were profiled using varying values of thresholds to provide a comprehensive analysis of their effectiveness. In order to optimize and prioritize the conflicting recommendations given by the different trading strategies under different DC thresholds, we are proposing a novel genetic algorithm (GA). To analyze the GA’s trading performance, we utilize 200 stocks listed on the New York Stock Exchange. Our findings show that it can generate highly profitable trading strategies at very low risk levels. The GA is also able to statistically and significantly outperform other DC-based trading strategies, as well as 8 financial trading strategies that are based on technical indicators such as aroon, exponential moving average, and relative strength index, and also buy-and-hold. The proposed GA is also able to outperform the trading performance of 7 market indices, such as the Dow Jones Industrial Average, and the Standard & Poors (S&P) 500.


  • Open Access

    Online EFX Allocations with Predictions

    by Themistoklis Melissourgos, Nicos Protopapas

    We study an online fair division problem where a fixed number of goods arrive sequentially and must be allocated to a given set of agents. Once a good arrives, its true value for each agent is revealed, and it has to be immediately and irrevocably allocated to some agent. The ultimate goal is to ensure envy-freeness up to any good (EFX) after all goods have been allocated. Unfortunately, as we show, approximate EFX allocations are unattainable in general, even under restrictive assumptions on the valuation functions. To address this, we follow a recent and fruitful trend of augmenting algorithms with predictions. Specifically, we assume access to a prediction vector estimating the agents' true valuations -- e.g., generated by a machine learning model trained on past data. Predictions may be unreliable, and we measure their error using the total variation distance from the true valuations, that is, the percentage of predicted value-mass that disagrees with the true values. Focusing on the natural class of additive valuations, we prove impossibility results even on approximate EFX allocations for algorithms that either ignore predictions or rely solely on them. We then turn to algorithms that use both the predictions and the true values and show strong lower bounds on the prediction accuracy that is required by any algorithm to compute an approximate EFX. These negative results persist even under identical valuations, contrary to the offline setting where exact EFX allocations always exist without the necessity of predictions. We then present an algorithm for two agents with identical valuations that uses effectively the predictions and the true values. The algorithm approximates EFX, with its guarantees improving as the accuracy of the predictions increases.

  • Open Access

    Optimization of Multi-Threshold Trading Strategies in the Directional Changes Paradigm

    by Ozgur Salman, Themistoklis Melissourgos, Michael Kampouridis

    The objective of this paper is to investigate the potential of using the Directional Changes (DC) paradigm for financial forecasting. DC is an event-based approach that differs from the traditional physical time data, which employs fixed time intervals and uses a physical time scale. The DC method records price movements when specific events occur instead of using fixed intervals. The determination of these events relies on a threshold, which captures significant changes in price of a given asset. This work employs eight trading strategies that are developed based on directional changes. These strategies were profiled using varying values of thresholds to provide a comprehensive analysis of their effectiveness. In order to enhance the performance of both the thresholds and trading strategies, a genetic algorithm was utilized to optimize their respective weights. This approach provided a more comprehensive analysis and enriched the information available to our trading strategy. To analyze our model in our experiment, we utilized 200 stocks listed on the New York Stock Exchange. Furthermore, the method proposed in this study successfully generated profitable trading strategies that exhibited superior performance when compared to specific DC-based benchmarks commonly utilized in the existing literature. Additionally, the proposed method outperformed conventional strategies based on technical indicators such as ADX, Aroon, CCI, EMA, MACD, RSI, and WilliamR.

  • Open Access

    Pizza Sharing is PPA-hard

    by Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos

    We study the computational complexity of finding a solution for the straight-cut and square-cut pizza sharing problems. We show that computing an $\varepsilon$-approximate solution is PPA-complete for both problems, while finding an exact solution for the square-cut problem is FIXP-hard and in BU. Our PPA-hardness results apply for any $\varepsilon < 1/5$, even when all mass distributions consist of non-overlapping axis-aligned rectangles or when they are point sets, and our FIXP-hardness result applies even when all mass distributions are unions of squares and right-angled triangles. We also prove that the decision variants of both approximate problems are NP-complete, while it is ETR-complete for the exact version of square-cut pizza sharing.

  • Open Access

    On the Smoothed Complexity of Combinatorial Local Search

    by Yiannis Giannakopoulos, Alexander Grosz, Themistoklis Melissourgos

    We propose a unifying framework for smoothed analysis of combinatorial local optimization problems and show how a diverse selection of problems within the complexity class PLS can be cast within this model. This abstraction allows us to identify key structural properties, and corresponding parameters, that determine the smoothed running time of local search dynamics. We formalize this via a black-box tool that provides concrete bounds on the expected maximum number of steps needed until local search reaches an exact local optimum. This bound is particularly strong, in the sense that it holds for any starting feasible solution, any choice of pivoting rule, and does not rely on the choice of specific noise distributions that are applied on the input, but it is parameterized by just a global upper bound $\phi$ on the probability density. We then demonstrate the power of this tool by instantiating it for various PLS-hard problems to derive efficient smoothed running times. This not only unifies, and greatly simplifies, prior existing positive results, but also allows us to extend or improve them. Notable problems on which we provide such a contribution are Max-Cut, the Travelling Salesman problem, and Network Coordination Games. Additionally, in this paper we propose novel smoothed analysis formulations, and prove polynomial smoothed running times, for important local optimization problems that have not been studied before from this perspective. Importantly, we provide an extensive study of the problem of finding pure Nash equilibria in general and Network Congestion Games under various representation models, including explicit, step-function, and polynomial latencies. We show that all the problems we study can be solved by their standard local search algorithms in polynomial smoothed time on PLS-hard instances in which these algorithms have exponential worst-case running time.

  • Open Access

    Pure-Circuit: Strong Inapproximability for PPAD

    by Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos

    The current state-of-the-art methods for showing inapproximability in PPAD arise from the $\varepsilon$-Generalized-Circuit ($\varepsilon$-GCircuit) problem. Rubinstein (2018) showed that there exists a small unknown constant $\varepsilon$ for which $\varepsilon$-GCircuit is PPAD-hard, and subsequent work has shown hardness results for other problems in PPAD by using $\varepsilon$-GCircuit as an intermediate problem. We introduce Pure-Circuit, a new intermediate problem for PPAD, which can be thought of as $\varepsilon$-GCircuit pushed to the limit as $\varepsilon \rightarrow 1$, and we show that the problem is PPAD-complete. We then prove that $\varepsilon$-GCircuit is PPAD-hard for all $\varepsilon < 0.1$ by a reduction from Pure-Circuit, and thus strengthen all prior work that has used GCircuit as an intermediate problem from the existential-constant regime to the large-constant regime. We show that stronger inapproximability results can be derived by reducing directly from Pure-Circuit. In particular, we prove tight inapproximability results for computing $\varepsilon$-well-supported Nash equilibria in two-action polymatrix games, as well as for finding approximate equilibria in threshold games.