Bayesian Modeling of Decision Makers' Skill
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Chapter Two Massey’S Method
Chapter Two Massey’s Method The Bowl Championship Series (BCS) is a rating system for NCAA college football that wasdesignedtodeterminewhichteamsareinvitedtoplayinwhichbowlgames.The BCS has become famous, and perhaps notorious, for the ratings it generates for each team in the NCAA. These ratings are assembled from two sources, humans and computers. Human input comes from the opinions of coaches and media. Computer input comes from six computer and mathematical models—details are given in the aside on page 17. The BCS ratings for the 2001 and 2003 seasons are known as particularly controversial among sports fans and analysts. The flaws in the BCS selection system as opposed to a tournament playoff are familiar to most, including the President of the United States—read the aside on page 19. Initial Massey Rating Method In 1997, Kenneth Massey, then an undergraduate at Bluefield College, created a method for ranking college football teams. He wrote about this method, which uses the mathematical theory of least squares, as his honors thesis [52]. In this book we refer to this as the Massey method, despite the fact that there are actually several other methods attributed to Ken Massey. Massey has since become a mathematics professor at Carson-Newman College and today continues to refine his sports ranking models. Professor Massey has created various rat- ing methods, one of which is used by the Bowl Championship Series K. Massey (or BCS) system to select NCAA football bowl matchups—see the aside on page 17. The Colley method, described in the next chapter, is also one of the six computer rating sys- tems used by the BCS. -
Should Chess Players Learn Computer Security?
1 Should Chess Players Learn Computer Security? Gildas Avoine, Cedric´ Lauradoux, Rolando Trujillo-Rasua F Abstract—The main concern of chess referees is to prevent are indeed playing against each other, instead of players from biasing the outcome of the game by either collud- playing against a little girl as one’s would expect. ing or receiving external advice. Preventing third parties from Conway’s work on the chess grandmaster prob- interfering in a game is challenging given that communication lem was pursued and extended to authentication technologies are steadily improved and miniaturized. Chess protocols by Desmedt, Goutier and Bengio [3] in or- actually faces similar threats to those already encountered in der to break the Feige-Fiat-Shamir protocol [4]. The computer security. We describe chess frauds and link them to their analogues in the digital world. Based on these transpo- attack was called mafia fraud, as a reference to the sitions, we advocate for a set of countermeasures to enforce famous Shamir’s claim: “I can go to a mafia-owned fairness in chess. store a million times and they will not be able to misrepresent themselves as me.” Desmedt et al. Index Terms—Security, Chess, Fraud. proved that Shamir was wrong via a simple appli- cation of Conway’s chess grandmaster problem to authentication protocols. Since then, this attack has 1 INTRODUCTION been used in various domains such as contactless Chess still fascinates generations of computer sci- credit cards, electronic passports, vehicle keyless entists. Many great researchers such as John von remote systems, and wireless sensor networks. -
Predicting Outcomes of NCAA Basketball Tournament Games
Cripe 1 Predicting Outcomes of NCAA Basketball Tournament Games Aaron Cripe March 12, 2008 Math Senior Project Cripe 2 Introduction All my life I have really enjoyed watching college basketball. When I was younger my favorite month of the year was March, solely because of the fact that the NCAA Division I Basketball Tournament took place in March. I would look forward to filling out a bracket every year to see how well I could predict the winning teams. I quickly realized that I was not an expert on predicting the results of the tournament games. Then I started wondering if anyone was really an expert in terms of predicting the results of the tournament games. For my project I decided to find out, or at least compare some of the top rating systems and see which one is most accurate in predicting the winner of the each game in the Men’s Basketball Division I Tournament. For my project I compared five rating systems (Massey, Pomeroy, Sagarin, RPI) with the actual tournament seedings. I compared these systems by looking at the pre-tournament ratings and the tournament results for 2004 through 2007. The goal of my project was to determine which, if any, of these systems is the best predictor of the winning team in the tournament games. Project Goals Each system that I compared gave a rating to every team in the tournament. For my project I looked at each game and then compared the two team’s ratings. In most cases the two teams had a different rating; however there were a couple of games where the two teams had the same rating which I will address later. -
On the Limits of Engine Analysis for Cheating Detection in Chess
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Kent Academic Repository computers & security 48 (2015) 58e73 Available online at www.sciencedirect.com ScienceDirect journal homepage: www.elsevier.com/locate/cose On the limits of engine analysis for cheating detection in chess * David J. Barnes , Julio Hernandez-Castro School of Computing, The University of Kent, Canterbury, Kent CT2 7NF, United Kingdom article info abstract Article history: The integrity of online games has important economic consequences for both the gaming Received 12 July 2014 industry and players of all levels, from professionals to amateurs. Where there is a high Received in revised form likelihood of cheating, there is a loss of trust and players will be reluctant to participate d 14 September 2014 particularly if this is likely to cost them money. Accepted 10 October 2014 Chess is a game that has been established online for around 25 years and is played over Available online 22 October 2014 the Internet commercially. In that environment, where players are not physically present “over the board” (OTB), chess is one of the most easily exploitable games by those who wish Keywords: to cheat, because of the widespread availability of very strong chess-playing programs. Chess Allegations of cheating even in OTB games have increased significantly in recent years, and Cheating even led to recent changes in the laws of the game that potentially impinge upon players’ Online games privacy. Privacy In this work, we examine some of the difficulties inherent in identifying the covert use Machine assistance of chess-playing programs purely from an analysis of the moves of a game. -
Emirate of UAE with More Than Thirty Years of Chess Organizational Experience
DUBAI Emirate of UAE with more than thirty years of chess organizational experience. Many regional, continental and worldwide tournaments have been organized since the year 1985: The World Junior Chess Championship in Sharjah, UAE won by Max Dlugy in 1985, then the 1986 Chess Olympiad in Dubai won by USSR, the Asian Team Chess Championship won by the Philippines. Dubai hosted also the Asian Cities Championships in 1990, 1992 and 1996, the FIDE Grand Prix (Rapid, knock out) in 2002, the Arab Individual Championship in 1984, 1992 and 2004, and the World Blitz & Rapid Chess Championship 2014. Dubai Chess & Culture Club is established in 1979, as a member of the UAE Chess Federation and was proclaimed on 3/7/1981 by the Higher Council for Sports & Youth. It was first located in its previous premises in Deira–Dubai as a temporarily location for the new building to be over. Since its launching, the Dubai Chess & Culture Club has played a leading role in the chess activity in UAE, achieving for the country many successes on the international, continental and Arab levels. The Club has also played an imminent role through its administrative members who contributed in promoting chess and leading the chess activity along with their chess colleagues throughout UAE. “Sheikh Rashid Bin Hamdan Al Maktoum Cup” The Dubai Open championship, the SHEIKH RASHID BIN HAMDAN BIN RASHID AL MAKTOUM CUP, the strongest tournament in Arabic countries for many years, has been organized annually as an Open Festival since 1999, it attracts every year over 200 participants. Among the winners are Shakhriyar Mamedyarov (in the edition when Magnus Carlsen made his third and final GM norm at the Dubai Open of 2004), Wang Hao, Wesley So, or Gawain Jones. -
Rules of Chess
Rules of chess From Wikipedia, the free encyclopedia The rules of chess (also known as the laws of chess) are rules governing the play of the game of chess. While the exact origins of chess are unclear, modern rules first took form during the Middle Ages. The rules continued to be slightly modified until the early 19th century, when they reached essentially their current form. The rules also varied somewhat from place to place. Today Fédération Internationale des Échecs (FIDE), also known as the World Chess Organization, sets the standard rules, with slight modifications made by some national organizations for their own purposes. There are variations of the rules for fast chess, correspondence chess, online chess, and chess variants. Chess is a game played by two people on a chessboard, with 32 pieces (16 for each player) of six types. Each type of piece moves in a distinct way. The goal of the game is to checkmate, i.e. to threaten the opponent's king with inevitable capture. Games do not necessarily end with checkmate – players often resign if they believe they will lose. In addition, there are several ways that a game can end in a draw. Besides the basic movement of the pieces, rules also govern the equipment used, the time control, the conduct and ethics of players, accommodations for handicapped players, the recording of moves using chess notation, as well as procedures for irregularities that occur during a game. Contents 1 Initial setup 1.1 Identifying squares 2 Play of the game 2.1 Movement 2.1.1 Basic moves 2.1.2 Castling 2.1.3 En passant 2.1.4 Pawn promotion Game in a public park in Kiev, using a 2.2 Check chess clock 3 End of the game 3.1 Checkmate 3.2 Resigning 3.3 Draws 3.4 Time control 4 Competition rules 4.1 Act of moving the pieces 4.2 Touch-move rule 4.3 Timing 4.4 Recording moves 4.5 Adjournment 5 Irregularities 5.1 Illegal move 5.2 Illegal position 6 Conduct Staunton style chess pieces. -
The Ranking of Football Teams Using Concepts from the Analytic Hierarchy Process
University of Louisville ThinkIR: The University of Louisville's Institutional Repository Electronic Theses and Dissertations 12-2009 The ranking of football teams using concepts from the analytic hierarchy process. Yepeng Sun 1976- University of Louisville Follow this and additional works at: https://ir.library.louisville.edu/etd Recommended Citation Sun, Yepeng 1976-, "The ranking of football teams using concepts from the analytic hierarchy process." (2009). Electronic Theses and Dissertations. Paper 1408. https://doi.org/10.18297/etd/1408 This Master's Thesis is brought to you for free and open access by ThinkIR: The University of Louisville's Institutional Repository. It has been accepted for inclusion in Electronic Theses and Dissertations by an authorized administrator of ThinkIR: The University of Louisville's Institutional Repository. This title appears here courtesy of the author, who has retained all other copyrights. For more information, please contact [email protected]. THE RANKING OF FOOTBALL TEAMS USING CONCEPTS FROM THE ANALYTIC HIERARCHY PROCESS BY Yepeng Sun Speed Engineering School, 2007 A Thesis Submitted to the Faculty of the Graduate School of the University of Louisville in Partial Fulfillment of the Requirements for the Degree of Master of Engineering Department of Industrial Engineering University of Louisville Louisville, Kentucky December 2009 THE RANKING OF FOOTBALL TEAMS USING CONCEPTS FROM THE ANALYTIC HIERARCHY PROCESS By Yepeng Sun Speed Engineering School, 2007 A Thesis Approved on November 3, 2009 By the following Thesis Committee x Thesis Director x x ii ACKNOWLEDGMENTS I would like to thank my advisor, Dr. Gerald Evans, for his guidance and patience. I attribute the level of my Masters degree to his encouragement and effort and without him this thesis, too, would not have been completed or written. -
Minimizing Game Score Violations in College Football Rankings
University of North Florida UNF Digital Commons Management Faculty Publications Department of Management 2005 Minimizing Game Score Violations in College Football Rankings B. Jay Coleman University of North Florida, [email protected] Follow this and additional works at: https://digitalcommons.unf.edu/bmgt_facpub Part of the Management Sciences and Quantitative Methods Commons Recommended Citation Coleman, B. Jay, "Minimizing Game Score Violations in College Football Rankings" (2005). Management Faculty Publications. 1. https://digitalcommons.unf.edu/bmgt_facpub/1 This Article is brought to you for free and open access by the Department of Management at UNF Digital Commons. It has been accepted for inclusion in Management Faculty Publications by an authorized administrator of UNF Digital Commons. For more information, please contact Digital Projects. © 2005 All Rights Reserved informs ® Vol. 35, No. 6, November-December 2005, pp. 483–496 doi 10.1287/inte.1050.0172 issn 0092-2102 eissn 1526-551X 05 3506 0483 ©2005 INFORMS Minimizing Game Score Violations in College Football Rankings B. Jay Coleman Department of Management, Marketing, and Logistics, Coggin College of Business, University of North Florida, 4567 St. Johns Bluff Road, South, Jacksonville, Florida 32224-2645, [email protected] One metric used to evaluate the myriad ranking systems in college football is retrodictive accuracy. Maximizing retrodictive accuracy is equivalent to minimizing game score violations: the number of times a past game’s winner is ranked behind its loser. None of the roughly 100 current ranking systems achieves this objective. Using a model for minimizing violations that exploits problem characteristics found in college football, I found that all previous ranking systems generated violations that were at least 38 percent higher than the minimum. -
An Investigation of the Relationship Between Junior Girl’S Golf Ratings and Ncaa Division I Women’S Golf Ratings
AN INVESTIGATION OF THE RELATIONSHIP BETWEEN JUNIOR GIRL’S GOLF RATINGS AND NCAA DIVISION I WOMEN’S GOLF RATINGS Patricia Lyn Earley A thesis submitted to the faculty of the University of North Carolina at Chapel Hill in partial fulfillment of the requirements for the degree of Master of Arts in the Department of Exercise and Sport Science (Sport Administration). Chapel Hill 2011 Approved By: Edgar W. Shields, Jr., Ph.D. Barbara Osborne, Esq. Deborah L. Stroman, Ph.D. ABSTRACT PATRICIA LYN EARLEY: An Investigation of the Relationship Between Junior Girl’s Golf Ratings and NCAA Division I Women’s Golf Ratings (Under the direction of Edgar W. Shields, Jr., Ph.D.) Coaches often depend on rating systems to determine who to recruit. But how reliable are these ratings? Do they help coaches find a player that will contribute to the team’s success? This research examined the degree of importance that should be placed on junior golf ratings and if these ratings will help college coaches predict the impact of each recruit. The research sought to discover the relationship between 207 subjects’ junior golf ratings (Golfweek/Sagarin Junior Girls Golf Ratings) and their freshman, sophomore, junior and senior year golf ratings (NCAA Division I Women’s College Golf Ratings), rate of improvement and number of starter years using simple regression. A significant relationship was found between junior golf ratings and the freshman, sophomore, junior and senior year NCAA Division I women’s college golf ratings. A significant relationship was found between junior golf ratings and starter years but not with the rate of improvement. -
Including ACG8, ACG9, Games in AI Research, ACG10 T/M P. 18) Version: 20 June 2007
REFERENCE DATABASE 1 Updated till Vol. 29. No. 2 (including ACG8, ACG9, Games in AI Research, ACG10 t/m p. 18) Version: 20 June 2007 AAAI (1988). Proceedings of the AAAI Spring Symposium: Computer Game Playing. AAAI Press. Abramson, B. (1990). Expected-outcome: a general model of static evaluation. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 12, No.2, pp. 182-193. ACF (1990), American Checkers Federation. http://www.acfcheckers.com/. Adelson-Velskiy, G.M., Arlazarov, V.L., Bitman, A.R., Zhivotovsky, A.A., and Uskov, A.V. (1970). Programming a Computer to Play Chess. Russian Mathematical Surveys, Vol. 25, pp. 221-262. Adelson-Velskiy, M., Arlazarov, V.L., and Donskoy, M.V. (1975). Some Methods of Controlling the Tree Search in Chess Programs. Artificial Ingelligence, Vol. 6, No. 4, pp. 361-371. ISSN 0004-3702. Adelson-Velskiy, G.M., Arlazarov, V. and Donskoy, M. (1977). On the Structure of an Important Class of Exhaustive Problems and Methods of Search Reduction for them. Advances in Computer Chess 1 (ed. M.R.B. Clarke), pp. 1-6. Edinburgh University Press, Edinburgh. ISBN 0-85224-292-1. Adelson-Velskiy, G.M., Arlazarov, V.L. and Donskoy, M.V. (1988). Algorithms for Games. Springer-Verlag, New York, NY. ISBN 3-540-96629-3. Adleman, L. (1994). Molecular Computation of Solutions to Combinatorial Problems. Science, Vol. 266. p. 1021. American Association for the Advancement of Science, Washington. ISSN 0036-8075. Ahlswede, R. and Wegener, I. (1979). Suchprobleme. Teubner-Verlag, Stuttgart. Aichholzer, O., Aurenhammer, F., and Werner, T. (2002). Algorithmic Fun: Abalone. Technical report, Institut for Theoretical Computer Science, Graz University of Technology. -
The Cheater Hunter Mark Rivlin Interviews Andy Howie Andy Howie Is FIDE International Arbiter and Organizer, Executive Director
The Cheater Hunter Mark Rivlin interviews Andy Howie Andy Howie is FIDE international arbiter and organizer, executive director of Chess Scotland and a Secretary/Delegate of the European Chess Union. He is at the heart of the battle against online and OTB cheating. In August 2020 he said on the English Chess Forum: “I can’t speak for other federations, but Scotland takes online cheating in organized tournaments very, very seriously. Anyone caught and proven to be cheating faces up to a 5 year ban depending on age.” You are a well-known and respected International Arbiter with a very impressive portfolio of tournaments, leagues and congresses. Tell us about your chess background and how you became an arbiter. Not sure about respected, infamous would probably be the adjective used by players up here in Scotland as I have a habit of arbiting in sandals and shorts even in the middle of winter! I started playing when I was seven, my dad taught me how to play. I won a few tournaments in Germany (I was brought up there as my father was in the armed services and we were based out there). I played with friends and work colleagues through the years and was a lot better than them so tried my luck in a local tournament and fell in love with it completely. I became an arbiter because a friend of mine was wronged in a tournament and I didn't know the rules well enough to argue. I swore I would never be in that position again, took the arbiters course and the rest, as they say, is history. -
An Historical Perspective Through the Game of Chess
On the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess Fr´ed´eric Prost LIG, Universit´ede Grenoble B. P. 53, F-38041 Grenoble, France [email protected] Abstract The game of chess as always been viewed as an iconic representation of intellectual prowess. Since the very beginning of computer science, the challenge of being able to program a computer capable of playing chess and beating humans has been alive and used both as a mark to measure hardware/software progresses and as an ongoing programming challenge leading to numerous discoveries. In the early days of computer science it was a topic for specialists. But as computers were democratized, and the strength of chess engines began to increase, chess players started to appropriate to themselves these new tools. We show how these interac- tions between the world of chess and information technologies have been herald of broader social impacts of information technologies. The game of chess, and more broadly the world of chess (chess players, literature, computer softwares and websites dedicated to chess, etc.), turns out to be a surprisingly and particularly sharp indicator of the changes induced in our everyday life by the information technologies. Moreover, in the same way that chess is a modelization of war that captures the raw features of strategic thinking, chess world can be seen as small society making the study of the information technologies impact easier to analyze and to arXiv:1203.3434v1 [cs.OH] 15 Mar 2012 grasp. Chess and computer science Alan Turing was born when the Turk automaton was finishing its more than a century long career of illusion1.