Entry Resler:1996:PDT from sigcse1990.bib

Last update: Wed Sep 26 02:07:32 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Resler:1996:PDT,
  author =       "Dan Resler",
  title =        "The {Prisoner's Dilemma Tournament} revisited",
  journal =      j-SIGCSE,
  volume =       "28",
  number =       "2",
  pages =        "31--36",
  month =        jun,
  year =         "1996",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/228296.228301",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:35 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "One much-studied method for investigating trust
                 building and cooperation is the iterative Prisoner's
                 Dilemma Tournament (iPDT). An iPDT is easily simulated
                 on a computer and is an excellent project in the
                 CS1/CS2 curriculum to introduce students to the
                 concepts of modular programming and information hiding.
                 It is highly motivating, it encourages creative
                 solutions, it allows students with varying abilities to
                 do equally well, and there is no one 'ideal' solution.
                 A software system that allows for the automatic
                 generating of tournaments is presented in this paper,
                 as well as information on downloading the software from
                 the author.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries