You do not have permission to edit this page, for the following reasons:

This IP address has been blocked from editing Wikipedia.
This does not affect your ability to read Wikipedia pages.
Most people who see this message have done nothing wrong. Some kinds of blocks restrict editing from specific service providers or telecom companies in response to recent abuse or vandalism, and can sometimes affect other users who are unrelated to that abuse. Review the information below for assistance if you do not believe that you have done anything wrong.

The IP address or range 3.236.0.0/16 has been blocked (disabled) by ‪ST47‬ for the following reason(s):

The IP address that you are currently using has been blocked because it is believed to be a web host provider. To prevent abuse, web hosts may be blocked from editing Wikipedia.
You will not be able to edit Wikipedia using a web host provider because it hides your IP address, much like a proxy or VPN.
We recommend that you attempt to use another connection to edit. For example, if you use a proxy or VPN to connect to the internet, turn it off when editing Wikipedia. If you edit using a mobile connection, try using a Wi-Fi connection, and vice versa. If you are using a corporate internet connection, switch to a different Wi-Fi network. If you have a Wikipedia account, please log in.
If you do not have any other way to edit Wikipedia, you will need to request an IP block exemption.

How to appeal if you are confident that your connection does not use a web host's IP address:
If you are confident that you are not using a web host, you may appeal this block by adding the following text on your talk page: ((unblock|reason=Caught by a web host block but this host or IP is not a web host. My IP address is _______. Place any further information here. ~~~~)). You must fill in the blank with your IP address for this block to be investigated. Your IP address can be determined here. Alternatively, if you wish to keep your IP address private you can use the unblock ticket request system. There are several reasons you might be editing using the IP address of a web host (such as if you are using VPN software or a business network); please use this method of appeal only if you think your IP address is in fact not a web host.

Administrators: The IP block exemption user right should only be applied to allow users to edit using web host in exceptional circumstances, and they should usually be directed to the functionaries team via email. If you intend to give the IPBE user right, a CheckUser needs to take a look at the account. This can be requested most easily at SPI Quick Checkuser Requests. Unblocking an IP or IP range with this template is highly discouraged without at least contacting the blocking administrator.

This block will expire on 06:21, 30 September 2026.

Even when blocked, you will usually still be able to edit your user talk page, as well as email administrators and other editors.

For information on how to proceed, please read the FAQ for blocked users and the guideline on block appeals. The guide to appealing blocks may also be helpful.

Other useful links: Blocking policy · Help:I have been blocked
Your IP address is in a range that has been blocked on all Wikimedia Foundation wikis. The block was made by ‪Jon Kolbert‬. The reason given is Open proxy/Webhost: See the help page if you are affected .
- Start of block: 05:35, 21 February 2024
- Expiry of block: 05:35, 21 February 2029
Your current IP address is 3.236.201.96. The blocked range is 3.236.0.0/16. Please include all above details in any queries you make. If you believe you were blocked by mistake, you can find additional information and instructions in the No open proxies global policy. Otherwise, to discuss the block please post a request for review on Meta-Wiki. You could also send an email to the stewards VRT queue at stewards@wikimedia.org including all above details.

You can view and copy the source of this page:

