Coin-matching game: Difference between revisions
Content deleted Content added
m →top: http→https for Google Books and Google News using AWB |
No edit summary |
||
| (8 intermediate revisions by 7 users not shown) | |||
| Line 1: | Line 1: | ||
{{Short description|Confidence trick in which two con artists set up one victim}} |
|||
{{about|the confidence trick|the two-person game|matching pennies}} |
{{about|the confidence trick|the two-person game|matching pennies}} |
||
A '''coin-matching game''' (also a '''coin smack'''<ref name="porter1968">Porter, Thomas J. Jr. (November 28, 1969). Con Artists Show Diversified Skills. ''[[Pittsburgh Post-Gazette]]''</ref> or '''smack game'''<ref name="ap1963">Associated Press (January 11, 1963). 3 sentenced; they picked wrong man. ''[[The Spokesman-Review]]''</ref>) is a [[confidence trick]] in which two con artists set up one victim. |
A '''coin-matching game''' (also a '''coin smack'''<ref name="porter1968">Porter, Thomas J. Jr. (November 28, 1969). Con Artists Show Diversified Skills. ''[[Pittsburgh Post-Gazette]]''</ref> or '''smack game'''<ref name="ap1963">Associated Press (January 11, 1963). 3 sentenced; they picked wrong man. ''[[The Spokesman-Review]]''</ref>) is a [[confidence trick]] in which two con artists set up one victim. |
||
The first con artist strikes up a conversation with the victim, usually while waiting somewhere. The con artist suggests [[matching pennies]] (or other [[coin]]s) to pass the time. The second con artist arrives and joins in, but soon leaves for a moment. The first con artist then suggests [[cheating]]. The victim, thinking they are going to scam the second con artist, agrees to match coins each time. |
The first con artist strikes up a conversation with the victim, usually while waiting somewhere. The con artist suggests [[matching pennies]] (or other [[coin]]s) to pass the time. The second con artist arrives and joins in, but soon leaves for a moment. The first con artist then suggests [[cheating]]. The victim, thinking they are going to scam the second con artist, agrees to match coins each time. |
||
When the second con artist returns and begins losing, he accuses the two of cheating and threatens to call the police. The first con artist offers a sizable sum of [[hush money]], and the victim |
When the second con artist returns and begins losing, he accuses the two of cheating and threatens to call the police. The first con artist offers a sizable sum of [[hush money]], and the victim contributes something too. After the victim leaves, the two con artists split up the money [[extortion|extorted]] from the victim.<ref name="nyt1913">Staff report (November 9, 1913). Coin matchers of Times Square are doing rushing business; Detective Says He Knows No Less than 100 Professionals in That Line, Who Feel Safe Because Few Ever Get "Sent Up." ''[[The New York Times]]''</ref> |
||
In [[game theory]] the term refers to a [[zero-sum]] [[two-person game]] of [[imperfect information]] (not involving a third player or collusion);<ref name="JamesJames1992">{{cite book|author1=Robert Clarke James|author2=Glenn James|title=Mathematics dictionary|url=https://books.google.com/books?id=UyIfgBIwLMQC&pg=PA180|year=1992|publisher=Springer|isbn=978-0-412-99041-0|page=180}}</ref><ref name="Tan2005">{{cite book|author=Soo Tang Tan|title=Finite mathematics for the managerial, life, and social sciences|url=https://books.google.com/books?id=ljPYuge6gk0C&pg=PA543|year=2005|publisher=Cengage Learning|isbn=978-0-534-49214-4|page=543}}</ref><ref name="ChernoffMoses1959">{{cite book|author1= |
In [[game theory]] the term refers to a [[zero-sum]] [[two-person game]] of [[imperfect information]] (not involving a third player or collusion);<ref name="JamesJames1992">{{cite book|author1=Robert Clarke James|author2=Glenn James|title=Mathematics dictionary|url=https://books.google.com/books?id=UyIfgBIwLMQC&pg=PA180|year=1992|publisher=Springer|isbn=978-0-412-99041-0|page=180}}</ref><ref name="Tan2005">{{cite book|author=Soo Tang Tan|title=Finite mathematics for the managerial, life, and social sciences|url=https://books.google.com/books?id=ljPYuge6gk0C&pg=PA543|year=2005|publisher=Cengage Learning|isbn=978-0-534-49214-4|page=543}}</ref><ref name="ChernoffMoses1959">{{cite book|author1=Herman Chernoff|author1-link=Herman Chernoff|author2-link=Lincoln E. Moses|author2=Lincoln E. Moses|title=Elementary decision theory|url=https://books.google.com/books?id=U9yQVLHLgT4C&pg=PA346|year=1959|publisher=Courier Dover Publications|isbn=978-0-486-65218-4|page=346}}</ref> other variations on the name are "matching coins" or "[[matching pennies]]".<ref name="Morris1994">{{cite book|author=Peter Morris|title=Introduction to game theory|url=https://books.google.com/books?id=cExIHG3TN0IC&pg=PA11|year=1994|publisher=Springer|isbn=978-0-387-94284-1|page=11}}</ref><ref name="González-DíazGarcía-Jurado2010">{{cite book|author1=Julio González-Díaz|author2=Ignacio García-Jurado|author3=M. Gloria Fiestras-Janeiro|title=An Introductory Course on Mathematical Game Theory|url=https://books.google.com/books?id=pylGCDbRsPkC&pg=PA29|year=2010|publisher=AMS Bookstore|isbn=978-0-8218-5151-7|page=29}}</ref> |
||
==References== |
==References== |
||
{{ |
{{Reflist}} |
||
{{Scams and confidence tricks}} |
{{Scams and confidence tricks}} |
||
{{Tricky}} |
|||
{{DEFAULTSORT:Coin-matching game}} |
{{DEFAULTSORT:Coin-matching game}} |
||
| Line 17: | Line 19: | ||
[[Category:Deception]] |
[[Category:Deception]] |
||
[[Category:Fraud]] |
[[Category:Fraud]] |
||
{{crime-stub}} |
{{crime-stub}} |
||
Latest revision as of 06:32, 16 August 2023
A coin-matching game (also a coin smack[1] or smack game[2]) is a confidence trick in which two con artists set up one victim.
The first con artist strikes up a conversation with the victim, usually while waiting somewhere. The con artist suggests matching pennies (or other coins) to pass the time. The second con artist arrives and joins in, but soon leaves for a moment. The first con artist then suggests cheating. The victim, thinking they are going to scam the second con artist, agrees to match coins each time.
When the second con artist returns and begins losing, he accuses the two of cheating and threatens to call the police. The first con artist offers a sizable sum of hush money, and the victim contributes something too. After the victim leaves, the two con artists split up the money extorted from the victim.[3]
In game theory the term refers to a zero-sum two-person game of imperfect information (not involving a third player or collusion);[4][5][6] other variations on the name are "matching coins" or "matching pennies".[7][8]
References
[edit]- ^ Porter, Thomas J. Jr. (November 28, 1969). Con Artists Show Diversified Skills. Pittsburgh Post-Gazette
- ^ Associated Press (January 11, 1963). 3 sentenced; they picked wrong man. The Spokesman-Review
- ^ Staff report (November 9, 1913). Coin matchers of Times Square are doing rushing business; Detective Says He Knows No Less than 100 Professionals in That Line, Who Feel Safe Because Few Ever Get "Sent Up." The New York Times
- ^ Robert Clarke James; Glenn James (1992). Mathematics dictionary. Springer. p. 180. ISBN 978-0-412-99041-0.
- ^ Soo Tang Tan (2005). Finite mathematics for the managerial, life, and social sciences. Cengage Learning. p. 543. ISBN 978-0-534-49214-4.
- ^ Herman Chernoff; Lincoln E. Moses (1959). Elementary decision theory. Courier Dover Publications. p. 346. ISBN 978-0-486-65218-4.
- ^ Peter Morris (1994). Introduction to game theory. Springer. p. 11. ISBN 978-0-387-94284-1.
- ^ Julio González-Díaz; Ignacio García-Jurado; M. Gloria Fiestras-Janeiro (2010). An Introductory Course on Mathematical Game Theory. AMS Bookstore. p. 29. ISBN 978-0-8218-5151-7.
 | This crime-related article is a stub. You can help Wikipedia by expanding it. |
 | This game-related article is a stub. You can help Wikipedia by expanding it. |