{"title":"Semimartingale and continuous-time Markov chain approximation for rough stochastic local volatility models","authors":"Jingtang Ma, Wensheng Yang, Zhenyu Cui","doi":"10.2139/ssrn.3943560","DOIUrl":"https://doi.org/10.2139/ssrn.3943560","url":null,"abstract":"Rough volatility models have recently been empirically shown to provide a good fit to historical volatility time series and implied volatility smiles of SPX options. They are continuous-time stochastic volatility models, whose volatility process is driven by a fractional Brownian motion with Hurst parameter less than half. Due to the challenge that it is neither a semimartingale nor a Markov process, there is no unified method that not only applies to all rough volatility models, but also is computationally efficient. This paper proposes a semimartingale and continuous-time Markov chain (CTMC) approximation approach for the general class of rough stochastic local volatility (RSLV) models. In particular, we introduce the perturbed stochastic local volatility (PSLV) model as the semimartingale approximation for the RSLV model and establish its existence , uniqueness and Markovian representation. We propose a fast CTMC algorithm and prove its weak convergence. Numerical experiments demonstrate the accuracy and high efficiency of the method in pricing European, barrier and American options. Comparing with existing literature, a significant reduction in the CPU time to arrive at the same level of accuracy is observed.","PeriodicalId":363330,"journal":{"name":"Computation Theory eJournal","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123952807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Demystifying algorithmic complexities and geometric review of the ‘h’-index","authors":"K. Ghosh, M. Mukhopadhyay","doi":"10.5281/zenodo.5654779","DOIUrl":"https://doi.org/10.5281/zenodo.5654779","url":null,"abstract":"The current discourse delves into the effectiveness of h-index1 as an author level metric. It further reviews and explains the algorithmic complexity of calculating h-index through algebraic method. To conduct the algebraic analysis propositional algebra, algorithm and coding techniques have been used. Some use cases have been identified with a finite data set/set of array to demonstrate the coding techniques and for further analysis. Finally, the explanation and calculative complexities to determine the index have been further simplified through geometric method of calculating the h-index using the similar use cases that was used for coding. It is concluded that determination of the h-index using Euclidean geometric method with Cartesian frame of reference provides a through and visual clarification. Finally, a set of postulates has been proposed at the end of the paper, based on the case studies.","PeriodicalId":363330,"journal":{"name":"Computation Theory eJournal","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134117341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
G. Chuiko, O. Dvornik, Yevhen Darnapuk, Ye. A. Baganov
{"title":"Devising a New Filtration Method and Proof of Self-Similarity of Electromyograms","authors":"G. Chuiko, O. Dvornik, Yevhen Darnapuk, Ye. A. Baganov","doi":"10.15587/1729-4061.2021.239165","DOIUrl":"https://doi.org/10.15587/1729-4061.2021.239165","url":null,"abstract":"The main attention is paid to the analysis of electromyogram (EMG) signals using Poincaré plots (PP). It was established that the shapes of the plots are related to the diagnoses of patients. To study the fractal dimensionality of the PP, the method of counting the coverage figures was used. The PP filtration was carried out with the help of Haar wavelets. The self-similarity of Poincaré plots for the studied electromyograms was established, and the law of scaling was used in a fairly wide range of coverage figures. Thus, the entire Poincaré plot is statistically similar to its own parts. The fractal dimensionalities of the PP of the studied electromyograms belong to the range from 1.36 to 1.48. This, as well as the values of indicators of Hurst exponent of Poincaré plots for electromyograms that exceed the critical value of 0.5, indicate the relative stability of sequences.\u0000The algorithm of the filtration method proposed in this research involves only two simple stages:\u0000\u0000Conversion of the input data matrix for the PP using the Jacobi rotation.\u0000Decimation of both columns of the resulting matrix (the so-called \"lazy wavelet-transformation\", or double downsampling).\u0000\u0000The algorithm is simple to program and requires less machine time than existing filters for the PP.\u0000Filtered Poincaré plots have several advantages over unfiltered ones. They do not contain extra points, allow direct visualization of short-term and long-term variability of a signal. In addition, filtered PPs retain both the shape of their prototypes and their fractal dimensionality and variability descriptors. The detected features of electromyograms of healthy patients with characteristic low-frequency signal fluctuations can be used to make clinical decisions.","PeriodicalId":363330,"journal":{"name":"Computation Theory eJournal","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125069331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Limiting dynamics for Q-learning with memory one in two-player, two-action games","authors":"J. Meylahn","doi":"10.2139/ssrn.3895751","DOIUrl":"https://doi.org/10.2139/ssrn.3895751","url":null,"abstract":"We develop a computational method to identify all pure strategy equilibrium points in the strategy space of the two-player, two-action repeated games played by Q-learners with one period memory. In order to approximate the dynamics of these Q-learners, we construct a graph of pure strategy mutual best-responses. We apply this method to the iterated prisoner’s dilemma and find that there are exactly three absorbing states. By analyzing the graph for various values of the discount factor, we find that, in addition to the absorbing states, limit cycles become possible. We confirm our results using numerical simulations.","PeriodicalId":363330,"journal":{"name":"Computation Theory eJournal","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114294080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Online Document for WSC 2021 con132","authors":"Haoting Zhang, Jinghai He, Donglin Zhan, Zeyu Zheng","doi":"10.2139/ssrn.3877499","DOIUrl":"https://doi.org/10.2139/ssrn.3877499","url":null,"abstract":"This is the online document for WSC 2021 con132","PeriodicalId":363330,"journal":{"name":"Computation Theory eJournal","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126563898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Economic Growth and Equity in Anticipation of Climate Policy","authors":"A. Miftakhova, Clément Renoir","doi":"10.2139/ssrn.3866418","DOIUrl":"https://doi.org/10.2139/ssrn.3866418","url":null,"abstract":"We study the role of the anticipation of climate policies on equity and economic growth in a numerical model of general equilibrium. The presence of the anticipation period allows the agents to adjust their choices before policy implementation. This period might change the equilibrium dynamics. It might also impact the redistribution of wealth in the economy. We choose the Swiss economy to exemplify and analyze these effects. The supply-side of the economy adjusts by redirecting the investments to \"cleaner'' sectors with a lower tax burden and higher profitability. On the demand side, welfare impacts by households vary according to their principal source of income. Households that have a high share of their income from capital rents benefit more from the policy’s announcement than others do. We find that, for the most stringent climate policies, the effect of anticipation is strongly positive but also regressive.","PeriodicalId":363330,"journal":{"name":"Computation Theory eJournal","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114006593","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jacob B. Feldman, D. Segev, Huseyin Topaloglu, Laura Wagner, Yicheng Bai
{"title":"Assortment Optimization under the Multi-Purchase Multinomial Logit Choice Model","authors":"Jacob B. Feldman, D. Segev, Huseyin Topaloglu, Laura Wagner, Yicheng Bai","doi":"10.2139/ssrn.3866734","DOIUrl":"https://doi.org/10.2139/ssrn.3866734","url":null,"abstract":"Updating a Classic: Assortment Optimization under the Multi-Purchase MNL Model In the paper “Updating a Classic: Assortment Optimization under the Multi-Purchase MNL Model,” our primary contribution resides in proposing the first multi-purchase choice model that can be fully operationalized. Our main algorithmic results consist of two distinct polynomial time approximation schemes (PTAS); the first, and simpler of the two, caters to a setting where each customer may buy only a constant number of products, whereas the second, more nuanced algorithm applies to our multi-purchase model in its general form. Additionally, we study the revenue potential of making assortment decisions that account for multi-purchase behavior in comparison with those that overlook this phenomenon. In particular, we relate both the structure and revenue performance of the optimal assortment under a traditional single-purchase model to that of the optimal assortment in the multi-purchase setting.","PeriodicalId":363330,"journal":{"name":"Computation Theory eJournal","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128056353","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fabiana Di Porto, Tatjana Grote, Gabriele Volpi, Riccardo invernizzi
{"title":"'I See Something You Don't See'. A Computational Analysis of the Digital Services Act and the Digital Markets Act","authors":"Fabiana Di Porto, Tatjana Grote, Gabriele Volpi, Riccardo invernizzi","doi":"10.51868/6","DOIUrl":"https://doi.org/10.51868/6","url":null,"abstract":"In its latest proposals, the Digital Markets Act (DMA) and Digital Services Act (DSA), the European Commission puts forward several new obligations for online intermediaries, especially large online platforms and “gatekeepers.” Both are expected to serve as a blueprint for regulation in the United States, where lawmakers have also been investigating competition on digital platforms and new antitrust laws passed the House Judiciary Committee as of June 11, 2021. This Article investigates whether all stakeholder groups share the same understanding and use of the relevant terms and concepts of the DSA and DMA. Leveraging the power of computational text analysis, we find significant differences in the employment of terms like “gatekeepers,” “self-preferencing,” “collusion,” and others in the position papers of the consultation process that informed the drafting of the two latest Commission proposals. Added to that, sentiment analysis shows that in some cases these differences also come with dissimilar attitudes. While this may not be surprising for new concepts such as gatekeepers or self-preferencing, the same is not true for other terms, like “self-regulatory,” which not only is used differently by stakeholders but is also viewed more favorably by medium and big companies and organizations than by small ones. We conclude by sketching out how different computational text analysis tools, could be combined to provide many helpful insights for both rulemakers and legal scholars.","PeriodicalId":363330,"journal":{"name":"Computation Theory eJournal","volume":"1176 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120932530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Solving linear rational expectations models in the presence of structural change: Some refinements","authors":"M. Hatcher","doi":"10.2139/ssrn.3875375","DOIUrl":"https://doi.org/10.2139/ssrn.3875375","url":null,"abstract":"Standard solution methods for linear rational expectations models assume a time-invariant structure. Recent work has gone beyond this by formulating solution methods for linear rational expectations models subject to structural changes, such as parameter shifts and policy reforms, that are announced in advance. This paper contributes to this literature by presenting a backward recursive solution method that is fast, general and easy to use: the only technical requirement is that the user `write down' the structural matrices in each regime; the solution is then found recursively using these matrices. I provide a series of examples and show how the method can deal with some important structural changes - such as imperfectly credible policy reforms and shifts to multiple equilibria (sunspots) - that received little attention in recent literature.","PeriodicalId":363330,"journal":{"name":"Computation Theory eJournal","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132772024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modelling India's Second Covid Wave Based on Human Social Behaviour and Creating the SVIR Model","authors":"Ashna Jain","doi":"10.2139/ssrn.3878779","DOIUrl":"https://doi.org/10.2139/ssrn.3878779","url":null,"abstract":"The Covid-19 pandemic has affected more than 150 million people around the world. India has been hit particularly hard, especially the second wave from March 2021 till present(May 2021). The current model used for prediction of covid transmission is the susceptible-recovered-infected(SIR) model, however it is unable to model real life social scenarios which have major impact on the spread of contagious diseases. Research has already linked a higher transmission rates in countries with a denser population, however this paper focuses on changing density due to social scenarios in the same region to estimate the impact of human behaviour. We combine Covid-19 data with human social behaviour to create a modified model specific to India, using regression to calculate the contact rate.Making it a function of density, we estimate how far super spreader events conducted in India such as the kumbh mela and political rallies contributed to the second wave. We then model future trends, exploring how human behaviour will change the trajectory of the second wave and why a nationwide lockdown is absolutely critical, given not just the sheer number of cases, but also slow vaccination rates, overcrowding of hospitals and the ongoing oxygen crisis. We forecast number of Covid cases in the future in three different situations, a super spreader event is conducted, nothing changes, and a nation-wide lockdown, discovering that contact rate should be modelled as a function of density and human social behaviour should explicitly be used in transmission models that predict the impact of Covid19. We also factor in vaccination rates creating the SVIR model, evaluating the impact of vaccine roll out as compared to lock downs, concluding the social distancing and covid precautions will need to be continued until at least triple of India's current daily vaccine roll out is achieved, which will flatten the curve by reducing the number of susceptible people significantly.","PeriodicalId":363330,"journal":{"name":"Computation Theory eJournal","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114121134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}