While tools such as wikis can promote new and valuable collaboration structures,
they can also accidentally stimulate behaviors that work against fair participation
and educational excellence. In this presentation we will look at practices and tools
that avoid these pitfalls, and help instructors get the best results out of social
software by discussing the application of these tools in specific teaching scenarios.
Source code for the tools presented will be available to all participants.
Click here to open the presentation in a new window.
- Fisher, R. and W. Ury (1981). Getting to Yes: Negotiating Agreement Without Giving In. New York, New York: Penguin Books.
- Leech, Dennis (2002).Computation of Power Indices, Warwick Economic Research Papers, Number 644, University of Warwick. Available online at: http://www.warwick.ac.uk/~ecrac/twerp644.pdf
- Puentedura, R.R. (2003). A Matrix Model for Designing and Assessing Network-Enhanced Courses. Available online at: http://www.hippasus.com/resources/matrixmodel/puentedura_model.pdf
- Resnick, P. (2004). Paul Resnick’s Sabbatical Musings. Available online at: http://presnick.livejournal.com/
- Saari, D.G. and V.R. Merlin (1996).The Copeland Method I: Relationships and the Dictionary, Econ. Theory. Available online at: http://citeseer.ist.psu.edu/344687.html
- Taylor, A.D. (1995). Mathematics and Politics: Strategy, Voting, Power and Proof. New York, New York: Springer.
- Terra Nova (2004). A collaborative weblog, focusing on the social science of virtual worlds. Available online at: http://terranova.blogs.com/
- Ury, W. (1991). Getting Past No: Negotiating Your Way from Confrontation to Cooperation. New York, New York: Bantam Books.
Two software packages mentioned in this presentation are available for download on this page. These software packages are licensed under a Creative Commons 2.0 Attribution License, and are copyrighted © 2004 by Ruben R. Puentedura.
- banzhaf.py - A simple self-contained function to compute the Banzhaf Power Index.
- copeland.py - A simple self-contained function to compute the Copeland ranking for all candidates in an election, and the Copeland winner for an election, or winners, should a tie exist. Note that if a Condorcet winner exists, it is the same as the Copeland winner.