3GPP Voting Rights Algorithm: Contiguous-3 Solution Evaluation
This evaluation delves into the advantages and disadvantages of the 3 Contiguous-3 solution within the 3GPP voting rights algorithm. It explores scenarios to test the algorithm's effectiveness in granting and revoking voting rights based on meeting attendance types. The evaluation includes diverse hypothetical meeting scenarios and provides an example assessment to showcase how the algorithm operates in practice.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
E N D
Presentation Transcript
3GPP Voting Rights Algorithm Candidate Solution Supply a not too long name here Solution Name: 3 Contiguous-3
Description of the Algorithm Describe the algorithm 1. Existing rules retained, but only F2F meetings are counted. Rules on F2F override below add-ons (e.g. for missing 3 consecutive F2F meetings even if there are e-meetings between) 2. Add-on: Rights also gained on 3 consecutive attendances (any type of meeting) 3. Add-on: Rights lost on 3 consecutive meeting misses (any type of meeting)
Advantages/Disadvantages List advantages/disadvantages of the algorithm Advantage: Retains existing rules for f2f Advantage: Gives same result as existing rules for f2f only case Advantage: Makes it difficult to gain or maintain rights through only e-meetings Disadvantage: May take a long time to remove an e-meeting only attender
Evaluation Scenarios The algorithm is tested for how well it does with respect to: 1. How fast can an IM gain rights 2. How fast can an IM gain rights through only e-meetings 3. How fast will an IM lose rights if only attending e-meetings 4. How fast will an IM lose rights if they stop attending anything Each of these tests are performed on a hypothetical set of meeting scenarios a. EEEEEEEEEEEE - All e-meetings b. EFEEEFEEEFEE Mostly e-meetings c. EFEFEFEFEFEF Alternating d. FEFFEFFEFFEF Supplemental e-meetings e. EFFFEFFFEFFF Mostly f2f f. FFFFFFFFFFFF All f2f
Example Evaluation of a Scenario How fast can an IM gain Rights in the alternating e-meetings/f2f where only e-meetings are attended: (Example from Legacy algorithm) Green Highlight = attended, no highlight=missed E=E-Meeting F=f2f Gains or Loses of voting rights are shown with arrows. If the algorithm consists of both old and add-on parts, you can optionally indicate which part triggered the event using colored arrows. Old Gain c. alternating: EFEFEFEFEFEF Place arrow at meeting where rights are gained/lost Note that rights are gained at the beginning of a meeting. Rights are lost after the end of a meeting. Year Boundary Add-on Both Loss
Eval 1: How fast can an IM gain rights (assume no rights or history initially and that the IM attends every meeting) EEEEEEEEEEEE a. All e-meetings: Please position the arrows appropriately for the proposed algorithm EFEEEFEEEFEE b. Mostly e-meetings : EFEFEFEFEFEF c. Alternating: E = attended e-meeting E= missed e-meeting F = attended f2f F = missed f2f FEFFEFFEFFEF d. Supplemental e-meetings: EFFFEFFFEFFF e. Mostly f2f: FFFFFFFFFFFF f. All f2f:
Eval 2: How fast can an IM gain rights through only e-meetings (assume no rights or history initially and that the IM only attends e-meetings) EEEEEEEEEEEE a. All e-meetings: Please position the arrows appropriately for the proposed algorithm EFEEEFEEEFEE b. Mostly e-meetings : EFEFEFEFEFEF Never gains voting rights c. Alternating: E = attended e-meeting E= missed e-meeting F = attended f2f F = missed f2f FEFFEFFEFFEF Never gains voting rights d. Supplemental e-meetings: EFFFEFFFEFFF Never gains voting rights e. Mostly f2f: FFFFFFFFFFFF Never gains voting rights f. All f2f:
Eval 3: How fast will an IM lose rights if only attending e-meetings (assume rights but no history initially and that the IM only attends e-meetings) Please position the arrows appropriately for the proposed algorithm EEEEEEEEEEEE Never loses voting rights a. All e-meetings: EFEEEFEEEFEE b. Mostly e-meetings : E = attended e-meeting E= missed e-meeting F = attended f2f F = missed f2f EFEFEFEFEFEF c. Alternating: FEFFEFFEFFEF d. Supplemental e-meetings: EFFFEFFFEFFF e. Mostly f2f: FFFFFFFFFFFF f. All f2f:
Eval 4: How fast will an IM lose rights if they stop attending anything (assume rights but no history initially and that the IM does not attend anything) Please position the arrows appropriately for the proposed algorithm EEEEEEEEEEEE a. All e-meetings: EFEEEFEEEFEE b. Mostly e-meetings : E = attended e-meeting E= missed e-meeting F = attended f2f F = missed f2f EFEFEFEFEFEF c. Alternating: FEFFEFFEFFEF d. Supplemental e-meetings: EFFFEFFFEFFF e. Mostly f2f: FFFFFFFFFFFF f. All f2f:
