Related papers: Completely greedy coin sets
We review different classes of cryptocurrencies with emphasis on their economic properties. Pure-asset coins such as Bitcoin, Ethereum and Ripple are characterized by not being a liability of any economic agent and most resemble commodities…
We consider positional numeration systems with negative real base $-\beta$, where $\beta>1$, and study the extremal representations in these systems, called here the greedy and lazy representations. We give algorithms for determination of…
Optimal experimental design (OED) concerns itself with identifying ideal methods of data collection, e.g.~via sensor placement. The \emph{greedy algorithm}, that is, placing one sensor at a time, in an iteratively optimal manner, stands as…
Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on…
We investigate the performance of the standard Greedy algorithm for cardinality constrained maximization of non-submodular nondecreasing set functions. While there are strong theoretical guarantees on the performance of Greedy for…
In a model free discrete time financial market, we prove the superhedging duality theorem, where trading is allowed with dynamic and semi-static strategies. We also show that the initial cost of the cheapest portfolio that dominates a…
We present an optimal investment theorem for a currency exchange model with random and possibly discontinuous proportional transaction costs. The investor's preferences are represented by a multivariate utility function, allowing for…
We briefly discuss the greedy method and a couple of its more efficient variants for approximately maximizing monotone submodular functions.
We study four (families of) sets of algebraic integers of degree less than or equal to three. Apart from being simply defined, we show that they share two distinctive characteristics: almost uniformity and arithmetical independence. Here,…
The Binary Vector Clock is a simple, yet space-efficient algorithm for generating a partial order of transactions in account-based blockchain systems. The Binary Vector Clock solves the problem of order dependency in systems such as…
Sequence models are a critical component of modern NLP systems, but their predictions are difficult to explain. We consider model explanations though rationales, subsets of context that can explain individual model predictions. We find…
In this note we consider the maximization of the expected terminal wealth for the setup of quadratic transaction costs. First, we provide a very simple probabilistic solution to the problem. Although the problem was largely studied, as far…
Atomic swaps are a fundamental primitive for the trustless exchange of digital assets across blockchains: they guarantee that either both parties receive the agreed assets or neither party transfers. While this all-or-nothing guarantee is…
We study a generalization of the multi-armed bandit problem with multiple plays where there is a cost associated with pulling each arm and the agent has a budget at each time that dictates how much she can expect to spend. We derive an…
Lo and Chau showed that an ideal quantum coin flipping protocol is impossible. The proof was simply derived from the impossibility proof of quantum bit commitment. However, the proof still leaves the possibility of a quantum coin flipping…
In this paper we investigate the problem of sorting a set of $n$ coins, each with distinct but unknown weights, using an unusual scale. The classical version of this problem, which has been well-studied, gives the user a binary scale,…
Simultaneous operation of all sensors in a large-scale sensor network is power-consuming and computationally expensive. Hence, it is desirable to select fewer sensors. A greedy algorithm is widely used for sensor selection in homogeneous…
In this paper, we study weights for the Thresholding Greedy Algorithm (TGA). While previous work focused on sequential weights $\varsigma = (s_n)_{n\in\mathbb{N}}$ on each positive integer, we study a more general weight $\omega =…
In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In {\em bidding…
"God does not play dice. He flips coins instead." And though for some reason He has denied us quantum bit commitment. And though for some reason he has even denied us strong coin flipping. He has, in His infinite mercy, granted us quantum…