Home | english  | Impressum | Sitemap | KIT

It can’t be that hard!

It can’t be that hard!
Forschungsthema:Combinatorial problem
Typ:Bachelorarbeit, Masterarbeit
Datum:vergeben
Betreuer:

Ewa Lux 

Perfect stranger matching (PSM) describes a matching rule for repeated participant-to-group allocations, where each participant may encounter any other participant only once. Matching 12 participants four times in groups of three in this manner can’t be that hard… or maybe it can?

And if you found a solution what is with 35 participants in groups of 5?

If you are interested in discussing this problem and finding a (heuristic) solution, you might be the ideal candidate for this thesis.

What we expect from you

  • Good English skills, as most of the relevant literature will be in English
  • Good knowledge in Java or other programming languages, since you might need to implement an algorithm that calculates or estimates the solution
  • Interest for math, especially combinatorial problems

What you can expect from us

  • Excellent guidance during your master thesis from researchers at KIT and the University of Montana
  • You will work on a defined research project with economists and mathematicians
  • You will work in a team of PhDs and Professors from Germany and Australia

Further reading

If you are interested, please send a motivation letter, your transcript of records and a CV to ewa.lux@kit.edu.