Research Article
Incremental Bilateral Preference Stable Planning over Event Based Social Networks
Algorithm 4
Update_user_plan.
| Input: , , , , , | |
| Output: | |
| 1 | |
| 2While() | |
| 3Pop from | |
| 4 event with the worst utility in | |
| 5Foreach ( after in ) | |
| 6If( conflicts with ) | |
| 7break | |
| 8EndIf | |
| 9Add , into , | |
| 10If(the number of participants exceeds ) | |
| 11If( is the worst user in ) | |
| 12Remove , from , | |
| 13break; | |
| 14ElseIf | |
| 15Remove the worst user from | |
| 16Put into | |
| 17EndIf | |
| 18EndIf | |
| 19EndFor | |
| 20Endwhile | |
| 21Return |