Bidding for surplus in network allocation problems
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- David Pérez-Castrillo & David Wettstein, "undated". "Bidding For The Surplus: A Non-Cooperative Approach To The Shapley Value," UFAE and IAE Working Papers 461.00, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- 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.
- Vidal-Puga, Juan & Bergantinos, Gustavo, 2003. "An implementation of the Owen value," Games and Economic Behavior, Elsevier, vol. 44(2), pages 412-427, August.
- 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.
- Hamiache, Gerard, 1999.
"A Value with Incomplete Communication,"
Games and Economic Behavior, Elsevier, vol. 26(1), pages 59-78, January.
- Hamiache, G., 1997. "A Value with Incomplete Communication," G.R.E.Q.A.M. 97a22, Universite Aix-Marseille III.
- Hamiache, G., 1997. "A Value with Incomplete Communication," ASSET - Instituto De Economia Publica 169, ASSET (Association of Southern European Economic Theorists).
- Jackson, Matthew O., 2005.
"Allocation rules for network games,"
Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
- Matthew O. Jackson, 2003. "Allocation Rules for Network Games," Game Theory and Information 0303010, University Library of Munich, Germany.
- Matthew O. Jackson, 2003. "Allocation Rules for Network Games," Working Papers 2003.51, Fondazione Eni Enrico Mattei.
- Matthew O. Jackson, 2003. "Allocation Rules for Network Games," Working Papers 1160, California Institute of Technology, Division of the Humanities and Social Sciences.
- Jackson, Matthew O. & van den Nouweland, Anne, 2005.
"Strongly stable networks,"
Games and Economic Behavior, Elsevier, vol. 51(2), pages 420-444, May.
- Matthew O. Jackson, 2001. "Strongly Stable Networks," University of Oregon Economics Department Working Papers 2001-3, University of Oregon Economics Department, revised 15 Nov 2002.
- Matthew O. Jackson & Anne van den Nouweland, 2002. "Strongly Stable Networks," Microeconomics 0211006, University Library of Munich, Germany.
- Jackson, Matthew O. & van den Nouweland, Anne, 2002. "Strongly Stable Networks," Working Papers 1147, California Institute of Technology, Division of the Humanities and Social Sciences.
- 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.
- Matthew O. Jackson & Asher Wolinsky, 1994. "A Strategic Model of Social and Economic Networks," Discussion Papers 1098, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Matthew O. Jackson & Asher Wolinsky, 1995. "A Strategic Model of Social and Economic Networks," Discussion Papers 1098R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Demange,Gabrielle & Wooders,Myrna (ed.), 2005. "Group Formation in Economics," Cambridge Books, Cambridge University Press, number 9780521842716, September.
- 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.
- Marco Slikker, 2005.
"Link Monotonic Allocation Schemes,"
International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 7(04), pages 473-489.
- Slikker, M., 1999. "Link Monotonic Allocation Schemes," Discussion Paper 1999-06, Tilburg University, Center for Economic Research.
- 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.
- Roger B. Myerson, 1977.
"Graphs and Cooperation in Games,"
Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
- Roger B. Myerson, 1976. "Graphs and Cooperation in Games," Discussion Papers 246, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Perez-Castrillo, David & Wettstein, David, 2005.
"Forming efficient networks,"
Economics Letters, Elsevier, vol. 87(1), pages 83-87, April.
- David Pérez-Castrillo & David Wettstein, 2004. "Forming Efficient Networks," Working Papers 123, Barcelona School of Economics.
- David Pérez-Castrillo & David Wettstein, 2004. "Forming Efficient Networks," UFAE and IAE Working Papers 609.04, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- 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.
- Hart, Sergiu & Mas-Colell, Andreu, 1996.
"Bargaining and Value,"
Econometrica, Econometric Society, vol. 64(2), pages 357-380, March.
- Sergiu Hart & Andreu Mas-Colell, 1994. "Bargaining and value," Economics Working Papers 114, Department of Economics and Business, Universitat Pompeu Fabra, revised Feb 1995.
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- 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.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00881125, HAL.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Post-Print halshs-00881125, HAL.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01207823, HAL.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Documents de travail du Centre d'Economie de la Sorbonne 13063, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," PSE-Ecole d'économie de Paris (Postprint) halshs-01207823, HAL.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Post-Print halshs-01207823, HAL.
- Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
- Kamijo, Yoshio, 2008. "Implementation of weighted values in hierarchical and horizontal cooperation structures," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 336-349, November.
- Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
- 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.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "A strategic implementation of the sequential equal surplus division rule for digraph cooperative games," Working Papers 2015-07, CRESE.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2017. "A strategic implementation of the sequential equal surplus division rule for digraph cooperative games," Post-Print halshs-01381379, HAL.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "A strategic implementation of the sequential equal surplus division rule for digraph cooperative games," Working Papers hal-01376910, HAL.
- 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.
- Sylvain Béal & André Casajus & Frank Huettner, 2015. "Efficient extensions of communication values," Working Papers 2015-04, CRESE.
- Sylvain Béal & André Casajus & Frank Huettner, 2015. "Efficient extensions of communication values," Working Papers hal-01376907, HAL.
- 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.
- Sylvain Béal & Éric Rémila & Philippe Solal, 2012. "Fairness and Fairness for Neighbors: The Difference between the Myerson Value and Component-Wise Egalitarian Solutions," Post-Print halshs-00699641, HAL.
- 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," MPRA Paper 36857, University Library of Munich, Germany.
- 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.
- Rene van den Brink & Gerard van der Laan & Nigel Moes, 2012. "A Strategic Implementation of the Average Tree Solution for Cycle-Free Graph Games," Tinbergen Institute Discussion Papers 12-050/1, Tinbergen Institute.
- 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.
- Sun, Chaoran, 2022. "Bidding against a Buyout: Implementing the Shapley value and the equal surplus value," Journal of Mathematical Economics, Elsevier, vol. 101(C).
- repec:hal:pseose:halshs-01207823 is not listed on IDEAS
- Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2023. "Weighted position value for Network games," Papers 2308.03494, arXiv.org.
- Li, Daniel Li & Shan, Erfang, 2023. "Tree solutions and standardness for cycle-free graph games," Economics Letters, Elsevier, vol. 222(C).
- Pérez-Castrillo, David & Quérou, Nicolas, 2012.
"Smooth multibidding mechanisms,"
Games and Economic Behavior, Elsevier, vol. 76(2), pages 420-438.
- David Pérez-Castrillo & Nicolas Quérou, 2010. "Smooth multibidding mechanisms," UFAE and IAE Working Papers 849.10, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- David Pérez-Castrillo & Nicolas Quérou, 2011. "Smooth Multibidding Mechanisms," CESifo Working Paper Series 3394, CESifo.
- David Pérez-Castrillo & Nicolas Quérou, 2010. "Smooth Multibidding Mechanisms," Working Papers 520, Barcelona School of Economics.
- Matthew Elliott & Arun Chandrasekhar & Attila Ambrus, 2015. "Social Investments, Informal Risk Sharing, and Inequality," 2015 Meeting Papers 189, Society for Economic Dynamics.
- 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.
- Encarnacion Algaba & Rene van den Brink, 2021. "Networks, Communication and Hierarchy: Applications to Cooperative Games," Tinbergen Institute Discussion Papers 21-019/IV, Tinbergen Institute.
- 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.
- 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.
- Borkotokey, Surajit & Chakrabarti, Subhadip & Gilles, Robert P. & Gogoi, Loyimee & Kumar, Rajnish, 2020. "Probabilistic Network Values," QBS Working Paper Series 2020/08, Queen's University Belfast, Queen's Business School.
- Xiaowei Yu & Keith Waehrer, 2024. "Recursive Nash-in-Nash bargaining solution," Economics Bulletin, AccessEcon, vol. 44(1), pages 11-24.
- 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.
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.- 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.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Post-Print halshs-00881125, HAL.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00881125, HAL.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01207823, HAL.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Documents de travail du Centre d'Economie de la Sorbonne 13063, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," PSE-Ecole d'économie de Paris (Postprint) halshs-01207823, HAL.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Post-Print halshs-01207823, HAL.
- Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
- Kamijo, Yoshio, 2008. "Implementation of weighted values in hierarchical and horizontal cooperation structures," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 336-349, November.
- Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
- 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.
- 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.
- Rene van den Brink & Gerard van der Laan & Nigel Moes, 2012. "A Strategic Implementation of the Average Tree Solution for Cycle-Free Graph Games," Tinbergen Institute Discussion Papers 12-050/1, Tinbergen Institute.
- Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2023. "Weighted position value for Network games," Papers 2308.03494, arXiv.org.
- 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.
- Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
- 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.
- Florian Navarro, 2020. "The center value: A sharing rule for cooperative games on acyclic graphs," Post-Print hal-03411527, HAL.
- 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.
- Amandine Ghintran & Enrique Gonzalez-Arangüena & Conrado Manuel, 2010. "A probabilistic position value," Working Paper Series 1006, Óbuda University, Keleti Faculty of Business and Management.
- Amandine Ghintran & Enrique Gonzalez-Aranguena & Conrado Manuel, 2011. "A probabilistic position value," Working Papers hal-00988137, HAL.
- Belau, Julia, 2016. "Outside option values for network games," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 76-86.
- 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.
- Borkotokey, Surajit & Chakrabarti, Subhadip & Gilles, Robert P. & Gogoi, Loyimee & Kumar, Rajnish, 2020. "Probabilistic Network Values," QBS Working Paper Series 2020/08, Queen's University Belfast, Queen's Business School.
- Jackson, Matthew O., 2005.
"Allocation rules for network games,"
Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
- Matthew O. Jackson, 2003. "Allocation Rules for Network Games," Game Theory and Information 0303010, University Library of Munich, Germany.
- Matthew O. Jackson, 2003. "Allocation Rules for Network Games," Working Papers 1160, California Institute of Technology, Division of the Humanities and Social Sciences.
- Matthew O. Jackson, 2003. "Allocation Rules for Network Games," Working Papers 2003.51, Fondazione Eni Enrico Mattei.
- repec:hal:pseose:halshs-01207823 is not listed on IDEAS
- 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.
- J. Vandenbossche & T. Demuynck & -, 2010. "Network formation with heterogeneous agents and absolute friction," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 10/642, Ghent University, Faculty of Economics and Business Administration.
- Thomas Demuynck & Joost Vandenbossche, 2013. "Network formation with heterogeneous agents and absolute friction," ULB Institutional Repository 2013/252237, ULB -- Universite Libre de Bruxelles.
- 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.
- 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.
- Jean-Francois Caulier & Ana Mauleon & Vincent VAnnetelbosch, 2007. "Contractually Stable Networks," NajEcon Working Paper Reviews 843644000000000084, www.najecon.org.
- Jean-François Caulier & A. Mauleon & Vincent Vannetelbosch, 2013. "Contractually stable networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00633611, HAL.
- Vincent Vannetelbosch & Jean-François Caulier & Ana Mauleon, 2009. "Contractually Stable Networks," Working Papers 2009.47, Fondazione Eni Enrico Mattei.
- Jean-François Caulier & A. Mauleon & Vincent Vannetelbosch, 2013. "Contractually stable networks," Post-Print hal-00633611, HAL.
- CAULIER, Jean-François & MAULEON, Ana & VANNETELBOSCH, Vincent, 2008. "Contractually stable networks," LIDAM Discussion Papers CORE 2008066, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- CAULIER, Jean-François & MAULEON, Ana & VANNETELBOSCH, Vincent, 2013. "Contractually stable networks," LIDAM Reprints CORE 2477, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Caulier, Jean-Francois & Mauleon, Ana & Vannetelbosch, Vincent, 2009. "Contractually Stable Networks," Sustainable Development Papers 52343, Fondazione Eni Enrico Mattei (FEEM).
- Jean-François, CAULIER & Ana, MAULEON & Vincent, VANNETELBOSCH, 2008. "Contractually stable networks," Discussion Papers (ECON - Département des Sciences Economiques) 2008045, Université catholique de Louvain, Département des Sciences Economiques.
- 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.
- 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.
- Swapnil Dhamal & Y. Narahari, 2015. "Formation of Stable Strategic Networks with Desired Topologies," Studies in Microeconomics, , vol. 3(2), pages 158-213, December.
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.