Research Article
Incremental Bilateral Preference Stable Planning over Event Based Social Networks
Algorithm 2
Update_event_plan.
| Input: , , , , , | |
| Output: | |
| 1 | |
| 2While() | |
| 3Pop from | |
| 4 user with the worst utility in | |
| 5Foreach ( after in the number of participants does not exceed ) | |
| 6 | |
| 7If( that conflicts with ) | |
| 8continue | |
| 9EndIf | |
| 10Foreach() | |
| 11Remove from , put into , put into | |
| 12EndFor | |
| 13Put into | |
| 14While() | |
| 15Remove the worst event from | |
| 16If( is removed) | |
| 17break | |
| 18EndIf | |
| 19Put into , put into | |
| 20EndWhile | |
| 21If( has been removed from ) | |
| 22Foreach() | |
| 23Put back to , remove from | |
| 24EndFor | |
| 25EndIf | |
| 26EndFor | |
| 27Endwhile | |
| 28Return |