((Short description|Type of financial fraud))
((EngvarB|date=January 2014))
((Use dmy dates|date=January 2014))
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.<ref name=oftpress>((cite web|url=http://www.oft.gov.uk/news/press/2005/161-05 |title=Matrix Website Scheme stopped by Office of Fair Trading |access-date=5 August 2006 |url-status=dead |archive-url=https://web.archive.org/web/20070314233701/http://www.oft.gov.uk/news/press/2005/161-05 |archive-date=14 March 2007 ))</ref> Matrix schemes are also sometimes considered similar to [[Ponzi scheme|Ponzi]] or [[Pyramid scheme|pyramid]] schemes.<ref name =msn1>((cite web | url = http://www.nbcnews.com/id/3078957 | title=$150 plasma TV site faces lawsuit | access-date=5 August 2006))</ref> They have been called "unsustainable" by the United Kingdom's [[Office of Fair Trading]].<ref name =oftpress/> A matrix scheme is also an example of an 'exploding queue' in [[queueing theory]].

==History==
The first known matrix scheme is widely believed to be EZExpo.com, which started the popularity of matrix schemes in 2002.<ref name =msn1/> 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.<ref name = leaf>((cite web | url = https://pixyrs.com/mlm-software-development.php| archive-url = https://web.archive.org/web/20180210194900/http://www.pixyrs.com/mlm-software-development.php| url-status = dead| archive-date = 10 February 2018| title = mlm business | access-date = 10 August 2006))</ref> 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.

==Operation==
((Section citations needed|date=July 2023))
The operation of matrix schemes varies, though they often operate similarly to pyramid or Ponzi schemes.<ref name="msn2">((cite web | url = http://www.nbcnews.com/id/3078976 | title=$150 for a plasma TV? A bad bet | access-date=5 August 2006))</ref> 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, [[laptop]]s, 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|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.<ref name = msn2/>

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 of capital in return. But the schemer must take in consideration the actual price of an e-book which could be around 10$. Finally, the buyer would have a profit of $101 (=201-10×10)  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 revenue of $2010, and a profit of $1010. 

==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.<ref>F. S. Hiller and G. J. Lieberman. Introduction to Operations Research. McGraw-Hill, New York, 1995</ref>  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.<ref>Hiller and Lieberman</ref>

The basic formulation includes three formulae. The traffic intensity, ρ, is the average arrival rate (λ) divided by the average service rate (μ):

<math>\rho = \lambda / \mu</math>

The mean number of customers in the system (N):

<math>N = \rho / (1 - \rho)</math>

And the total waiting time within the queue (T):

<math>T = 1 / (\mu - \lambda )</math>

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.<ref name =oftpress2>((cite web | url=http://www.eventhelix.com/RealtimeMantra/CongestionControl/m_m_1_queue.htm
 | title=M/M/1 Queueing System| access-date = 3 March 2007))</ref> 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.<ref>((cite web | url =http://appellatecases.courtinfo.ca.gov/search/case/dockets.cfm?dist=0&doc_id=371626 | title = California Courts – Appellate Court Case Information -Docket Entries| access-date = 6 August 2005))</ref><ref>((cite web | url =http://wagelaw.typepad.com/wage_law/2006/05/prop_64_cases_t.html | title = Wage Law: Prop 64 Cases To Be Argued | access-date = 6 August 2005))</ref><ref>((cite web| url = http://www.diaz-law.com/diazlaw/2005/05/prop_64_to_the_.html| title = The Antitrust Monitor: Prop 64 to the Rescue for Neovi, PaySystems, and PayPal But Not for Ginix| access-date = 6 August 2005| url-status = dead| archive-url = https://web.archive.org/web/20070310050844/http://www.diaz-law.com/diazlaw/2005/05/prop_64_to_the_.html| archive-date = 10 March 2007| df = dmy-all))</ref> 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.

==Notes==
((reflist|colwidth=30em))

==External links==
*[http://www.nbcnews.com/id/3078976 $150 for a plasma TV?  A bad bet] – [[MSNBC]]
*[https://web.archive.org/web/20081030000647/http://www.thisislondon.co.uk/news/article-11783353-details/Warning+over+iPod+scam/article.do Warning over iPod scam] – [[London Evening Standard#Websites|This is London]]
*[https://www.wired.com/news/culture/0,1284,62226,00.html eBay scam uses iPods as bait] – [[Wired magazine|Wired]]
*[http://www.nbcnews.com/id/3078976 MSNBC article]

((Scams and confidence tricks))

[[Category:Pyramid and Ponzi schemes]]

Pages transcluded onto the current version of this page (help):

Matrix scheme (edit)
Template:Ambox (view source) (template editor protected)
Template:Cite web (view source) (protected)
Template:DMCA (view source) (template editor protected)
Template:Dated maintenance category (view source) (template editor protected)
Template:Dated maintenance category (articles) (view source) (template editor protected)
Template:EngvarB (view source) (template editor protected)
Template:FULLROOTPAGENAME (view source) (template editor protected)
Template:Hlist/styles.css (view source) (protected)
Template:Main other (view source) (protected)
Template:More citations needed (view source) (template editor protected)
Template:More citations needed section (view source) (template editor protected)
Template:Navbox (view source) (template editor protected)
Template:Ns has subpages (view source) (protected)
Template:Pagetype (view source) (protected)
Template:Reflist (view source) (protected)
Template:Reflist/styles.css (view source) (protected)
Template:SDcat (view source) (protected)
Template:Scams and confidence tricks (edit)
Template:Section citations needed (edit)
Template:Short description (view source) (protected)
Template:Short description/lowercasecheck (view source) (protected)
Template:Sp (view source) (template editor protected)
Template:Use dmy dates (view source) (template editor protected)
Module:Arguments (view source) (protected)
Module:Category handler (view source) (protected)
Module:Category handler/blacklist (view source) (protected)
Module:Category handler/config (view source) (protected)
Module:Category handler/data (view source) (protected)
Module:Category handler/shared (view source) (protected)
Module:Check for unknown parameters (view source) (protected)
Module:Citation/CS1 (view source) (protected)
Module:Citation/CS1/COinS (view source) (protected)
Module:Citation/CS1/Configuration (view source) (protected)
Module:Citation/CS1/Date validation (view source) (protected)
Module:Citation/CS1/Identifiers (view source) (protected)
Module:Citation/CS1/Utilities (view source) (protected)
Module:Citation/CS1/Whitelist (view source) (protected)
Module:Citation/CS1/styles.css (view source) (protected)
Module:Disambiguation/templates (view source) (protected)
Module:Message box (view source) (protected)
Module:Message box/ambox.css (view source) (protected)
Module:Message box/configuration (view source) (protected)
Module:Namespace detect/config (view source) (protected)
Module:Namespace detect/data (view source) (protected)
Module:Navbar (view source) (protected)
Module:Navbar/configuration (view source) (protected)
Module:Navbar/styles.css (view source) (protected)
Module:Navbox (view source) (template editor protected)
Module:Navbox/configuration (view source) (template editor protected)
Module:Navbox/styles.css (view source) (template editor protected)
Module:Ns has subpages (view source) (protected)
Module:Pagetype (view source) (protected)
Module:Pagetype/config (view source) (protected)
Module:Pagetype/disambiguation (view source) (protected)
Module:Pagetype/setindex (view source) (protected)
Module:Pagetype/softredirect (view source) (protected)
Module:SDcat (view source) (protected)
Module:String (view source) (protected)
Module:Unsubst (view source) (protected)
Module:Wikitext Parsing (view source) (protected)
Module:Yesno (view source) (protected)

Return to Matrix scheme.

Retrieved from "https://en.wikipedia.org/wiki/Matrix_scheme"