Cross-Monotonic in Cost Sharing Mechanisms Using Ns2

  • Authors

    • R Ganesan
    • Justin Joseph
    • Jisha Isaac

    Received date: April 6, 2018

    Accepted date: April 6, 2018

    Published date: March 10, 2018

    https://doi.org/10.14419/ijet.v7i2.4.11169
  • Cross-monotonic, Game Theory, Linear Programming, group strategy proofness

  • Abstract

    A cost-sharing plan is an arrangement of guidelines characterizing how to distribute the cost among adjusted clients. A cost-sharing strategy is check monotonic in case it satisfies the property that everyone is in a flawless circumstance when the course of action of individuals who get the affiliation creates. CM is a property that passes on a customer's part ought to be more humble when balanced in a more imperative set. CM is an key techniques to achieve the group strategy proofness. By using the multicast plans that objective the enhanced directing, cross-monotonic cost sharing, and stabilize budget. Unsurprising degree cost recuperations is conceivable, and also apply a primal-twofold diagram to in the meantime create an organizing strategy and a cost-sharing course of action, and demonstrate that the subsequent instrument is collect framework proof and ensures off base cost recuperation against a flawless coordinating game plan.

     

     

  • References

    1. [1] Ahlswede.R, Cai.N, et.al,, “Network Information Flow,†IEEE Trans. Information Theory, vol. 46, no. 4,pp. 1204-121, 2000.

      [2] Brenner.J and Schafer.G (2009), “Cooperative Cost Sharing via Incremental Mechanisms,†Preprint 650, DFG Research Center Matheon, Germany, 2009.

      [3] Goemans.M.X and Williamson.D.P“A General Approximation Technique for Constrained Forest Problems,†Proc. ACM-SIAM Symp. Discrete Algorithms (SODA),2012.

      [4] Immorlica.N, Mahdian.M, andmirrokni.V.S (2005),†Limitations of Cross- Monotonic Cost Sharing Schemes,â€Proc. ACM- SIAM Symp. Discrete Algorithms (SODA).

      [5] Jain.K and Vazirani.V,â€Applications(2001) of Approximation Algorithms to Cooperative Games,â€Proc ACM Symp.Theory of Computing(STOC)

      [6] Konemann.J, Leonardi.S,(2005)and G. Schafer, “A Group-Strategyproof Mechanism for Steiner Forests,†Proc. ACM-SIAM Symp.Discrete Algorithms (SODA).

      [7] Li.Z,(2008),â€Cross-Monotonic Multicast,â€Proc.IEEE INFOCOM.

      [8] Mehta.A, Roughgarden.T, and Sundararajan.M(2009), “Beyond Moulin Mechanisms,†Games and Economic Behavior, vol. 67,no. 1, pp. 125-155

      [9] Moulin,(1999) “Incremental Cost Sharing:Characterization by Coalition Strategy- Proofnessâ€,Social Choice and Welfare,vol.16,pp.279-320

      [10] Moulin, H. Soc Choice Welfare (1999) 16: 279. https://doi.org/10.1007/s003550050145

      [11] N. IMMORLICA, M. MAHDIAN, AND V. S. MIRROKNI, Limitations of crossmonotonic cost sharing schemes, in Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, ACM Press, 2005, pp. 602–611.

  • Downloads

  • How to Cite

    Ganesan, R., Joseph, J., & Isaac, J. (2018). Cross-Monotonic in Cost Sharing Mechanisms Using Ns2. International Journal of Engineering and Technology, 7(2.4), 76-80. https://doi.org/10.14419/ijet.v7i2.4.11169

    Received date: April 6, 2018

    Accepted date: April 6, 2018

    Published date: March 10, 2018