## transaction fees – What are the costs of cryptocurrency fraud?

I have heard many claims that transaction volumes can be “faked” for cryptocurrencies, but I am skeptical about how this is possible. I want someone to walk me through the math describing what you need to believe in order to make money by boosting transaction volumes.

1] First, assume a constant velocity of money but a positive transaction cost `t`. Suppose `t` is relatively high. Is it possible to make money as a market manipulator? What would these profits be? Is there a point where `t` prevents you from making money as a manipulator?

2] Second, assume it is possible that coin velocity declines because momentum-driven speculators enter on news that prices rose due to “fake” transaction volumes from the market manipulator. What is the required velocity change as a function of the transaction cost `t`?

I am not sure whether I understand the math here, but I suspect that coin manipulation is possible. However, there is a point where `t` exceeds the possible change in coin velocity, which creates a limit to market manipulation.

## algorithms – Shortest Path in a Directed Acyclic Graph with two types of costs

I am given a directed acyclic graph $$G = (V,E)$$, which can be assumed to be topologically ordered (if needed). The edges in G have two types of costs – a nominal cost $$w(e)$$ and a spiked cost $$p(e)$$.

The goal is to find a path from a node $$s$$ to a node $$t$$ that minimizes the following cost: $$sum_e w(e) + max_e {p(e)},$$ where the sum and maximum are taken over all edges of the path.

Standard dynamic programming methods show that this problem is solvable in $$O(E^2)$$ time. Is there a more efficient way to solve it? Ideally, an $$O(Ecdot operatorname{polylog}(E,V))$$ algorithm would be nice.

## optimization – Value Maximisation Algorithm with multiple costs

So in front of me lies different items. To buy each item you will need a certain amount of multiple things. For example, to buy a lamp, you will need to pay 3 apples, 4 oranges and 17 bananas. Each item has it’s monetary value, and some items can only be unlocked after another item is bought.

To rephrase:

There are n items each with a value of kv.

For each item k, it will cost you a different amount of w, x, y, z.

For some item ki, another item kj needs to be bought for ki to be buyable.

Given a certain amount of w, x, y and z, maximise the total value bought, identifying which items to buy.

I’m figuring out what algorithm I can probably look into.
If you take away the item unlocking part then it looks like a knapsack with multiple weights on each item. What is my best bet on this?

## Cost forecast Azure vs pricing tier costs of SQL database

I have an SQL database on Azure with „Basic“ pricing tier (i.e. 5 DTUS and 2 GB storage) for a price of 7.38 CHF per month.
However, when I go to my subscription, in the „Overview“ section there is a plot that shows the spending rate and a forecast that shows that the costs will be 9.80 CHF.
Until now I was under the assumption that the costs would not change (unless I change the pricing tier of course). What did I miss? How can I more accurately know the costs in advance?

## Averages costs of a wet plate photograph

Im interested in wet plate photography and I would like to know if anyone could give me a first idea how high the average costs for one photograph would be? This would include the plate itself and all the chemicals that are needed (to prepare the wet plate and to develop it).

## ip transit costs to iran

hi several questions
1-best ip transit for iran ? we are near dubai

2-how is the ip transit traffic calculated ? for eg : 100 GE … | Read the rest of https://www.webhostingtalk.com/showthread.php?t=1811327&goto=newpost

## The Medicaid Black Hole That Costs Taxpayers Billions – General Forex Questions & Help

Here’s some cheerful news: States and the federal government are doing little to stop a costly form of Medicaid fraud, according to a government report released last week.

Medicaid, the federal-state health insurance program for poor Americans, now covers more than half its members through what’s known as Medicaid managed care. States pay private companies a fixed rate to insure Medicaid patients. It has become more popular in recent years than the traditional “fee for service” arrangement, in which Medicaid programs reimburse doctors and hospitals directly for each service they provide.

Despite the growth of managed care in recent decades, officials responsible for policing Medicaid “did not closely examine Medicaid managed-care payments, but instead primarily focused their program integrity efforts on [fee-for-service] claims,” according to the Government Accountability Office, the investigative arm of Congress. The managed-care programs made up about 27 percent of federal spending on Medicaid, according to the GAO. The nonpartisan investigators interviewed authorities in California, Florida, Maryland, New Jersey, New York, Ohio, and Texas over the past 12 months.

.

## calculus – Summation with two costs

I need to find for which alpha and beta values, the following summation will converge and for which it will diverge

Any ideas on what law could be helpful with this one? I’m confused with the fact that I have 2 unknown costs and not only one which makes everything much more complex to me.

## costs – Video Game Budgets

How big a role does budget play in the development of video games? Does it put any major restrictions on what the development team can do with the game? Can it limit what assets can be created, what characters can be created. How much can it limit a creator’s ideas of what they want in their game?

## Combinatorics – fractional backpack with setup costs

I am thinking about a variant of the classic fractional backpack problem, which is written in the following integer programming form

Here $$v_i, c_i, w_i, b$$ are all positive. $$c_i$$ can be interpreted as set-up costs for the selection of the element $$i$$. Sure, if we know the best $$x_i$$ For all items, the problem is reduced to a simple fractional backpack problem that can be solved in linear time. However, my question is whether there is a clever way to find the optimal solution using dynamic programming.