29:null 2a:["$","title",null,{"children":"Event assignment with real data | Olli-Pekka Tikkanen | Observable"}] 2f:Ta5c,function runPADGMultipleTimes(LL,evnts,grps,updateFun) { let arrangement = PADGopt(LL,evnts,grps,grps,updateFun) //console.log('initial arrangement') //console.log(checkArrangement(arrangement, groups, events)) let happiness = totalHappiness(arrangement,groups)/groups.length let grp = grps.slice() let numOptRounds = 0 for(let round = 1; round < numOptRounds; round++) { //find groups that were not set to any event let groupsNotAssigned = arrangement.filter(ele => ele.assignment === -1) let newGroups = [] for(let g in groupsNotAssigned){ newGroups.push(groups.filter(ele => ele.name === groupsNotAssigned[g].name)[0]) } //update new events so that the groups already assigned to them are included let newEvents = evnts.map(ele => { return { name: ele.name, min: ele.min, max: ele.max, } }) newEvents.playerCount = (eventName) => { // function to count how many players are already assigned to an event let e = newEvents.findIndex(ele => { return ele.name === eventName }) if(typeof(newEvents[e].groups) !== 'undefined' && newEvents[e].groups.length > 0) { return newEvents[e].groups.reduce((a, b) => { return a+grp.filter(g=>g.name === b)[0].size }, 0); } else { return 0 } } for(let e in newEvents) { let playersInThisEvent = arrangement.filter(ele=>ele.assignment === Number(e)) .map(ele => ele.name) if(playersInThisEvent.length>0) { newEvents[e].groups = playersInThisEvent } } //construct new L which includes only gain from assigning groups in newGroups let newL = [] for(let i=0;i1) { gain = gain*(1/groups[i].pref.length) } } newL.push({ name: newGroups[i].name, event: j, size: newGroups[i].size, gain: gain }) } } newL = newL.sort((a,b) => { if(a.gain >= b.gain) { return 1; } else { return -1 } }) let newArrangement = PADGopt(newL,newEvents,newGroups,grps,updateFun) newArrangement.map(ele => { if(ele.assignment !== -1) { let arrInd = arrangement.findIndex(arrEle => arrEle.name === ele.name) arrangement[arrInd].assignment = ele.assignment } }) } return arrangement }30:T1c89,PADGopt = (Lis,evnt,grp,grpAll,updateFun) => { let LL = JSON.parse(JSON.stringify(Lis)) let evn = JSON.parse(JSON.stringify(evnt)) let M = grp.map(e => { return {name: e.name,assignment: -1} }) let S = evn.map(ele => { return { name: ele.name, min: ele.min, max: ele.max, groups: ele.hasOwnProperty('groups') ? ele.groups : [] } }) // function definitions for S if(typeof(S.playerCount) === 'undefined') { S.playerCount = (e) => { // function to count how many players are already assigned to an event if(S[e].groups.length > 0) { return S[e].groups.reduce((a, b) => { return a+grpAll.filter(g=>g.name === b)[0].size }, 0); } else { return 0 } } } let P = [] // Phantom events // function definitions for P P.createEntry = (newEntry) => { //function to create a new entry to S P.push({name: newEntry.name, min: newEntry.min, max: newEntry.max, }) } P.removeEntry = (eventName) => { let ind = P.findIndex(ele => ele.name === eventName) P.splice(ind,1) } P.includes = (eventName) => { //check if event named eventName is in P if(P.filter(ele => ele.name === eventName).length === 1) { return 1 } else { return 0 } } //define deficit let deficit = 0 //initialize V to be the same as groups let V = grp.slice() //MAIN LOOP STARTS HERE LL = LL.filter(ele => ele.gain > 0) while(LL.length>0) { let u = LL.pop() // u is the last index of LL // check if there are enough people signed up for this game // in order to avoid matching some group with this event // without hope of this event ever happening let numPlayersToThisEvent = 0 grp.filter(ele => { return typeof(ele.pref.find(p => p===u.event)) !== 'undefined'}) .forEach(ele => { numPlayersToThisEvent = numPlayersToThisEvent + ele.size }) if(u.gain === 0 || numPlayersToThisEvent < evnt[u.event].min) { // consider only cases where adding u to event increases happiness // and those where there is even theoretically possible to have // minimum number of players continue } let Mind = M.findIndex(g => g.name === u.name) if(M[Mind].assignment === -1 && (S.playerCount(u.event) + u.size) <= S[u.event].max) { // user u is not assigned and there is space in the event where we try to place u //console.log('before') //console.log(S.playerCount(u.event)) let playersBefore = S.playerCount(u.event) if(S.playerCount(u.event) === 0) { //no players in S or S is not yet a real event if( deficit + (evnt[u.event].min - u.size) < V.length) { // adding u to this event does not decrease deficit over critical size // since event is not in S add it to P // add to deficit how much space was left over in this event deficit = deficit + (evnt[u.event].min - u.size) if(P.includes(S[u.event].name) === 0) { let newPEntry = { name: evnt[u.event].name, min: evnt[u.event].min, max: evnt[u.event].max, } P.createEntry(newPEntry) } } else { continue } } else { // S has players and is happening anyway if(P.includes(evnt[u.event].name) === 1) { deficit = deficit - u.size } } S[u.event].groups.push(u.name) V = V.filter(ele => ele.name !== u.name) if(S.playerCount(u.event) >= S[u.event].min && P.includes(S[u.event].name) === 0) { // this event is not a phantom event, set M(u) to a M[Mind].assignment = u.event // remove u from other events S.forEach(ele => { if(ele.name !== S[u.event].name) { let nPlayersBefore = S.playerCount(S.findIndex(s=>s.name === ele.name)) ele.groups = ele.groups.filter(e => e !== u.name) // check that there are enough players in this event let nPlayersAfter = S.playerCount(S.findIndex(s=>s.name === ele.name)) //if nPlayers < ele.min add this event as a phantom event if(nPlayersAfter < nPlayersBefore && nPlayersAfter < ele.min) { if(P.includes(ele.name) === 0) { P.createEntry({ name: ele.name, min: ele.min, max: ele.max }) } // remove assignment ele.groups.forEach(e => { let MindTemp = M.findIndex(m => m.name === e) if(M[MindTemp].assignment === S.findIndex(s=>s.name === ele.name)) { M[MindTemp].assignment = -1; } }) } } }) } if(S.playerCount(u.event) >= S[u.event].min && P.includes(S[u.event].name) === 1) { // this event is a phantom event but has now enough players to be a real event //console.log(u.event) P.removeEntry(S[u.event].name) // remove this event from phantom events S[u.event].groups.forEach(el => { let MindTemp = M.findIndex(m => m.name === el) M[MindTemp].assignment = u.event }) for(let g in S[u.event].groups) { S.forEach(ele => { if(ele.name !== S[u.event].name) { let nPlayersBefore = S.playerCount(S.findIndex(s=>s.name === ele.name)) ele.groups = ele.groups.filter(e => e !== S[u.event].groups[g]) // check that there are enough players in this event let nPlayersAfter = S.playerCount(S.findIndex(s=>s.name === ele.name)) //if nPlayers < ele.min add this event as a phantom event if(nPlayersAfter < nPlayersBefore && nPlayersAfter < ele.min) { if(P.includes(ele.name) === 0) { P.createEntry({ name: ele.name, min: ele.min, max: ele.max }) } // remove assignment if there is assignment to this event that is now phantom event ele.groups.forEach(e => { let MindTemp = M.findIndex(m => m.name === e) if(M[MindTemp].assignment === S.findIndex(s=>s.name === ele.name)) { M[MindTemp].assignment = -1; } }) } } }) } } //Update list LL if there was no assignment if(M[Mind].assignment === -1) { let gInd = grp.findIndex(g => g.name === u.name) LL = updateFun(LL,grp,gInd) } } } return M }31:T478,checkArrangement = (arr,grp,evnts) => { //checks if the arrangement is a valid one (ie. no event has less than minimum and no more than maximum number of //attendees // OUTPUT // 1 = arr is valid // 0 = arr is not valid let arrToUse = JSON.parse(JSON.stringify(arr)); let valid = 1; evnts.forEach(e => { let eInd = evnts.findIndex(ee => ee.name === e.name) // Should have just used a for loop... let numPlayers = 0 let groupsAttending = arrToUse.filter(a => a.assignment === eInd) if(groupsAttending.length >0) { groupsAttending = groupsAttending.map(gr => { let groupdata = grp.find(g => { return g.name === gr.name }) return {... gr, size: groupdata.size} }) numPlayers = groupsAttending.reduce((total,gr) => { return total + gr.size },0) if(numPlayers < e.min){ //console.log(numPlayers) console.log('min') console.log(e) valid = 0 } if(numPlayers > e.max) { console.log('max') console.log(e) valid = 0 } } }) return valid } 32:T755,groups = { let u = JSON.parse(JSON.stringify(users)) let gr = u.filter(ele => { let isAttending = false for (let signedGame in ele.signedGames) { //include the time for 2017 data if(!ele.signedGames[signedGame].hasOwnProperty('time')) { ele.signedGames[signedGame].time = games .filter(game => game.id === ele.signedGames[signedGame].id)[0].startTime } if (ele.signedGames[signedGame].time === selectedGameTime) { isAttending = true } } return isAttending }).map(ele => { // map only the event that we are searching for let signedGame = ele.signedGames.filter(elesigned => { return elesigned.time === selectedGameTime }) let prefArr = [] signedGame.forEach(elesigned => { prefArr.push(events.findIndex(ele => { return ele.id === elesigned.id })) }) return { name: ele.username, playerGroup: ele.hasOwnProperty('playerGroup') ? ele.playerGroup : "0", pref: prefArr, } }) //calculate size of the group let sizes = {}; gr.forEach(ele => { sizes[ele.playerGroup] = (sizes[ele.playerGroup] || 0) +1 }) // add size to every group gr = gr.map(ele => { return { ... ele, size: ele.playerGroup === "0" ? 1 : sizes[ele.playerGroup] } }) // take only unique playergroups const result = []; const map = new Map(); for (const group of gr) { if(!map.has(group.playerGroup) || group.playerGroup === "0"){ map.set(group.playerGroup, true); // set any value to Map result.push({ name: group.name, playerGroup: group.playerGroup, pref: group.pref, size: group.size }); } } return result }33:[] 2d:{"id":"48eb1ef569406ca2","slug":"event-assignment-with-real-data","title":"Event assignment with real data","thumbnail":"1823ad6830eeca79b770ad04a4e4e91d0fa747b7a99f972b5a99ac36715153e3","access_level":"public","create_time":"$D2019-03-07T19:49:24.684Z","update_time":"$D2021-06-18T06:20:09.775Z","view_time":null,"first_public_time":"$D2019-03-07T20:10:01.039Z","has_unpublished_edits":null,"fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"0e969331bf0cf663","login":"altesmi","name":"Olli-Pekka Tikkanen","avatar_url":"https://avatars-next.observableusercontent.com/491bf5e3cb987f7295ae9d7e9f0ee79b8bc8183b6ef6f8a2188ab82ed5111e4d","tier":"starter_2024"},"version":664,"publish_version":664,"role":null,"authored":false,"authors":[{"type":"individual","id":"749fee2f48c09e42","login":"altesmi","name":"Olli-Pekka Tikkanen","avatar_url":"https://avatars-next.observableusercontent.com/491bf5e3cb987f7295ae9d7e9f0ee79b8bc8183b6ef6f8a2188ab82ed5111e4d","tier":null}],"members":[{"type":"individual","id":"749fee2f48c09e42","login":"altesmi","name":"Olli-Pekka Tikkanen","avatar_url":"https://avatars-next.observableusercontent.com/491bf5e3cb987f7295ae9d7e9f0ee79b8bc8183b6ef6f8a2188ab82ed5111e4d","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"title":"Event assignment with real data","cells":[{"id":0,"value":"md`# Event assignment with real data`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":185,"value":"md `## Select data`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":189,"value":"md `** Year **` ","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":187,"value":"viewof selectedYear = select([2017,2018])","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":197,"value":"md `** Start time of games **`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":191,"value":"viewof selectedGame = select(gameTimes)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":333,"value":"md `**alpha (1 = weight only game preferences 0 = weight only that groups get into some event **`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":335,"value":"viewof alpha = slider({\n min: 0.1,\n max: 1,\n step: 0.01,\n title: \"Alpha\"\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":155,"value":"md `## Optimization results`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":226,"value":"md `*Total happiness equals 100% if every group is placed to their first choice*`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":220,"value":"md `### PADG`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":217,"value":"md `** Total happiness **`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":160,"value":"`${Math.round(totalHappiness(arrPADG,groups)/groups.length * 10000)/100}%`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":230,"value":"md `** How many groups are not assigned **`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":174,"value":"md `${arrPADG.filter(ele => ele.assignment===-1).length} (${Math.round(arrPADG.filter(ele => ele.assignment===-1).length/groups.length*10000)/100}%)`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":222,"value":"md `### Random arrangement`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":224,"value":"md `** Total happiness **`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":168,"value":"`${Math.round(totalHappiness(arrRandom,groups)/groups.length * 10000)/100}%`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":234,"value":"md `** How many groups are not assigned **`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":171,"value":"md `${arrRandom.filter(ele => ele.assignment===-1).length} (${Math.round(arrRandom.filter(ele => ele.assignment===-1).length/groups.length*10000)/100}%)`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":286,"value":"md ` ### Algorithm comparison`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":283,"value":"`PADG is ${Math.abs(Math.round((totalHappiness(arrPADG,groups)/totalHappiness(arrRandom,groups)-1)*10000)/100)} % ${totalHappiness(arrPADG,groups)/totalHappiness(arrRandom,groups) < 1 ? 'worse' : 'better'}`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":158,"value":"totalHappiness = (M,grp) => {\n let happiness = 0\n M.forEach(m => {\n let grpInd = grp.findIndex(g=>g.name === m.name)\n let ind = grp[grpInd].pref.findIndex(ele => {\n return ele === m.assignment\n })\n ind = ind +1\n if(ind > 0) {\n happiness = happiness + 1/ind\n }\n })\n return happiness\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":149,"value":"md `## Run optimization` ","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":151,"value":"arrPADG = runPADGMultipleTimes(L,events,groups,updateL)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":211,"value":"checkArrangement(arrPADG, groups, events) ? 'PADGopt arrangement is accepted' : 'PADGopt arrangement is not accepted'","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":165,"value":"arrRandom = { \n let randomArrangement = randomOpt(events,groups)\n let randomhappiness = totalHappiness(randomArrangement,groups)/groups.length\n let newRandomArrangement = []\n let newRandomhappiness = 0\n //try the random arrangement 100 times to see if there are better matches\n for(let i=0;i<300;i++) {\n newRandomArrangement = randomOpt(events,groups)\n newRandomhappiness = totalHappiness(newRandomArrangement,groups)/groups.length\n if(newRandomhappiness > randomhappiness) {\n randomhappiness = newRandomhappiness\n randomArrangement = newRandomArrangement\n }\n }\n return randomArrangement\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":214,"value":"checkArrangement(arrRandom, groups,events) ? 'RandomArrangement arrangement is accepted' : 'RandomArrangement arrangement is not accepted'","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":179,"value":"$2f","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":328,"value":"updateL = (LL,grp,gInd) => {\n /*Updates the list LL so that gain increases as possibilities for \n assignment decrease */\n \n LL.forEach(ele => {\n \n if(ele.name===grp[gInd].name ) {\n //calculate the number of preferences\n let numPref = grp[gInd].pref.length\n let numPossibilities = LL.filter(g=>g.gain > 0).filter(g => g.name ===ele.name).length\n if(numPossibilities < numPref && numPossibilities > 1) {\n ele.gain = ele.gain + (1.0-alpha)/(numPossibilities-1)*(numPref-numPossibilities)/(3-1)\n }\n }\n })\n \n return LL.sort((a,b) => {\n if(a.gain >= b.gain) {\n return 1;\n } else {\n return -1\n }\n })\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":375,"value":"$30","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":417,"value":"$31","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":46,"value":"md `## Parse the raw data to right format for the algorithms`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":59,"value":"md `### Select one gametime and get all the events and groups attending`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":147,"value":"L = {\n let L = []\n for(let i=0;i1) {\n gain = gain*(1/groups[i].pref.length)\n }\n }\n L.push({\n name: groups[i].name,\n event: j,\n size: groups[i].size,\n gain: gain \n })\n }\n }\n return L.filter(ele=>ele.gain>0).sort((a,b) => {\n if(a.gain >= b.gain) {\n return 1;\n } else {\n return -1\n }\n \n})\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":61,"value":"$32","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":131,"value":"events = {\n return games.filter(ele => ele.startTime === selectedGameTime)\n .map(ele => {\n return {\n name: ele.title,\n id: ele.id,\n min: Number(ele.minAttendance),\n max: Number(ele.maxAttendance) \n }\n \n })\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":239,"value":"selectedGameTime = {\n return gameTimes.find(time => {\n return time === selectedGame\n })\n \n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":48,"value":"gameTimes = games.map(ele => ele.startTime).filter((v,i,a) => a.indexOf(v) === i)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":21,"value":"md `## Load the data`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":32,"value":"games = {\n let correctUrl = `https://raw.githubusercontent.com/Archinowsk/konsti-server/master/src/statistics/datafiles/${Number(selectedYear)}/games.json`\n return d3.json(correctUrl)\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":34,"value":"users = d3.json(`https://raw.githubusercontent.com/Archinowsk/konsti-server/master/src/statistics/datafiles/${Number(selectedYear)}/users.json`)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":4,"value":"md `## Imports`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":182,"value":"import { select, slider } from \"@jashkenas/inputs\"","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":7,"value":"import { randomArrangement, randomOpt} from '@altesmi/event-assignment'","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":29,"value":"d3 = require('d3')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W33","stdlib":"1","titling":"auto"}} 2e:"$2d:body"