Mathematics in Political Science: An Introduction

Course Information
TitleΜαθηματικά στην Πολιτική Επιστήμη: Εισαγωγή / Mathematics in Political Science: An Introduction
FacultyEconomic and Political Sciences
SchoolPolitical Sciences
Cycle / Level1st / Undergraduate
Teaching PeriodWinter
CoordinatorIoannis Andreadis
Course ID100001047

Programme of Study: UPS School of Political Sciences (2014-today)

Registered students: 400
OrientationAttendance TypeSemesterYearECTS
CoreCompulsory Course115

Class Information
Academic Year2019 – 2020
Class PeriodWinter
Faculty Instructors
Weekly Hours3
Total Hours39
Class ID
Type of the Course
  • Background
  • General Knowledge
Course Category
General Foundation
Mode of Delivery
  • Face to face
Digital Course Content
Language of Instruction
  • Greek (Instruction, Examination)
Learning Outcomes
Objectives of the course is that students gain the following capabilities: Ability to understand and apply an algorithm. Ability to calculate the probability so that they can take political decisions based on real facts Ability to reach useful conclusions using the results of the elections. (method of bounds) Ability to abstract complex relationships and find the solution with the help of graph theory. Ability to study social networks and analyze network effects on the formation of political views.
General Competences
  • Apply knowledge in practice
  • Retrieve, analyse and synthesise data and information, with the use of necessary technologies
  • Make decisions
  • Work autonomously
  • Work in teams
  • Work in an interdisciplinary team
  • Be critical and self-critical
  • Advance free, creative and causative thinking
Course Content (Syllabus)
The course explores introductory concepts, algorithms and examples from probability theory, combinatorial theory (combinatorics), graph theory and set theory including relations and functions in sets. With regard to combinatorial theory, the course examines the techniques of enumeration (enumerative combinatorics), the concepts of combinations, and permutations with or without repetitions. With regard to probability theory, the course examines the concepts of probability and conditional probability. For graph theory, the course explores concepts, definitions, properties and algorithms with emphasis on planar and connected graphs. The course also offers descriptions of the relations determined by finite sets and interpretations of the functions and graphic representations defined by them.
Elecoral law, Algorithms, Combinatorics, Discrete Probability, Graphs
Educational Material Types
  • Slide presentations
  • Interactive excersises
  • Book
Use of Information and Communication Technologies
Use of ICT
  • Use of ICT in Course Teaching
  • Use of ICT in Communication with Students
  • Use of ICT in Student Assessment
Use of laptop and projector: For example, using spreadsheets to implement electoral systems.
Course Organization
Laboratory Work301.1
Reading Assigment401.5
Student Assessment
Students need to have a 12-digit calculator (using your mobile phone as calculator is not permitted) and their book with them which they can consult during the exams to solve problems similar to those in the book. All exam items have equal weight (e.g. if there are 4 items, each item correspond to 2.5 points). If there are assignments or exercises during the semester, participation in them is optional and the final grade of those who do not participate depends only on the grade of their final exams (i.e. if they have answered all the questions correctly, final their grade will be equal to 10). Any participation in assignments or exercises in the final grade of those who participate in them is communicated to the participants and depends on the level of difficulty and the quality of the tasks and exercises involved.
Student Assessment methods
  • Written Exam with Problem Solving (Formative, Summative)
Course Bibliography (Eudoxus)
Χατζηπαντελής, Θ, & Ι. Ανδρεάδης, Μαθηµατικά στις Πολιτικές Επιστήµες, Εκδόσεις Ζήτη, 2005. Aγγελής, E. και Γ. Mπλέρης, ∆ιακριτά µαθηµατικά, Tζιόλα,2003.
Additional bibliography for study
Aldous, J. M. και R. J. Wilson, Graphs and Applications: An Introductory Approach, Springer Verlag, 2000. Biggs, N. L., Discrete Mathematics (αναθεωρηµένη έκδοση),Oxford Science Publications, 1990. Grinstead, C. M. και J. L. Snell, Introduction to Probability (δεύτερη αναθεωρηµένη έκδοση), American Mathematical Society, 1997. Paulos, J.Α., A Mathematician Reads the Newspaper, Turtleback Books-Demco Media, 1996.
Last Update