IDEAS home Printed from https://ideas.repec.org/a/eee/jetheo/v137y2007i1p493-511.html
   My bibliography  Save this article

Bidding for surplus in network allocation problems

Author

Listed:
  • Slikker, Marco

Abstract

No abstract is available for this item.

Suggested Citation

  • Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
    • Handle: RePEc:eee:jetheo:v:137:y:2007:i:1:p:493-511
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0022-0531(07)00018-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Marco Slikker, 2005. "A characterization of the position value," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(4), pages 505-514, November.
    2. Vidal-Puga, Juan & Bergantinos, Gustavo, 2003. "An implementation of the Owen value," Games and Economic Behavior, Elsevier, vol. 44(2), pages 412-427, August.
    3. Hamiache, Gerard, 1999. "A Value with Incomplete Communication," Games and Economic Behavior, Elsevier, vol. 26(1), pages 59-78, January.
    4. Jackson, Matthew O. & van den Nouweland, Anne, 2005. "Strongly stable networks," Games and Economic Behavior, Elsevier, vol. 51(2), pages 420-444, May.
    5. Demange,Gabrielle & Wooders,Myrna (ed.), 2005. "Group Formation in Economics," Cambridge Books, Cambridge University Press, number 9780521842716.
    6. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    7. Borm, P.E.M. & Owen, G. & Tijs, S.H., 1992. "On the position value for communication situations," Other publications TiSEM 5a8473e4-1df7-42df-ad53-f, Tilburg University, School of Economics and Management.
    8. Jackson, Matthew O. & Wolinsky, Asher, 1996. "A Strategic Model of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 71(1), pages 44-74, October.
    9. Bilbao, J.M. & Jimenez, N. & Lopez, J.J., 2006. "A note on a value with incomplete communication," Games and Economic Behavior, Elsevier, vol. 54(2), pages 419-429, February.
    10. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    11. Perez-Castrillo, David & Wettstein, David, 2005. "Forming efficient networks," Economics Letters, Elsevier, vol. 87(1), pages 83-87, April.
    12. Perez-Castrillo, David & Wettstein, David, 2001. "Bidding for the Surplus : A Non-cooperative Approach to the Shapley Value," Journal of Economic Theory, Elsevier, vol. 100(2), pages 274-294, October.
    13. Jesús Mario Bilbao & Nieves Jiménez & Jorge Jesús López, 2004. "A note on a value with incomplete communication," Economic Working Papers at Centro de Estudios Andaluces E2004/55, Centro de Estudios Andaluces.
    14. Marco Slikker, 2005. "Link Monotonic Allocation Schemes," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 7(04), pages 473-489.
    15. Maschler, M & Owen, G, 1989. "The Consistent Shapley Value for Hyperplane Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 18(4), pages 389-407.
    16. Hart, Sergiu & Mas-Colell, Andreu, 1996. "Bargaining and Value," Econometrica, Econometric Society, vol. 64(2), pages 357-380, March.
    17. Mutuswami, Suresh & Perez-Castrillo, David & Wettstein, David, 2004. "Bidding for the surplus: realizing efficient outcomes in economic environments," Games and Economic Behavior, Elsevier, vol. 48(1), pages 111-123, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    2. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
    3. Kamijo, Yoshio, 2008. "Implementation of weighted values in hierarchical and horizontal cooperation structures," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 336-349, November.
    4. Sylvain Béal & Eric Rémila & Philippe Solal, 2017. "A strategic implementation of the sequential equal surplus division rule for digraph cooperative games," Annals of Operations Research, Springer, vol. 253(1), pages 43-59, June.
    5. Sylvain Béal & André Casajus & Frank Huettner, 2018. "Efficient extensions of communication values," Annals of Operations Research, Springer, vol. 264(1), pages 41-56, May.
    6. van den Brink, René & van der Laan, Gerard & Moes, Nigel, 2013. "A strategic implementation of the Average Tree solution for cycle-free graph games," Journal of Economic Theory, Elsevier, vol. 148(6), pages 2737-2748.
    7. Bergantiños, Gustavo & Vidal-Puga, Juan, 2010. "Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms," European Journal of Operational Research, Elsevier, vol. 201(3), pages 811-820, March.
    8. Sun, Chaoran, 2022. "Bidding against a Buyout: Implementing the Shapley value and the equal surplus value," Journal of Mathematical Economics, Elsevier, vol. 101(C).
    9. Pérez-Castrillo, David & Quérou, Nicolas, 2012. "Smooth multibidding mechanisms," Games and Economic Behavior, Elsevier, vol. 76(2), pages 420-438.
    10. Attila Ambrus & Arun G. Chandrasekhar & Matt Elliott, 2014. "Social Investments, Informal Risk Sharing, and Inequality," NBER Working Papers 20669, National Bureau of Economic Research, Inc.
    11. Encarnacion Algaba & Rene van den Brink, 2021. "Networks, Communication and Hierarchy: Applications to Cooperative Games," Tinbergen Institute Discussion Papers 21-019/IV, Tinbergen Institute.
    12. Borkotokey, Surajit & Chakrabarti, Subhadip & Gilles, Robert P. & Gogoi, Loyimee & Kumar, Rajnish, 2021. "Probabilistic network values," Mathematical Social Sciences, Elsevier, vol. 113(C), pages 169-180.
    13. Jun Su & Yuan Liang & Guangmin Wang & Genjiu Xu, 2020. "Characterizations, Potential, and an Implementation of the Shapley-Solidarity Value," Mathematics, MDPI, vol. 8(11), pages 1-20, November.
    14. Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
    15. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "Fairness and fairness for neighbors: The difference between the Myerson value and component-wise egalitarian solutions," Economics Letters, Elsevier, vol. 117(1), pages 263-267.
    16. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2023. "Weighted position value for Network games," Papers 2308.03494, arXiv.org.
    17. Li, Daniel Li & Shan, Erfang, 2023. "Tree solutions and standardness for cycle-free graph games," Economics Letters, Elsevier, vol. 222(C).
    18. Matthew Elliott & Arun Chandrasekhar & Attila Ambrus, 2015. "Social Investments, Informal Risk Sharing, and Inequality," 2015 Meeting Papers 189, Society for Economic Dynamics.
    19. Borkotokey, Surajit & Kumar, Rajnish & Sarangi, Sudipta, 2015. "A solution concept for network games: The role of multilateral interactions," European Journal of Operational Research, Elsevier, vol. 243(3), pages 912-920.
    20. Xiaowei Yu & Keith Waehrer, 2024. "Recursive Nash-in-Nash bargaining solution," Economics Bulletin, AccessEcon, vol. 44(1), pages 11-24.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    2. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
    3. Kamijo, Yoshio, 2008. "Implementation of weighted values in hierarchical and horizontal cooperation structures," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 336-349, November.
    4. Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
    5. van den Nouweland, Anne & Slikker, Marco, 2012. "An axiomatic characterization of the position value for network situations," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 266-271.
    6. van den Brink, René & van der Laan, Gerard & Moes, Nigel, 2013. "A strategic implementation of the Average Tree solution for cycle-free graph games," Journal of Economic Theory, Elsevier, vol. 148(6), pages 2737-2748.
    7. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2023. "Weighted position value for Network games," Papers 2308.03494, arXiv.org.
    8. Surajit Borkotokey & Loyimee Gogoi & Sudipta Sarangi, 2014. "A Survey of Player-based and Link-based Allocation Rules for Network Games," Studies in Microeconomics, , vol. 2(1), pages 5-26, June.
    9. Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
    10. Navarro, Florian, 2020. "The center value: A sharing rule for cooperative games on acyclic graphs," Mathematical Social Sciences, Elsevier, vol. 105(C), pages 1-13.
    11. A. Ghintran & E. González-Arangüena & C. Manuel, 2012. "A probabilistic position value," Annals of Operations Research, Springer, vol. 201(1), pages 183-196, December.
    12. Belau, Julia, 2016. "Outside option values for network games," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 76-86.
    13. Borkotokey, Surajit & Chakrabarti, Subhadip & Gilles, Robert P. & Gogoi, Loyimee & Kumar, Rajnish, 2021. "Probabilistic network values," Mathematical Social Sciences, Elsevier, vol. 113(C), pages 169-180.
    14. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    15. Joost Vandenbossche & Thomas Demuynck, 2013. "Network Formation with Heterogeneous Agents and Absolute Friction," Computational Economics, Springer;Society for Computational Economics, vol. 42(1), pages 23-45, June.
    16. Slikker, M. & Gilles, R.P. & Norde, H.W. & Tijs, S.H., 2000. "Directed Communication Networks," Discussion Paper 2000-84, Tilburg University, Center for Economic Research.
    17. Jean-François Caulier & Ana Mauleon & Vincent Vannetelbosch, 2013. "Contractually stable networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 483-499, May.
    18. Borkotokey, Surajit & Sarangi, Sudipta, 2011. "Allocation rules for fixed and flexible networks: the role of players and their links," MPRA Paper 38340, University Library of Munich, Germany.
    19. C. Manuel & D. Martín, 2021. "A value for communication situations with players having different bargaining abilities," Annals of Operations Research, Springer, vol. 301(1), pages 161-182, June.
    20. Swapnil Dhamal & Y. Narahari, 2015. "Formation of Stable Strategic Networks with Desired Topologies," Studies in Microeconomics, , vol. 3(2), pages 158-213, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:137:y:2007:i:1:p:493-511. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622869 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.