Median computation in graphs using consensus strategies
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Bandelt, Hans-Jurgen, 1985. "Networks with condorcet solutions," European Journal of Operational Research, Elsevier, vol. 20(3), pages 314-326, June.
- A. J. Goldman, 1971. "Optimal Center Location in Simple Networks," Transportation Science, INFORMS, vol. 5(2), pages 212-221, May.
- Balakrishnan, K. & Changat, M. & Mulder, H.M., 2006. "The plurality strategy on graphs," Econometric Institute Research Papers EI 2006-35, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Pierre Barthelemy, Jean & Monjardet, Bernard, 1981. "The median procedure in cluster analysis and social choice theory," Mathematical Social Sciences, Elsevier, vol. 1(3), pages 235-267, May.
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.- Balakrishnan, K. & Changat, M. & Mulder, H.M. & Subhamathi, A.R., 2011. "Consensus Strategies for Signed Profiles on Graphs," Econometric Institute Research Papers EI2011-34, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Balakrishnan, K. & Changat, M. & Mulder, H.M., 2006. "The plurality strategy on graphs," Econometric Institute Research Papers EI 2006-35, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Esmaeil Afrashteh & Behrooz Alizadeh & Fahimeh Baroughi, 2020. "Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks," Annals of Operations Research, Springer, vol. 289(2), pages 153-172, June.
- Bernard Monjardet & Jean-Pierre Barthélemy & Olivier Hudry & Bruno Leclerc, 2009.
"Metric and latticial medians,"
Post-Print
halshs-00408174, HAL.
- Bernard Monjardet & Jean-Pierre Barthélemy & Olivier Hudry & Bruno Leclerc, 2009. "Metric and latticial medians," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00408174, HAL.
- Hudry, Olivier, 2009. "A survey on the complexity of tournament solutions," Mathematical Social Sciences, Elsevier, vol. 57(3), pages 292-303, May.
- Hannu Salonen, 2014.
"Aggregating and Updating Information,"
Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 8(2), pages 55-67, October.
- Hannu Salonen, 2012. "Aggregating And Updating Information," Discussion Papers 73, Aboa Centre for Economics.
- McMorris, F.R. & Mulder, H.M. & Ortega, O., 2010. "Axiomatic Characterization of the Mean Function on Trees," Econometric Institute Research Papers EI 2010-07, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Nehring, Klaus & Pivato, Marcus & Puppe, Clemens, 2014.
"The Condorcet set: Majority voting over interconnected propositions,"
Journal of Economic Theory, Elsevier, vol. 151(C), pages 268-303.
- Nehring, Klaus & Pivato, Marcus & Puppe, Clemens, 2013. "The Condorcet set: Majority voting over interconnected propositions," Working Paper Series in Economics 51, Karlsruhe Institute of Technology (KIT), Department of Economics and Management.
- Rainer Burkard & Jafar Fathali, 2007. "A polynomial method for the pos/neg weighted 3-median problem on a tree," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(2), pages 229-238, April.
- Chunsong Bai & Jun Du, 2024. "The Constrained 2-Maxian Problem on Cycles," Mathematics, MDPI, vol. 12(6), pages 1-9, March.
- Gabrielle Demange, 2012.
"Majority relation and median representative ordering,"
SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 3(1), pages 95-109, March.
- Gabrielle Demange, 2011. "Majority relation and median representative ordering," PSE Working Papers halshs-00581310, HAL.
- Gabrielle Demange, 2012. "Majority relation and median representative ordering," Post-Print halshs-00670854, HAL.
- Gabrielle Demange, 2012. "Majority relation and median representative ordering," PSE-Ecole d'économie de Paris (Postprint) halshs-00670854, HAL.
- Gabrielle Demange, 2011. "Majority relation and median representative ordering," Working Papers halshs-00581310, HAL.
- Nehring, Klaus & Pivato, Marcus & Puppe, Clemens, 2011. "Condorcet admissibility: Indeterminacy and path-dependence under majority voting on interconnected decisions," MPRA Paper 32434, University Library of Munich, Germany.
- Hudry, Olivier, 2010. "On the complexity of Slater's problems," European Journal of Operational Research, Elsevier, vol. 203(1), pages 216-221, May.
- Mehrdad Moshtagh & Jafar Fathali & James MacGregor Smith & Nezam Mahdavi-Amiri, 2019. "Finding an optimal core on a tree network with M/G/c/c state-dependent queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(1), pages 115-142, February.
- Marcus Pivato, 2013.
"Voting rules as statistical estimators,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(2), pages 581-630, February.
- Pivato, Marcus, 2011. "Voting rules as statistical estimators," MPRA Paper 30292, University Library of Munich, Germany.
- Dewan F. Wahid & Elkafi Hassini, 2022. "A Literature Review on Correlation Clustering: Cross-disciplinary Taxonomy with Bibliometric Analysis," SN Operations Research Forum, Springer, vol. 3(3), pages 1-42, September.
- Oded Berman & Dmitry Krass & Mozart B. C. Menezes, 2007. "Facility Reliability Issues in Network p -Median Problems: Strategic Centralization and Co-Location Effects," Operations Research, INFORMS, vol. 55(2), pages 332-350, April.
- Mulder, H.M. & Pelsmajer, M.J. & Reid, K.B., 2006. "Generalized centrality in trees," Econometric Institute Research Papers EI 2006-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Jean-Pierre Barthélemy, 1988. "Thresholded consensus for n-trees," Journal of Classification, Springer;The Classification Society, vol. 5(2), pages 229-236, September.
- Houy, Nicolas & Zwicker, William S., 2014.
"The geometry of voting power: Weighted voting and hyper-ellipsoids,"
Games and Economic Behavior, Elsevier, vol. 84(C), pages 7-16.
- Nicolas Houy & William S. Zwicker, 2013. "The geometry of voting power : weighted voting and hyper-ellipsoids," Working Papers halshs-00772953, HAL.
- Nicolas Houy & William S. Zwicker, 2014. "The geometry of voting power: weighted voting and hyper-ellipsoids," Post-Print halshs-00926969, HAL.
More about this item
Keywords
Hill climbing median computation; consensus strategy; majority strategy;All these keywords.
Statistics
Access and download statisticsCorrections
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:ems:eureir:10556. 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: RePub (email available below). General contact details of provider: https://edirc.repec.org/data/feeurnl.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.