Title: I&#x27;m interested in writing a utility to assist with scheduling un-conferences. Lets take the following situation for an example:<p>* 4 conference rooms across 4 time slots, for a total of 16 talks.<p>* 30 proposed talks<p>* 60 total participants<p>Each user would be given 4(?)votes, un-ranked. (collection of the votes is a separate topic) Voting is not secret, and we don&#x27;t need mathematically precise results. The goal is just to minimize conflicts.<p>The algorithm would have the following data to work with:<p>* List of talks with the following properties:<p><pre><code>     * presenter participant ID

     * the participant ID for each user that voted for the talk
</code></pre>
I&#x27;d like to come up with an algorithm that does the following:<p>* fills all time slots with the highest voted topics<p>* attempts to avoid overlapping votes for any particular given user in a given time slot<p>* attempt to not schedule a presenter&#x27;s talk during a talk they are interested in.<p>* Sugar on top: implement ranked preferences<p>My question: where do I start to research the algorithms that will be helpful? I know this is a huge project, but I have a year to work on it. I&#x27;m also not overly concerned with performance, but would like to keep it from being exponential.<p>Thank you for any references you can provide!
Upvote: