Research Article
Incremental Bilateral Preference Stable Planning over Event Based Social Networks
Algorithm 6
Multiple changes in one run.
| Input: , , , , , , | |
| Output: | |
| 1 | |
| 2 | |
| 3While() | |
| 4 event with the worst utility score in | |
| 5Put into , remove , from , | |
| 6Endwhile | |
| 7Foreach() | |
| 8Remove from , put into | |
| 9EndFor | |
| 10Empty , put into | |
| 11If() | |
| 12Update start users(, , , , , ) | |
| 13EndIf | |
| 14If() | |
| 15Update start events(, , , , , ) | |
| 16EndIf | |
| 17Return |