A matrix scheme (also known as a matrix sale or site, and as a hellevator, excavator or ladder scheme) is a business model involving the exchange of money for a certain product with a side bonus of being added to a waiting list for a product of greater value than the amount given.[1] Matrix schemes are also sometimes considered similar to Ponzi or pyramid schemes.[2] They have been called "unsustainable" by the United Kingdom's Office of Fair Trading.[1] A matrix scheme is also an example of an 'exploding queue' in queueing theory.
The first known matrix scheme is widely believed to be EZExpo.com, which started the popularity of matrix schemes in 2002.[2] By 2003 more than 200 matrix schemes were in operation, including one which had the same owner as the payment processor StormPay (TymGlobal). Subsequently, both TymGlobal and StormPay were accused of running an illegal Ponzi scheme.[3] StormPay later claimed to be independent of TymGlobal, and they stopped accepting matrix schemes as customers. Although many have since ceased trading, some schemes are still known to be operating worldwide. The payment processor, StormPay, is no longer trading.
The operation of matrix schemes varies, though they often operate similarly to pyramid or Ponzi schemes.[4] Some of the former participants of these schemes consider them to be a form of confidence trick, although others are happy with their purchase.
To move upward in the list, a person must wait for new members to join or refer a certain number of people to the list. This is accomplished through purchasing a token product of marginal value: usually e-books, cell phone boosters, screen savers, or other software CDs/DVDs. When a pre-defined number of people have purchased the token product, the person currently at the top of the list receives their reward item, and the next person in the list moves to the top. The rewards for those at the top of the matrix list are usually high-demand consumer electronics, such as portable digital audio players, high-definition television sets, laptops, and cellphones. Reaching the point on the list where one receives the expensive goods is termed "cycling".
In many cases, the token product alone could not be reasonably sold for the price listed, and as such legal experts claim that, regardless of what is said, the real product being sold is the "reward" in question in those situations. In these cases, the operator could be charged with running a gambling game or failing to supply ordered products. Steven A. Richards, a lawyer who represents multi-level marketing (MLM) companies for Grimes & Reese in Idaho Falls, Idaho, has stated that often there are no clear legal tests for Ponzi schemes. But if the product sold has no value or very little value, and consumers wouldn't buy it without the attached gift, the scheme probably runs afoul of federal and state laws.[4]
The "Matrix List" by which the sites receive their name would be what is known as a straight-line matrix, or one-by-X matrix. This is similar to many MLMs that use Y-by-X matrices to fill a down-line.
For example, one situation may be a one-by-10 matrix for a video game console (a common reward). In such a matrix the site would usually sell an e-book for $50 to be placed on the list. After nine additional people purchased a spot, the first person would receive either a video game console (or cash value equivalent) and would be removed from the list. The person who had been second would move up to the first spot and an additional 10 people would have to purchase spots in order for that person to receive a console. It is this orderly movement which has also given the name "elevator scheme" to these sites, as people move up the "elevator" (escalator, ladder) to the top at which they would then "cycle" out of the matrix.
In such a matrix, 9 out of 10, or 90 percent, of all customers will not receive the reward item, because the rules of the scheme are that one reward is issued for every 10 customers that join. (The fact that the reward is issued to the customer at the top of the list doesn't change the proportion of rewards given to customers signed up.) Supporters claim that additional revenue streams from advertising are used to keep the lists moving. However, detractors claim that it is impossible to generate enough outside revenue. If the entire world were to join the list, 90 percent of the world would be unable to cycle if the site did not draw sufficient alternate revenue streams. Adding more people to the list does not change the fact that the majority would receive nothing without these streams.
Additionally, the amount of time needed before a given individual will receive the product in question is often mistaken. In a matrix in which 10 people must sign up before cycling, the first person to join only needs nine additional sign-ups to cycle, but the second person needs 18 additional sign-ups: eight more for the person above them, and then 10 more for themself. The third person on the list likewise needs 27 additional signups: seven for the person on top of the list, 10 for the person directly above them, and then 10 for themself. The number of people required continues to grow for each new person joining the list. For the 10th person to cycle a total of 100 people would have to sign up, 1000 for the 100th, and so on.
Through this process, the matrix scheme generates substantial profit for its organiser. At the time of its popularity, for example, a PlayStation 2 cost a maximum of $299. After selling 10 $50 e-books, the organiser could make $500, and could purchase a PS2 for $299 to send to the first bidder while retaining a $201 profit. This same process could be repeated every time the matrix cycles; if the matrix cycled 10 times, the organiser would have sold $5000 worth of e-books, of which $2990 would have been spent on 10 PS2s, leaving them with a profit of $2010.
In queueing theory
A matrix scheme is easily represented as a simple M/M/1 queue within the context of queueing theory. In such a system there is a Markovian arrival, Markovian service, and one single server.[5] In the standard matrix queue, service rates are a function of arrival rates since the time to cycle out of the queue is based on the entry fee into the matrix from arriving members. Also, since members move through the matrix in single file, it is easy to associate the single server.
The basic premise of queueing theory is that when arrival rates equal or exceed service rates, overall waiting time within the queue moves towards infinity.[6]
The basic formulation includes three formulae. The traffic intensity, ρ, is the average arrival rate (λ) divided by the average service rate (μ):
The mean number of customers in the system (N):
And the total waiting time within the queue (T):
It is possible to see that as arrival rates rise towards service rates, the total waiting time (T) and mean number of customers in the system (N) will move towards infinity.[7] Since service time can never exceed the arrival time in the standard matrix, and total waiting time can only be defined if service times exceed arrival times, the only way for the matrix queue to reach stability is for outside income sources to exceed those being entered into the system.
Legality
Currently there are no laws specifically naming matrix schemes illegal in the US. However, the US Federal Trade Commission has issued warnings to the public about these sites. Additionally, the US Federal Trade Commission and the UK Trading Standards have issued warnings to the public regarding the ease with which these models can be manipulated for fraudulent purposes. Many of the original matrix sites, including EZExpo.com, are no longer in operation; some of them closed down while defending civil lawsuits. In 2003 EZExpo and several payment processors were sued in the civil courts for running an illegal lottery in the state of California, with the payment processors abetting the scam.[8][9][10] However, the civil case is still ongoing. One result of the lawsuit is that those payment processors and some others no longer accept matrix schemes as customers. Currently, no legal precedent exists regarding the matrix scheme in the US.
In the UK, the Office of Fair Trading has declared some of them to be illegal. On 1 July 2005, two matrix sites, pulsematrix.com and phones4everyone (themobilematrix.com), were declared to be running a form of illegal lottery. These two sites promptly closed down as part of a settlement agreement with the Office of Fair Trading (OFT). Other similar matrix sites also used this decision to close down their sites. A few UK matrix sites carried on by utilising contractual law to trade legally, with one major site carrying on until May 2006 when it was sold to a company in Denmark. In the UK there is no specific law against matrix sites.
Other countries may have different laws regarding these matrix sites, but information is unavailable at this time.
A Ponzi scheme is a form of fraud that lures investors and pays profits to earlier investors with funds from more recent investors. Named after Italian businessman Charles Ponzi, the scheme leads victims to believe that profits are coming from legitimate business activity, and they remain unaware that other investors are the source of funds. A Ponzi scheme can maintain the illusion of a sustainable business as long as new investors contribute new funds, and as long as most of the investors do not demand full repayment and still believe in the non-existent assets they are purported to own.
A pyramid scheme is a business model that recruits members via a promise of payments or services for enrolling others into the scheme, rather than supplying investments or sale of products. As recruiting multiplies, recruiting becomes quickly impossible, and most members are unable to profit; as such, pyramid schemes are unsustainable and often illegal.
Queueing theory is the mathematical study of waiting lines, or queues. A queueing model is constructed so that queue lengths and waiting time can be predicted. Queueing theory is generally considered a branch of operations research because the results are often used when making business decisions about the resources needed to provide a service.
In mathematical queueing theory, Little's result, theorem, lemma, law, or formula is a theorem by John Little which states that the long-term average number L of customers in a stationary system is equal to the long-term average effective arrival rate λ multiplied by the average time W that a customer spends in the system. Expressed algebraically the law is
Discounts and allowances are reductions to a basic price of goods or services.
A high-yield investment program (HYIP) is a type of Ponzi scheme, an investment scam that promises unsustainably high return on investment by paying previous investors with the money invested by new investors.
In queueing theory, a discipline within the mathematical theory of probability, a Jackson network is a class of queueing network where the equilibrium distribution is particularly simple to compute as the network has a product-form solution. It was the first significant development in the theory of networks of queues, and generalising and applying the ideas of the theorem to search for similar product-form solutions in other networks has been the subject of much research, including ideas used in the development of the Internet. The networks were first identified by James R. Jackson and his paper was re-printed in the journal Management Science’s ‘Ten Most Influential Titles of Management Sciences First Fifty Years.’
In queueing theory, a discipline within the mathematical theory of probability, a G-network is an open network of G-queues first introduced by Erol Gelenbe as a model for queueing systems with specific control functions, such as traffic re-routing or traffic destruction, as well as a model for neural networks. A G-queue is a network of queues with several types of novel and useful customers:
Multi-level marketing (MLM), also called network marketing or pyramid selling, is a controversial marketing strategy for the sale of products or services in which the revenue of the MLM company is derived from a non-salaried workforce selling the company's products or services, while the earnings of the participants are derived from a pyramid-shaped or binary compensation commission system.
In queueing theory, a discipline within the mathematical theory of probability, the Pollaczek–Khinchine formula states a relationship between the queue length and service time distribution Laplace transforms for an M/G/1 queue. The term is also used to refer to the relationships between the mean queue length and mean waiting/service time in such a model.
In queueing theory, a discipline within the mathematical theory of probability, an M/M/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times have an exponential distribution. The model name is written in Kendall's notation. The model is the most elementary of queueing models and an attractive object of study as closed-form expressions can be obtained for many metrics of interest in this model. An extension of this model with more than one server is the M/M/c queue.
Customer to customer markets provide a way to allow customers to interact with each other. Traditional markets require business to customer relationships, in which a customer goes to the business in order to purchase a product or service. In customer to customer markets, the business facilitates an environment where customers can sell goods or services to each other. Other types of markets include business to business (B2B) and business to customer (B2C).
In queueing theory, a discipline within the mathematical theory of probability, the M/M/c queue is a multi-server queueing model. In Kendall's notation it describes a system where arrivals form a single queue and are governed by a Poisson process, there are c servers, and job service times are exponentially distributed. It is a generalisation of the M/M/1 queue which considers only a single server. The model with infinitely many servers is the M/M/∞ queue.
Market America is a multi-level marketing company founded in 1992 by JR and Loren Ridinger. Headquartered in Greensboro, North Carolina, the company employed around 800 people as of 2016. The products offered by the company include household cleaning supplies, jewelry, personal care products, auto care, cosmetics, dietary supplements, custom websites, water purifiers, and weight management products. A 2017 lawsuit accused the company of being an illegal pyramid scheme.
In queueing theory, a discipline within the mathematical theory of probability, an M/G/1 queue is a queue model where arrivals are Markovian, service times have a General distribution and there is a single server. The model name is written in Kendall's notation, and is an extension of the M/M/1 queue, where service times must be exponentially distributed. The classic application of the M/G/1 queue is to model performance of a fixed head hard disk.
In queueing theory, a discipline within the mathematical theory of probability, the M/M/∞ queue is a multi-server queueing model where every arrival experiences immediate service and does not wait. In Kendall's notation it describes a system where arrivals are governed by a Poisson process, there are infinitely many servers, so jobs do not need to wait for a server. Each job has an exponentially distributed service time. It is a limit of the M/M/c queue model where the number of servers c becomes very large.
In queueing theory, a discipline within the mathematical theory of probability, a heavy traffic approximation is the matching of a queueing model with a diffusion process under some limiting conditions on the model's parameters. The first such result was published by John Kingman who showed that when the utilisation parameter of an M/M/1 queue is near 1 a scaled version of the queue length process can be accurately approximated by a reflected Brownian motion.
In queueing theory, a discipline within the mathematical theory of probability, an M/D/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times are fixed (deterministic). The model name is written in Kendall's notation. Agner Krarup Erlang first published on this model in 1909, starting the subject of queueing theory. An extension of this model with more than one server is the M/D/c queue.
In queueing theory, a discipline within the mathematical theory of probability, an M/D/c queue represents the queue length in a system having c servers, where arrivals are determined by a Poisson process and job service times are fixed (deterministic). The model name is written in Kendall's notation. Agner Krarup Erlang first published on this model in 1909, starting the subject of queueing theory. The model is an extension of the M/D/1 queue which has only a single server.
Operations management for services has the functional responsibility for producing the services of an organization and providing them directly to its customers. It specifically deals with decisions required by operations managers for simultaneous production and consumption of an intangible product. These decisions concern the process, people, information and the system that produces and delivers the service. It differs from operations management in general, since the processes of service organizations differ from those of manufacturing organizations.
This page is based on this Wikipedia article Text is available under the CC BY-SA 4.0 license; additional terms may apply. Images, videos and audio are available under their respective licenses.
