How Expressive Are Friendly School Partitions?

by   Josef Minařík, et al.

A natural procedure for assigning students to classes in the beginning of the school-year is to let each student write down a list of d other students with whom she/he wants to be in the same class (typically d=3). The teachers then gather all the lists and try to assign the students to classes in a way that each student is assigned to the same class with at least one student from her/his list. We refer to such partitions as friendly. In realistic scenarios, the teachers may also consider other constraints when picking the friendly partition: e.g. there may be a group of students whom the teachers wish to avoid assigning to the same class; alternatively, there may be two close friends whom the teachers want to put together; etc. Inspired by such challenges, we explore questions concerning the expressiveness of friendly partitions. For example: Does there always exist a friendly partition? More generally, how many friendly partitions are there? Can every student u be separated from any other student v? Does there exist a student u that can be separated from any other student v? We show that when d≥ 3 there always exist at least 2 friendly partitions and when d≥ 15 there always exists a student u which can be separated from any other student v. The question regarding separability of each pair of students is left open, but we give a positive answer under the additional assumption that each student appears in at most roughly exp(d) lists. We further suggest several open questions and present some preliminary findings towards resolving them.


page 1

page 2

page 3

page 4


Let's Ask Students About Their Programs, Automatically

Students sometimes produce code that works but that its author does not ...

Towards a Live Anonymous Question Queue To Address Student Apprehension

In today's university climate many first and second year classes have ov...

Toward Predicting Success and Failure in CS2: A Mixed-Method Analysis

Factors driving success and failure in CS1 are the subject of much study...

Optimal class assignment problem: a case study at Gunma University

In this study, we consider the real-world problem of assigning students ...

An open-access clicker question bank for numerical analysis

We present a question bank consisting of over 250 multiple-choice and tr...

Sophisticated Students in Boston Mechanism and Gale-Shapley Algorithm for School Choice Problem

We present our experimental results of simulating the school choice prob...

Wide Deep Learning for Judging Student Performance in Online One-on-one Math Classes

In this paper, we investigate the opportunities of automating the judgme...

Please sign up or login with your details

Forgot password? Click here to reset