The weighted $\mathcal{T}$-free $2$-matching problem is the following problem: given an undirected graph $G$, a weight function on its edge set, and a set $\mathcal{T}$ of triangles in $G$, find a maximum weight $2$-matching containing no triangle in $\mathcal{T}$. When $\mathcal{T}$ is the set of all triangles in $G$, this problem is known as the…
Reversible computation has been recognised as a potential solution to the technological bottleneck in the future of computing machinery. Rolf Landauer determined the lower limit for power dissipation in computation and noted that dissipation happens when information is lost, i.e., when a bit is erased. This meant that reversible computation, conserving information conserves energy as…
We develop a theory of monotone comparative statics based on weak set order, or in short weak monotone comparative statics, and identify the enabling conditions in the context of individual choices, Pareto optimal choices for a coalition of agents, and Nash equilibria of games. Compared with the existing theory based on strong set order, the…
Variational AutoEncoders (VAEs) provide a means to generate representational latent embeddings. Previous research has highlighted the benefits of achieving representations that are disentangled, particularly for downstream tasks. However, there is some debate about how to encourage disentanglement with VAEs and evidence indicates that existing implementations of VAEs do not achieve disentanglement consistently. The evaluation of…
Bitcoin draws the highest degree of attention among cryptocurrencies, while coin mining is one of the most important fashion of profiting in the Bitcoin ecosystem. This paper constructs fresh coin circulation networks by tracking the fresh coin transfer routes with transaction referencing in Bitcoin blockchain. This paper proposes a heuristic algorithm to identifying coin miners…
We develop a theory of monotone comparative statics based on weak set order, or in short weak monotone comparative statics, and identify the enabling conditions in the context of individual choices, Pareto optimal choices for a coalition of agents, and Nash equilibria of games. Compared with the existing theory based on strong set order, the…
Assortment optimization is an important problem that arises in many practical applications such as retailing and online advertising where the goal is to find a subset of products from a universe of substitutable products that maximize a seller’s expected revenue. The demand and the revenue depend on the substitution behavior of the customers that is…
We study the qualitative and quantitative appearance of stylized facts in several agent-based computational economic market (ABCEM) models. We perform our simulations with the SABCEMM (Simulator for Agent-Based Computational Economic Market Models) tool recently introduced by the authors (Trimborn et al. 2019). Furthermore, we present novel ABCEM models created by recombining existing models and study…
In this paper we develop a novel method of wholesale electricity market modeling. Our optimization-based model decomposes wholesale supply and demand curves into buy and sell orders of individual market participants. In doing so, the model detects and removes arbitrage orders. As a result, we construct an innovative fundamental model of a wholesale electricity market.…
This work presents an approximate solution of the portfolio choice problem for the investor with a power utility function and the predictable returns. Assuming that asset returns follow the vector autoregressive process with the normally distributed error terms (what is a popular choice in financial literature to model the return path) it comes up with…