var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\",\"jsonp\":\"1\",\"authorFirst\":\"1\",\"sort\":\"-year\",\"theme\":\"side\",\"host\":\"bibbase.org\"},\n      data: [{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Multi-district preference modelling\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Pritchard\"],\"firstnames\":[\"Geoffrey\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C\"],\"suffixes\":[]}],\"journal\":\"Quality & Quantity\",\"volume\":\"57\",\"keywords\":\"electoral systems\",\"number\":\"1\",\"pages\":\"587–613\",\"year\":\"2023\",\"url_paper\":\"\",\"abstract\":\"Generating realistic artificial preference distributions is an important part of any simulation analysis of electoral systems. While this has been discussed in some detail in the context of a single electoral district, many electoral systems of interest are based on districts. Neither treating preferences between districts as independent nor ignoring the district structure yields satisfactory results. We present a model based on an extension of the classic Eggenberger-Pólya urn, in which each district is represented by an urn and there is correlation between urns. We show in detail that this procedure has a small number of tunable parameters, is computationally efficient, and produces ``realistic-looking\\\" distributions. We present applications to retrospective analysis and forecasting of real elections, and intend to use the methodology to help set optimal parameters for electoral systems. (Subsumes SocArXiv paper xpb8w from 2018)\",\"bibtex\":\"@article{pritchard2023multi,\\n  title={Multi-district preference modelling},\\n  author={Pritchard, Geoffrey and Wilson, Mark C},\\n  journal={Quality \\\\& Quantity},\\n  volume={57},\\n  keywords={electoral systems},\\n  number={1},\\n  pages={587--613},\\n  year={2023},\\n  url_Paper={},\\n  abstract   = {Generating realistic artificial preference distributions is an important\\npart of any simulation analysis of electoral systems. While this has\\nbeen discussed in some detail in the context of a single electoral\\ndistrict, many electoral systems of interest are based on districts.\\nNeither treating preferences between districts as independent nor\\nignoring the district structure yields satisfactory results. We present\\na model based on an extension of the classic Eggenberger-P\\\\'{o}lya urn,\\nin which each district is represented by an urn and there is correlation\\nbetween urns. We show in detail that this procedure has a small number\\nof tunable parameters, is computationally efficient, and produces\\n{``}realistic-looking{\\\"} distributions. We present applications to\\nretrospective analysis and forecasting of real elections, and intend to\\nuse the methodology to help set optimal parameters for electoral\\nsystems. (Subsumes SocArXiv paper xpb8w from 2018)}\\n}\\n\\n\",\"author_short\":[\"Pritchard, G.\",\"Wilson, M. C\"],\"key\":\"pritchard2023multi\",\"id\":\"pritchard2023multi\",\"bibbaseid\":\"pritchard-wilson-multidistrictpreferencemodelling-2023\",\"role\":\"author\",\"urls\":{\" paper\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"electoral systems\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Pritchard\"],\"firstnames\":[\"Geoffrey\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Stochastic Systems\",\"abstract\":\"We make a detailed analysis of three key algorithms (Serial Dictatorship and the naive and adaptive variants of the Boston algorithm) for the housing alloca- tion problem, under the assumption that agent preferences are chosen iid uniformly from linear orders on the items. We compute limiting distributions (with respect to some common utility functions) as $n\\\\to∞$ of both the utilitarian welfare and the or- der bias. To do this, we compute limiting distributions of the outcomes for an arbitrary agent whose initial relative position in the tiebreak order is $θ∈ [0, 1]$, as a function of θ. We expect that these fundamental results on the stochastic processes underlying these mechanisms will have wider applicability in future. Overall our results show that the differences in utilitarian welfare performance of the three algorithms are fairly small, but the differences in order bias are much greater. Also, Naive Boston beats Adaptive Boston, which beats Serial Dictatorship, on both welfare and order bias. \",\"title\":\"Asymptotic welfare performance of Boston assignment algorithms\",\"year\":\"2023\",\"number\":\"2\",\"pages\":\"247–270\",\"volume\":\"13\",\"doi\":\"\",\"keywords\":\"social choice,assignment\",\"url_paper\":\"https://pubsonline.informs.org/doi/abs/10.1287/stsy.2022.0104\",\"url_slides\":\"https://www.dropbox.com/s/1jk218g16pp8qas/Mark_Wilson.pdf?dl=0\",\"bibtex\":\"@Article{PrWi2022,\\n  author  = {Pritchard, Geoffrey and Wilson, Mark C.},\\n  journal = {Stochastic Systems},\\n  abstract  = {We make a detailed analysis of three key algorithms (Serial Dictatorship\\nand the naive and adaptive variants of the Boston algorithm) for the housing alloca-\\ntion problem, under the assumption that agent preferences are chosen iid uniformly\\nfrom linear orders on the items. We compute limiting distributions (with respect to\\nsome common utility functions) as $n\\\\to\\\\infty$ of both the utilitarian welfare and the or-\\nder bias. To do this, we compute limiting distributions of the outcomes for an arbitrary\\nagent whose initial relative position in the tiebreak order is $\\\\theta\\\\in [0, 1]$, as a function of θ.\\nWe expect that these fundamental results on the stochastic processes underlying these\\nmechanisms will have wider applicability in future. Overall our results show that the\\ndifferences in utilitarian welfare performance of the three algorithms are fairly small,\\nbut the differences in order bias are much greater. Also, Naive Boston beats Adaptive\\nBoston, which beats Serial Dictatorship, on both welfare and order bias.\\n},\\n  title   = {Asymptotic welfare performance of Boston assignment algorithms},\\n  year    = {2023},\\n  number  = {2},\\n  pages   = {247--270},\\n  volume  = {13},\\n  doi     = {},\\n  keywords = {social choice,assignment},\\n  url_paper = {https://pubsonline.informs.org/doi/abs/10.1287/stsy.2022.0104},\\n  url_slides = {https://www.dropbox.com/s/1jk218g16pp8qas/Mark_Wilson.pdf?dl=0},\\n}\\n\\n\",\"author_short\":[\"Pritchard, G.\",\"Wilson, M. C.\"],\"key\":\"PrWi2022\",\"id\":\"PrWi2022\",\"bibbaseid\":\"pritchard-wilson-asymptoticwelfareperformanceofbostonassignmentalgorithms-2023\",\"role\":\"author\",\"urls\":{\" paper\":\"https://pubsonline.informs.org/doi/abs/10.1287/stsy.2022.0104\",\" slides\":\"https://www.dropbox.com/s/1jk218g16pp8qas/Mark_Wilson.pdf?dl=0\"},\"keyword\":[\"social choice\",\"assignment\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ghaffari\"],\"firstnames\":[\"Fatemeh\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"abstract\":\"We introduce and analyse a simple probabilistic model of article production and citation behavior that explicitly assumes that there is no decline in citability of a given article over time. It makes predictions about the number and age of items appearing in the reference list of an article. The latter topics have been studied before, but only in the context of data, and to our knowledge no models have been presented. We then perform large-scale analyses of reference list length for a variety of academic disciplines. The results show that our simple model cannot be rejected, and indeed fits the aggregated data on reference lists rather well. Over the last few decades, the relationship between total publications and mean reference list length is linear to a high level of accuracy. Although our model is clearly an oversimplification, it will likely prove useful for further modeling of the scholarly literature. Finally, we connect our work to the large literature on ``aging\\\" or ``obsolescence\\\" of scholarly publications, and argue that the importance of that area of research is no longer clear, while much of the existing literature is confused and confusing.\",\"title\":\"A model for reference list length of scholarly articles\",\"journal\":\"Scientometrics\",\"year\":\"2023\",\"pages\":\"5335–5350\",\"volume\":\"128\",\"number\":\"9\",\"keywords\":\"scientometrics\",\"url_paper\":\"https://arxiv.org/pdf/2305.00089.pdf\",\"url_slides\":\"\",\"bibtex\":\"@Article{GhWi2023,\\nauthor = {Ghaffari, Fatemeh and Wilson, Mark C.},\\nabstract = {We introduce and analyse a simple probabilistic model of article\\nproduction and citation behavior that explicitly assumes that there is\\nno decline in citability of a given article over time. It makes\\npredictions about the number and age of items appearing in the reference\\nlist of an article. The latter topics have been studied before, but only\\nin the context of data, and to our knowledge no models have been\\npresented. We then perform large-scale analyses of reference list length\\nfor a variety of academic disciplines. The results show that our simple\\nmodel cannot be rejected, and indeed fits the aggregated data on\\nreference lists rather well. Over the last few decades, the relationship\\nbetween total publications and mean reference list length is linear to a\\nhigh level of accuracy. Although our model is clearly an\\noversimplification, it will likely prove useful for further modeling of\\nthe scholarly literature. Finally, we connect our work to the large\\nliterature on ``aging\\\" or ``obsolescence\\\" of scholarly publications, and\\nargue that the importance of that area of research is no longer clear,\\nwhile much of the existing literature is confused and confusing.},\\ntitle = {A model for reference list length of scholarly articles},\\njournal = {Scientometrics},\\nyear = {2023},\\npages = {5335–5350},\\nvolume={128},\\nnumber={9},\\nkeywords = {scientometrics},\\nurl_paper = {https://arxiv.org/pdf/2305.00089.pdf},\\nurl_slides = {},\\n}\\n\\n\",\"author_short\":[\"Ghaffari, F.\",\"Wilson, M. C.\"],\"key\":\"GhWi2023\",\"id\":\"GhWi2023\",\"bibbaseid\":\"ghaffari-wilson-amodelforreferencelistlengthofscholarlyarticles-2023\",\"role\":\"author\",\"urls\":{\" paper\":\"https://arxiv.org/pdf/2305.00089.pdf\",\" slides\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"scientometrics\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":13,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Grofman\"],\"firstnames\":[\"Bernard\",\"N.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"title\":\"Models of inter-election change in partisan vote share\",\"pages\":\"481–498\",\"volume\":\"34\",\"issue\":\"4\",\"journal\":\"J. Theoretical Politics\",\"abstract\":\"Consider an election of a given type (say a legislative or presidential election) involving some set of districts for which we have data at two distinct points in time, time 1 and time 2. If there are only two political parties, A and B, we may think of the overall difference in the mean party vote share of party A between the two elections as the aggregate inter-election swing between the two parties. If we know this mean inter-election swing, the question we seek to answer is: ``How do we expect the aggregate swing to be distributed across the districts or states (or smaller units such as counties) as a function of previous vote share (and perhaps, other factors)?'' In the electoral systems and political party literatures there have been two main answers to that question: uniform swing and proportional swing. Our main theoretical contributions are (a) to provide an axiomatic foundation for desirable properties of a model of inter-election changes in vote shares in a districted legislature; (b) to use those axioms to demonstrate why using uniform swing or proportional swing is a bad idea, (c) to provide a reasonably simple swing model that does satisfy the axioms, and (d) to show how to integrate a reversion to the mean effect into models of inter-election swing. Our main empirical contributions address the question of why, despite their theoretical flaws, there is strong evidence that the two standard models, especially uniform swing, provide a very good fit to empirical data. We show that these models can be expected to work well when (a) elections are close, or (b) when we restrict ourselves to data where swing is low, or (c) when we eliminate the cases where the model is most likely to go wrong. In particular, sometimes the model tested is not the standard model; in that either (c1) a piecewise or truncated variant of the model is being used, or (c2) there is a correction (usually 75%) for districts that are uncontested. As we show empirically with data from U.S. congressional elections, either of these corrections will at least marginally improve fit on one or more of five indicators: mistakes about directionality of change, mistakes in winner, estimates that are outside the [0..1] bounds, mean-square error, and correlation between actual and predicted values. We also show that our new model provides an equal or better fit to U.S. congressional data than the traditional models, while having much nicer axiomatic properties.\",\"keywords\":\"electoral systems\",\"url_paper\":\"https://markcwilson.site/Research/Outputs/GrWi2020.pdf\",\"url_slides\":\"https://www.youtube.com/watch?v=C0eIF1oAk-U\",\"year\":\"2022\",\"bibtex\":\"@Article{GrWi2020,\\n  author     = {Grofman, Bernard N. and Wilson, Mark C.},\\n  title      = {Models of inter-election change in partisan vote share},\\n  pages      = {481--498},\\n  volume\\t = {34},\\n  issue      = {4},\\n  journal    = {J. Theoretical Politics},\\n  abstract   = {Consider an election of a given type (say a legislative or presidential\\nelection) involving some set of districts for which we have data at two\\ndistinct points in time, time 1 and time 2. If there are only two\\npolitical parties, A and B, we may think of the overall difference in\\nthe mean party vote share of party A between the two elections as the\\naggregate inter-election swing between the two parties.  If we know this\\nmean inter-election swing, the question we seek to answer is: ``How do\\nwe expect the aggregate swing to be distributed across the districts or\\nstates (or smaller units such as counties) as a function of previous\\nvote share (and perhaps, other factors)?''\\n\\nIn the electoral systems and political party literatures there have been\\ntwo main answers to that question: uniform swing and  proportional\\nswing. Our main theoretical contributions are (a) to provide an\\naxiomatic foundation  for desirable properties of a model of\\ninter-election changes in vote shares in a districted legislature; (b)\\nto use those axioms to demonstrate why using uniform swing or\\nproportional swing is a bad idea, (c) to provide a reasonably simple\\nswing model that does satisfy the axioms, and (d) to show how to\\nintegrate a reversion to the mean effect into models of inter-election\\nswing.\\n\\nOur main empirical contributions address the question of why, despite\\ntheir theoretical flaws, there is strong evidence that the two standard\\nmodels, especially uniform swing, provide a very good fit to empirical\\ndata.  We show that these models can be expected to work well when (a)\\nelections are close, or (b) when we restrict ourselves to data where\\nswing is low, or  (c) when we eliminate the cases where the model is\\nmost likely to go wrong. In particular, sometimes the model tested is\\nnot the standard model; in that either (c1) a piecewise or truncated\\nvariant of the model is being used,  or (c2) there is a correction\\n(usually 75\\\\%) for districts that are uncontested.  As we show\\nempirically with data from U.S. congressional elections, either of these\\ncorrections will at least marginally  improve fit on one or more of five\\nindicators: mistakes about directionality of change, mistakes in winner,\\nestimates that are outside the [0..1] bounds, mean-square error, and\\ncorrelation between actual and predicted values. We also show that our\\nnew model provides an equal or better fit to U.S. congressional data\\nthan the traditional models, while having much nicer axiomatic\\nproperties.},\\n  keywords   = {electoral systems},\\n  url_paper  = {https://markcwilson.site/Research/Outputs/GrWi2020.pdf},\\n  url_slides = {https://www.youtube.com/watch?v=C0eIF1oAk-U},\\n  year       = {2022},\\n}\\n\\n\",\"author_short\":[\"Grofman, B. N.\",\"Wilson, M. C.\"],\"key\":\"GrWi2020\",\"id\":\"GrWi2020\",\"bibbaseid\":\"grofman-wilson-modelsofinterelectionchangeinpartisanvoteshare-2022\",\"role\":\"author\",\"urls\":{\" paper\":\"https://markcwilson.site/Research/Outputs/GrWi2020.pdf\",\" slides\":\"https://www.youtube.com/watch?v=C0eIF1oAk-U\"},\"keyword\":[\"electoral systems\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":10,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Greenwood\"],\"firstnames\":[\"Torin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Melczer\"],\"firstnames\":[\"Stephen\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ruza\"],\"firstnames\":[\"Tiadora\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Séminaire Lotharingien de Combinatoire\",\"abstract\":\"We present a strategy for computing asymptotics of coefficients of $d$-variate algebraic generating functions. Using known constructions, we embed the coefficient array into an array represented by a rational generating functions in $d+1$ variables, and then apply ACSV theory to analyse the latter. This method allows us to give systematic results in the multivariate case, seems more promising than trying to derive analogs of the rational ACSV theory for algebraic GFs, and gives the prospect of further improvements as embedding methods are studied in more detail.\",\"title\":\"Asymptotics of coefficients of algebraic series via embedding into rational series (extended abstract)\",\"year\":\"2022\",\"pages\":\"12pp\",\"volume\":\"86B\",\"keywords\":\"ACSV applications, ACSV theory\",\"url_paper\":\"https://www.emis.de/journals/SLC/wpapers/FPSAC2022/30.pdf\",\"url_slides\":\"\",\"bibtex\":\"@Article{GMRW2022,\\nauthor = {Greenwood, Torin and Melczer, Stephen and Ruza, Tiadora and Wilson, Mark C.},\\njournal = {S\\\\'{e}minaire Lotharingien de Combinatoire},\\nabstract = {We present a strategy for computing asymptotics of coefficients of\\n$d$-variate algebraic generating functions. Using known constructions,\\nwe embed the coefficient array into an array represented by a rational\\ngenerating functions in $d+1$ variables, and then apply ACSV theory to\\nanalyse the latter. This method allows us to give systematic results in\\nthe multivariate case, seems more promising than trying to derive\\nanalogs of the rational ACSV theory for algebraic GFs, and gives the\\nprospect of further improvements as embedding methods are studied in\\nmore detail.},\\ntitle = {Asymptotics of coefficients of algebraic series via embedding into rational series (extended abstract)},\\nyear = {2022},\\npages = {12pp},\\nvolume = {86B}, \\nkeywords={ACSV applications, ACSV theory},\\nurl_paper = {https://www.emis.de/journals/SLC/wpapers/FPSAC2022/30.pdf},\\nurl_slides = {},\\n}\\n\\n\",\"author_short\":[\"Greenwood, T.\",\"Melczer, S.\",\"Ruza, T.\",\"Wilson, M. C.\"],\"key\":\"GMRW2022\",\"id\":\"GMRW2022\",\"bibbaseid\":\"greenwood-melczer-ruza-wilson-asymptoticsofcoefficientsofalgebraicseriesviaembeddingintorationalseriesextendedabstract-2022\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.emis.de/journals/SLC/wpapers/FPSAC2022/30.pdf\",\" slides\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"ACSV applications\",\"ACSV theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"DiPilla\"],\"firstnames\":[\"Morgan\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"title\":\"New algorithms for school choice\",\"pages\":\"8pp\",\"journal\":\"\",\"abstract\":\"Algorithms for the school choice problem have been widely studied. A small number of algorithms for producing a solution dominate the literature, for example Serial Dictatorship (SD) and the Deferred Acceptance (DA) algorithm. One main reason for the dominance of these algorithms is their good (worst-case) axiomatic behaviour with respect to notions of Pareto efficiency, justified envy and manipulation. However if we shift the focus to fairness, social welfare, the inevitable tradeoffs between incompatible axioms, and average-case analysis, it is far from clear that these algorithms are the last word. We introduce a 6-parameter family of 40 inequivalent algorithms derived from DA, most of which have not appeared (to our knowledge) in the literature before. The family includes SD and the naive and adaptive versions of the Boston mechanism, the most commonly used school choice algorithm other than SD and DA. We investigate agent welfare, order bias and stability via numerical simulation, under the assumption of truthful preferences. We find that some of the new algorithms are worthy of much more study. In particular, when we consider order bias, some of the new algorithms clearly outperform the classic ones, while losing almost nothing in stability and utilitarian welfare.\",\"keywords\":\"social choice, assignment\",\"url_paper\":\"https://markcwilson.site/Research/Outputs/DiWi2021.pdf\",\"url_slides\":\"\",\"year\":\"2021\",\"bibtex\":\"@Article{DiWi2021,\\n  author     = {DiPilla, Morgan and Wilson, Mark C.},\\n  title      = {New algorithms for school choice},\\n  pages      = {8pp},\\n  journal    = {},\\n  abstract   = {Algorithms for the school choice problem have been widely studied. A\\nsmall number of algorithms for producing a solution dominate the\\nliterature, for example Serial Dictatorship (SD) and the Deferred\\nAcceptance (DA) algorithm. One main reason for the dominance of these\\nalgorithms is their good (worst-case) axiomatic behaviour with respect\\nto notions of Pareto efficiency, justified envy and manipulation.\\nHowever if we shift the focus to fairness, social welfare, the\\ninevitable tradeoffs between incompatible axioms, and average-case\\nanalysis, it is far from clear that these algorithms are the last word.\\n\\nWe introduce a 6-parameter family of 40 inequivalent algorithms derived\\nfrom DA, most of which have not appeared (to our knowledge) in the\\nliterature before. The family includes SD and the naive and adaptive\\nversions of the Boston mechanism, the most commonly used school choice\\nalgorithm other than SD and DA. We investigate agent welfare, order bias\\nand stability via numerical simulation, under the assumption of truthful\\npreferences. We find that some of the new algorithms are worthy of much\\nmore study. In particular, when we consider order bias, some of the new\\nalgorithms clearly outperform the classic ones, while losing almost\\nnothing in stability and utilitarian welfare.}, \\n  keywords   = {social choice, assignment},\\n  url_paper  = {https://markcwilson.site/Research/Outputs/DiWi2021.pdf},\\n  url_slides = {},\\n  year       = {2021},\\n}\\n\\n\\n\",\"author_short\":[\"DiPilla, M.\",\"Wilson, M. C.\"],\"key\":\"DiWi2021\",\"id\":\"DiWi2021\",\"bibbaseid\":\"dipilla-wilson-newalgorithmsforschoolchoice-2021\",\"role\":\"author\",\"urls\":{\" paper\":\"https://markcwilson.site/Research/Outputs/DiWi2021.pdf\",\" slides\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"social choice\",\"assignment\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":12,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Journal of Scholarly Publishing\",\"title\":\"Reassembling Scholarly Communications: Histories, Infrastructures, and Global Politics of Open Access by Martin Paul Eve and Jonathan Gray\",\"year\":\"2021\",\"number\":\"3\",\"pages\":\"190-192\",\"volume\":\"52\",\"keywords\":\"publication reform,scholarly communication\",\"doi\":\"10.3138/jsp.52.3.05\",\"eprint\":\"https://doi.org/10.3138/jsp.52.3.05\",\"url\":\"https://doi.org/10.3138/jsp.52.3.05\",\"bibtex\":\"@Article{Wils2021,\\n  author  = {Wilson, Mark C.},\\n  journal = {Journal of Scholarly Publishing},\\n  title   = {Reassembling Scholarly Communications: Histories, Infrastructures, and Global Politics of Open Access by Martin Paul Eve and Jonathan Gray},\\n  year    = {2021},\\n  number  = {3},\\n  pages   = {190-192},\\n  volume  = {52},\\n  keywords = {publication reform,scholarly communication},\\n  doi     = {10.3138/jsp.52.3.05},\\n  eprint  = {https://doi.org/10.3138/jsp.52.3.05},\\n  url     = {https://doi.org/10.3138/jsp.52.3.05},\\n}\\n\\n\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"Wils2021\",\"id\":\"Wils2021\",\"bibbaseid\":\"wilson-reassemblingscholarlycommunicationshistoriesinfrastructuresandglobalpoliticsofopenaccessbymartinpauleveandjonathangray-2021\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://doi.org/10.3138/jsp.52.3.05\"},\"keyword\":[\"publication reform\",\"scholarly communication\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Freeman\"],\"firstnames\":[\"Rupert\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Pritchard\"],\"firstnames\":[\"Geoffrey\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"\",\"abstract\":\"We introduce a new fairness criterion, order symmetry, for assignment mechanisms that match $n$ objects to $n$ agents with ordinal preferences over the objects. An assignment mechanism is order symmetric with respect to some probability measure over preference profiles if every agent is equally likely to receive their favorite object, every agent is equally likely to receive their second favorite, and so on. When associated with a sufficiently symmetric probability measure, order symmetry is a relaxation of anonymity that, crucially, can be satisfied by discrete assignment mechanisms. Furthermore, it can be achieved without sacrificing other desirable axiomatic properties satisfied by existing mechanisms. In particular, we show that it can be achieved in conjunction with strategyproofness and ex post efficiency via the top trading cycles mechanism (but not serial dictatorship). We additionally design a novel mechanism that is both order symmetric and ordinally efficient. The practical utility of order symmetry is substantiated by simulations on Impartial Culture and Mallows-distributed preferences for four common assignment mechanisms.\",\"title\":\"Order Symmetry: a new fairness criterion for assignment algorithms\",\"year\":\"2021\",\"number\":\"\",\"pages\":\"44pp\",\"volume\":\"\",\"doi\":\"\",\"keywords\":\"social choice,assignment\",\"url_paper\":\"https://osf.io/preprints/socarxiv/xt37c/\",\"url_slides\":\"https://www.youtube.com/watch?v=qdyEspDXa90&list=PLKz9ISqcKAGCKccL_XdTCfo7WBRGMS21i&index=5\",\"bibtex\":\"@Article{FrPW2021,\\n  author  = {Freeman, Rupert and Pritchard, Geoffrey and Wilson, Mark C.},\\n  journal = {},\\n  abstract  = {We introduce a new fairness criterion, order symmetry, for\\nassignment mechanisms that match $n$ objects to $n$ agents with ordinal\\npreferences over the objects. An assignment mechanism is order symmetric\\nwith respect to some probability measure over preference profiles if\\nevery agent is equally likely to receive their favorite object, every\\nagent is equally likely to receive their second favorite, and so on.\\nWhen associated with a sufficiently symmetric probability measure, order\\nsymmetry is a relaxation of anonymity that, crucially, can be satisfied\\nby discrete assignment mechanisms. Furthermore, it can be achieved\\nwithout sacrificing other desirable axiomatic properties satisfied by\\nexisting mechanisms. In particular, we show that it can be achieved in\\nconjunction with strategyproofness and ex post efficiency via the top\\ntrading cycles mechanism (but not serial dictatorship). We additionally\\ndesign a novel mechanism that is both order symmetric and ordinally\\nefficient. The practical utility of order symmetry is substantiated by\\nsimulations on Impartial Culture and Mallows-distributed preferences for \\nfour common assignment mechanisms.},\\n  title   = {Order Symmetry: a new fairness criterion for assignment algorithms},\\n  year    = {2021},\\n  number  = {},\\n  pages   = {44pp},\\n  volume  = {},\\n  doi     = {},\\n  keywords = {social choice,assignment},\\n  url_paper = {https://osf.io/preprints/socarxiv/xt37c/},\\n  url_slides = {https://www.youtube.com/watch?v=qdyEspDXa90&list=PLKz9ISqcKAGCKccL_XdTCfo7WBRGMS21i&index=5},\\n}\\n\\n\",\"author_short\":[\"Freeman, R.\",\"Pritchard, G.\",\"Wilson, M. C.\"],\"key\":\"FrPW2021\",\"id\":\"FrPW2021\",\"bibbaseid\":\"freeman-pritchard-wilson-ordersymmetryanewfairnesscriterionforassignmentalgorithms-2021\",\"role\":\"author\",\"urls\":{\" paper\":\"https://osf.io/preprints/socarxiv/xt37c/\",\" slides\":\"https://www.youtube.com/watch?v=qdyEspDXa90&list=PLKz9ISqcKAGCKccL_XdTCfo7WBRGMS21i&index=5\"},\"keyword\":[\"social choice\",\"assignment\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":14,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Quiver asymptotics: free chiral ring\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ramgoolam\"],\"firstnames\":[\"Sanjaye\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zahabi\"],\"firstnames\":[\"Ali\"],\"suffixes\":[]}],\"journal\":\"Journal of Physics A: Mathematical and Theoretical\",\"volume\":\"53\",\"number\":\"10\",\"pages\":\"105401\",\"year\":\"2020\",\"publisher\":\"IOP Publishing\",\"keywords\":\"ACSV applications\",\"url_paper\":\"https://iopscience.iop.org/article/10.1088/1751-8121/ab6fc6/pdf\",\"abstract\":\"The large N generating functions for the counting of chiral operators in $\\\\mathcal{N} = 1$, four-dimensional quiver gauge theories have previously been obtained in terms of the weighted adjacency matrix of the quiver diagram. We introduce the methods of multi-variate asymptotic analysis to study this counting in the limit of large charges. We describe a Hagedorn phase transition associated with this asymptotics, which refines and generalizes known results on the 2-matrix harmonic oscillator. Explicit results are obtained for two infinite classes of quiver theories, namely the generalized clover quivers and affine $ℂ^3 ∖ Â_n$ orbifold quivers.\",\"bibtex\":\"@article{ramgoolam2020quiver,\\n  title={Quiver asymptotics: free chiral ring},\\n  author={Ramgoolam, Sanjaye and Wilson, Mark C and Zahabi, Ali},\\n  journal={Journal of Physics A: Mathematical and Theoretical},\\n  volume={53},\\n  number={10},\\n  pages={105401},\\n  year={2020},\\n  publisher={IOP Publishing},\\n  keywords={ACSV applications},\\n  url_Paper={https://iopscience.iop.org/article/10.1088/1751-8121/ab6fc6/pdf},\\n  abstract={The large N generating functions for the counting of chiral operators in\\n$\\\\mathcal{N} = 1$, four-dimensional quiver gauge theories have\\npreviously been obtained in terms of the weighted adjacency matrix of\\nthe quiver diagram. We introduce the methods of multi-variate asymptotic\\nanalysis to study this counting in the limit of large charges. We\\ndescribe a Hagedorn phase transition associated with this asymptotics,\\nwhich refines and generalizes known results on the 2-matrix harmonic\\noscillator. Explicit results are obtained for two infinite classes of\\nquiver theories, namely the generalized clover quivers and affine\\n$\\\\mathbb{C}^3 \\\\setminus \\\\hat{A}_n$ orbifold quivers.}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Ramgoolam, S.\",\"Wilson, M. C\",\"Zahabi, A.\"],\"key\":\"ramgoolam2020quiver\",\"id\":\"ramgoolam2020quiver\",\"bibbaseid\":\"ramgoolam-wilson-zahabi-quiverasymptoticsfreechiralring-2020\",\"role\":\"author\",\"urls\":{\" paper\":\"https://iopscience.iop.org/article/10.1088/1751-8121/ab6fc6/pdf\"},\"keyword\":[\"ACSV applications\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Aref\"],\"firstnames\":[\"Samin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Mason\"],\"firstnames\":[\"Andrew\",\"J\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"title\":\"A modeling and computational study of the frustration index in signed networks\",\"number\":\"1\",\"pages\":\"95-110\",\"volume\":\"75\",\"abstract\":\"Computing the frustration index of a signed graph is a key step toward solving problems in many fields including social networks, political science, physics, chemistry, and biology. The frustration index determines the distance of a network from a state of total structural balance. Although the definition of the frustration index goes back to the 1950's, its exact algorithmic computation, which is closely related to classic NP-hard graph problems, has only become a focus in recent years. We develop three new binary linear programming models to compute the frustration index exactly and efficiently as the solution to a global optimisation problem. Solving the models with prioritised branching and valid inequalities in Gurobi, we can compute the frustration index of real signed networks with over 15000 edges in less than a minute on inexpensive hardware. We provide extensive performance analysis for both random and real signed networks and show that our models outperform all existing approaches by large factors. Based on solve time, algorithm output, and effective branching factor we highlight the superiority of our models to both exact and heuristic methods in the literature.\",\"journal\":\"Networks\",\"keywords\":\"network science, computation, graphs\",\"publisher\":\"Wiley\",\"url_paper\":\"https://arxiv.org/abs/1611.09030\",\"year\":\"2020\",\"bibtex\":\"@Article{aref2020modeling,\\n  author    = {Aref, Samin and Mason, Andrew J and Wilson, Mark C.},\\n  title     = {A modeling and computational study of the frustration index in signed networks},\\n  number    = {1},\\n  pages     = {95-110},\\n  volume    = {75},\\n  abstract  = {Computing the frustration index of a signed graph is a key step toward\\nsolving problems in many fields including social networks, political\\nscience, physics, chemistry, and biology. The frustration index\\ndetermines the distance of a network from a state of total structural\\nbalance. Although the definition of the frustration index goes back to\\nthe 1950's, its exact algorithmic computation, which is closely related\\nto classic NP-hard graph problems, has only become a focus in recent\\nyears. We develop three new binary linear programming models to compute\\nthe frustration index exactly and efficiently as the solution to a\\nglobal optimisation problem. Solving the models with prioritised\\nbranching and valid inequalities in Gurobi, we can compute the\\nfrustration index of real signed networks with over 15000 edges in less\\nthan a minute on inexpensive hardware. We provide extensive performance\\nanalysis for both random and real signed networks and show that our\\nmodels outperform all existing approaches by large factors. Based on\\nsolve time, algorithm output, and effective branching factor we\\nhighlight the superiority of our models to both exact and heuristic\\nmethods in the literature.},\\n  journal   = {Networks},\\n  keywords  = {network science, computation, graphs},\\n  publisher = {Wiley},\\n  url_paper = {https://arxiv.org/abs/1611.09030},\\n  year      = {2020},\\n}\\n\\n\",\"author_short\":[\"Aref, S.\",\"Mason, A. J\",\"Wilson, M. C.\"],\"key\":\"aref2020modeling\",\"id\":\"aref2020modeling\",\"bibbaseid\":\"aref-mason-wilson-amodelingandcomputationalstudyofthefrustrationindexinsignednetworks-2020\",\"role\":\"author\",\"urls\":{\" paper\":\"https://arxiv.org/abs/1611.09030\"},\"keyword\":[\"network science\",\"computation\",\"graphs\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Information extraction framework to build legislation network\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sakhaee\"],\"firstnames\":[\"Neda\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Artificial Intelligence and Law\",\"pages\":\"1-24\",\"year\":\"2020\",\"publisher\":\"Springer Netherlands\",\"keywords\":\"network science\",\"url_paper\":\"https://link.springer.com/content/pdf/10.1007/s10506-020-09263-3.pdf\",\"abstract\":\"This paper concerns an Information Extraction process for building a dynamic Legislation Network from legal documents. Unlike supervised learning approaches which require additional calculations, the idea here is to apply Information Extraction methodologies by identifying distinct expressions in legal text and extract quality network information. The study highlights the importance of data accuracy in network analysis and improves approximate string matching techniques for producing reliable network datasets with more than 98 percent precision and recall. The values, applications, and the complexity of the created dynamic Legislation Network are also discussed and challenged.\",\"bibtex\":\"@article{sakhaee2020information,\\n  title={Information extraction framework to build legislation network},\\n  author={Sakhaee, Neda and Wilson, Mark C.},\\n  journal={Artificial Intelligence and Law},\\n  pages={1-24},\\n  year={2020},\\n  publisher={Springer Netherlands},\\n  keywords={network science},\\n  url_Paper={https://link.springer.com/content/pdf/10.1007/s10506-020-09263-3.pdf},\\n  abstract={This paper concerns an Information Extraction process for building a\\ndynamic Legislation Network from legal documents. Unlike supervised\\nlearning approaches which require additional calculations, the idea here\\nis to apply Information Extraction methodologies by identifying distinct\\nexpressions in legal text and extract quality network information. The\\nstudy highlights the importance of data accuracy in network analysis and\\nimproves approximate string matching techniques for producing reliable\\nnetwork datasets with more than 98 percent precision and recall. The\\nvalues, applications, and the complexity of the created dynamic\\nLegislation Network are also discussed and challenged.}\\n}\\n\\n\",\"author_short\":[\"Sakhaee, N.\",\"Wilson, M. C.\"],\"key\":\"sakhaee2020information\",\"id\":\"sakhaee2020information\",\"bibbaseid\":\"sakhaee-wilson-informationextractionframeworktobuildlegislationnetwork-2020\",\"role\":\"author\",\"urls\":{\" paper\":\"https://link.springer.com/content/pdf/10.1007/s10506-020-09263-3.pdf\"},\"keyword\":[\"network science\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Non-cumulative measures of researcher citation impact\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Tang\"],\"firstnames\":[\"Zhou\"],\"suffixes\":[]}],\"journal\":\"Quantitative Science Studies\",\"volume\":\"\",\"number\":\"\",\"pages\":\"11pp\",\"year\":\"2020\",\"publisher\":\"\",\"keywords\":\"scientometrics\",\"url_paper\":\"https://www.mitpressjournals.org/doi/pdf/10.1162/qss_a_00074\",\"url_slides\":\"https://www.youtube.com/watch?v=6bmh-u9biUc\",\"abstract\":\"The most commonly used publication metrics for individual researchers are the the total number of publications, the total number of citations, and Hirsch’s $h$-index. Each of these is cumulative, and hence increases throughout a researcher’s career, making it less suitable for evaluation of junior researchers or assessing recent impact. Most other author-level measures in the literature share this cumulative property. By contrast, we aim to study non-cumulative measures that answer the question “in terms of citation impact, what have you done lately?” We single out six measures from the rather sparse literature, including Hirsch’s $m$-index, a time-scaled version of the $h$-index. We introduce new measures based on the idea of “citation acceleration”. After presenting several axioms for non-cumulative measures, we conclude that one of our new measures has much better theoretical justification. We present a small-scale study of its performance on real data and conclude that it shows substantial promise for future use.\",\"bibtex\":\"@article{WiZh2020,\\n  title={Non-cumulative measures of researcher citation impact},\\n  author={Wilson, Mark C. and Tang, Zhou},\\n  journal={Quantitative Science Studies},\\n  volume={},\\n  number={},\\n  pages={11pp},\\n  year={2020},\\n  publisher={},\\n  keywords={scientometrics},\\n  url_Paper={https://www.mitpressjournals.org/doi/pdf/10.1162/qss_a_00074},\\n  url_Slides={https://www.youtube.com/watch?v=6bmh-u9biUc},\\n  abstract={The most commonly used publication metrics for individual researchers\\nare the the total number of publications, the total number of citations,\\nand Hirsch’s $h$-index. Each of these is cumulative, and hence increases\\nthroughout a researcher’s career, making it less suitable for evaluation\\nof junior researchers or assessing recent impact. Most other\\nauthor-level measures in the literature share this cumulative property.\\nBy contrast, we aim to study non-cumulative measures that answer the\\nquestion “in terms of citation impact, what have you done lately?” We\\nsingle out six measures from the rather sparse literature, including\\nHirsch’s $m$-index, a time-scaled version of the $h$-index. We introduce\\nnew measures based on the idea of “citation acceleration”. After\\npresenting several axioms for non-cumulative measures, we conclude that\\none of our new measures has much better theoretical justification. We\\npresent a small-scale study of its performance on real data and conclude\\nthat it shows substantial promise for future use.}\\n}\\n\\n\\n\",\"author_short\":[\"Wilson, M. C.\",\"Tang, Z.\"],\"key\":\"WiZh2020\",\"id\":\"WiZh2020\",\"bibbaseid\":\"wilson-tang-noncumulativemeasuresofresearchercitationimpact-2020\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.mitpressjournals.org/doi/pdf/10.1162/qss_a_00074\",\" slides\":\"https://www.youtube.com/watch?v=6bmh-u9biUc\"},\"keyword\":[\"scientometrics\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Research publishing for the nonexpert\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"New Zealand Mathematical Society Newsletter\",\"year\":\"2019\",\"volume\":\"137\",\"pages\":\"14-18\",\"publisher\":\"\",\"keywords\":\"publication reform, advocacy\",\"url_paper\":\"https://markcwilson.site/Research/Outputs/oa_dummies.pdf\",\"abstract\":\"\",\"bibtex\":\"@article{wilson2019dummies,\\n  title={Research publishing for the nonexpert},\\n  author={Wilson, Mark C.},\\n  journal={New Zealand Mathematical Society Newsletter},\\n  year={2019},\\n  volume={137},\\n  pages={14-18},\\n  publisher={},\\n    keywords={publication reform, advocacy},\\n  url_Paper={https://markcwilson.site/Research/Outputs/oa_dummies.pdf},\\n  abstract={}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson2019dummies\",\"id\":\"wilson2019dummies\",\"bibbaseid\":\"wilson-researchpublishingforthenonexpert-2019\",\"role\":\"author\",\"urls\":{\" paper\":\"https://markcwilson.site/Research/Outputs/oa_dummies.pdf\"},\"keyword\":[\"publication reform\",\"advocacy\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":5,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"incollection\",\"title\":\"Inputs, Algorithms, Quality Measures: More Realistic Simulation in Social Choice\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"booktitle\":\"The Future of Economic Design\",\"pages\":\"165-171\",\"year\":\"2019\",\"publisher\":\"Springer, Cham\",\"keywords\":\"social choice, simulation\",\"url_paper\":\"https://markcwilson.site/Research/Outputs/FED.pdf\",\"abstract\":\"Much of my research deals with trying to evaluate the performance of social choice \\\\emphalgorithms via simulations, which requires appropriate \\\\emphinputs and \\\\emphquality measures. All three areas offer substantial scope for improvement in the coming years. For concreteness and because of my own limited experience, I focus on the allocation of indivisible goods and on voting, although many of the ideas are more broadly applicable.\",\"bibtex\":\"@incollection{wilson2019inputs,\\n  title={Inputs, Algorithms, Quality Measures: More Realistic Simulation in Social Choice},\\n  author={Wilson, Mark C.},\\n  booktitle={The Future of Economic Design},\\n  pages={165-171},\\n  year={2019},\\n  publisher={Springer, Cham},\\n  keywords={social choice, simulation},\\n  url_Paper={https://markcwilson.site/Research/Outputs/FED.pdf},\\n  abstract={Much of my research deals with trying to evaluate the performance of\\nsocial choice \\\\emph{algorithms} via simulations, which requires\\nappropriate \\\\emph{inputs} and \\\\emph{quality measures}. All three areas\\noffer substantial scope for improvement in the coming years. For\\nconcreteness and because of my own limited experience, I focus on the\\nallocation of indivisible goods and on voting, although many of the\\nideas are more broadly applicable.}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson2019inputs\",\"id\":\"wilson2019inputs\",\"bibbaseid\":\"wilson-inputsalgorithmsqualitymeasuresmorerealisticsimulationinsocialchoice-2019\",\"role\":\"author\",\"urls\":{\" paper\":\"https://markcwilson.site/Research/Outputs/FED.pdf\"},\"keyword\":[\"social choice\",\"simulation\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Balance and frustration in signed networks\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Aref\"],\"firstnames\":[\"Samin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Journal of Complex Networks\",\"volume\":\"7\",\"number\":\"2\",\"pages\":\"163-189\",\"year\":\"2019\",\"publisher\":\"Oxford University Press\",\"keywords\":\"network science, graphs\",\"url_paper\":\"https://academic.oup.com/comnet/article-abstract/7/2/163/5074195\",\"abstract\":\"The frustration index is a key measure for analysing signed networks, which has been underused due to its computational complexity. We use an exact optimisation-based method to analyse frustration as a global structural property of signed networks coming from diverse application areas. In the classic friend-enemy interpretation of balance theory, a by-product of computing the frustration index is the partitioning of nodes into two internally solidary but mutually hostile groups. The main purpose of this paper is to present general methodology for answering questions related to partial balance in signed networks, and apply it to a range of representative examples that are now analysable because of advances in computational methods. We provide exact numerical results on social and biological signed networks, networks of formal alliances and antagonisms between countries, and financial portfolio networks. Molecular graphs of carbon and Ising models are also considered. We point out several mistakes in the signed networks literature caused by inaccurate computation, implementation errors or inappropriate measures.\",\"bibtex\":\"@article{aref2019balance,\\n  title={Balance and frustration in signed networks},\\n  author={Aref, Samin and Wilson, Mark C.},\\n  journal={Journal of Complex Networks},\\n  volume={7},\\n  number={2},\\n  pages={163-189},\\n  year={2019},\\n  publisher={Oxford University Press},\\n  keywords={network science, graphs},\\n  url_Paper= {https://academic.oup.com/comnet/article-abstract/7/2/163/5074195},\\n  abstract={The frustration index is a key measure for analysing signed networks,\\nwhich has been underused due to its computational complexity. We use an\\nexact optimisation-based method to analyse frustration as a global\\nstructural property of signed networks coming from diverse application\\nareas. In the classic friend-enemy interpretation of balance theory, a\\nby-product of computing the frustration index is the partitioning of\\nnodes into two internally solidary but mutually hostile groups. The main\\npurpose of this paper is to present general methodology for answering\\nquestions related to partial balance in signed networks, and apply it to\\na range of representative examples that are now analysable because of\\nadvances in computational methods. We provide exact numerical results on\\nsocial and biological signed networks, networks of formal alliances and\\nantagonisms between countries, and financial portfolio networks.\\nMolecular graphs of carbon and Ising models are also considered. We\\npoint out several mistakes in the signed networks literature caused by\\ninaccurate computation, implementation errors or inappropriate\\nmeasures.}\\n}\\n\\n\",\"author_short\":[\"Aref, S.\",\"Wilson, M. C.\"],\"key\":\"aref2019balance\",\"id\":\"aref2019balance\",\"bibbaseid\":\"aref-wilson-balanceandfrustrationinsignednetworks-2019\",\"role\":\"author\",\"urls\":{\" paper\":\"https://academic.oup.com/comnet/article-abstract/7/2/163/5074195\"},\"keyword\":[\"network science\",\"graphs\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Melczer\"],\"firstnames\":[\"Stephen\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"title\":\"Higher dimensional lattice walks: Connecting combinatorial and analytic behavior\",\"number\":\"4\",\"pages\":\"2140-2174\",\"volume\":\"33\",\"abstract\":\"We consider the enumeration of walks on the non-negative lattice $ℕ^d$, with steps defined by a set $\\\\mathcal{S} ⊂ \\\\{ -1, 0, 1 \\\\}^d ∖ \\\\{\\\\mathbf{0}\\\\}$. Previous work in this area has established asymptotics for the number of walks in certain families of models by applying the techniques of analytic combinatorics in several variables (ACSV), where one encodes the generating function of a lattice path model as the diagonal of a multivariate rational function. Melczer and Mishna obtained asymptotics when the set of steps $\\\\mathcal{S}$ is symmetric over every axis; in this setting one can always apply the methods of ACSV to a multivariate rational function whose set of singularities is a smooth manifold (the simplest case). Here we go further, providing asymptotics for models with generating functions that must be encoded by multivariate rational functions having non-smooth singular sets. In the process, our analysis connects past work to deeper structural results in the theory of analytic combinatorics in several variables. One application is a closed form for asymptotics of models defined by step sets that are symmetric over all but one axis. As a special case, we apply our results when $d=2$ to give a rigorous proof of asymptotics conjectured by Bostan and Kauers; asymptotics for walks returning to boundary axes and the origin are also given.\",\"journal\":\"SIAM Journal on Discrete Mathematics\",\"keywords\":\"ACSV applications\",\"publisher\":\"Society for Industrial and Applied Mathematics\",\"url_paper\":\"https://arxiv.org/abs/1810.06170\",\"url_slides\":\"https://www.youtube.com/watch?v=o5SOHJbGO4g\",\"year\":\"2019\",\"bibtex\":\"@Article{melczer2019higher,\\n  author     = {Melczer, Stephen and Wilson, Mark C.},\\n  title      = {Higher dimensional lattice walks: Connecting combinatorial and analytic behavior},\\n  number     = {4},\\n  pages      = {2140-2174},\\n  volume     = {33},\\n  abstract   = {We consider the enumeration of walks on the non-negative lattice\\n$\\\\mathbb{N}^d$, with steps defined by a set $\\\\mathcal{S} \\\\subset \\\\{ -1,\\n0, 1 \\\\}^d \\\\setminus \\\\{\\\\mathbf{0}\\\\}$. Previous work in this area has\\nestablished asymptotics for the number of walks in certain families of\\nmodels by applying the techniques of analytic combinatorics in several\\nvariables (ACSV), where one encodes the generating function of a lattice\\npath model as the diagonal of a multivariate rational function. Melczer\\nand Mishna obtained asymptotics when the set of steps $\\\\mathcal{S}$ is\\nsymmetric over every axis; in this setting one can always apply the\\nmethods of ACSV to a multivariate rational function whose  set of\\nsingularities is a smooth manifold (the simplest case). Here we go\\nfurther, providing asymptotics for models with generating functions that\\nmust be encoded by multivariate rational functions having non-smooth\\nsingular sets.  In the process, our analysis connects past work to\\ndeeper structural results in the theory of analytic combinatorics in\\nseveral variables.  One application is a closed form for asymptotics of\\nmodels defined by step sets that are symmetric over all but one axis. As\\na special case, we apply our results when $d=2$ to give a rigorous proof\\nof asymptotics conjectured by Bostan and Kauers; asymptotics for walks\\nreturning to boundary axes and the origin are also given.},\\n  journal    = {SIAM Journal on Discrete Mathematics},\\n  keywords   = {ACSV applications},\\n  publisher  = {Society for Industrial and Applied Mathematics},\\n  url_paper  = {https://arxiv.org/abs/1810.06170},\\n  url_slides = {https://www.youtube.com/watch?v=o5SOHJbGO4g},\\n  year       = {2019},\\n}\\n\\n\",\"author_short\":[\"Melczer, S.\",\"Wilson, M. C.\"],\"key\":\"melczer2019higher\",\"id\":\"melczer2019higher\",\"bibbaseid\":\"melczer-wilson-higherdimensionallatticewalksconnectingcombinatorialandanalyticbehavior-2019\",\"role\":\"author\",\"urls\":{\" paper\":\"https://arxiv.org/abs/1810.06170\",\" slides\":\"https://www.youtube.com/watch?v=o5SOHJbGO4g\"},\"keyword\":[\"ACSV applications\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Manipulability of consular election rules\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Ianovski\"],\"firstnames\":[\"Egor\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Social Choice and Welfare\",\"volume\":\"52\",\"number\":\"2\",\"pages\":\"363-393\",\"year\":\"2019\",\"publisher\":\"Springer Berlin Heidelberg\",\"keywords\":\"social choice, voting\",\"url_paper\":\"https://arxiv.org/abs/1611.07102\",\"url_link\":\"https://link.springer.com/article/10.1007/s00355-018-1152-2\",\"abstract\":\"The Gibbard-Satterthwaite theorem is a cornerstone of social choice theory, stating that an onto social choice function cannot be both strategy-proof and non-dictatorial if the number of alternatives is at least three. The Duggan-Schwartz theorem proves an analogue in the case of set-valued elections: if the function is onto with respect to singletons, and can be manipulated by neither an optimist nor a pessimist, it must have a weak dictator. However, the assumption that the function is onto with respect to singletons makes the Duggan-Schwartz theorem inapplicable to elections which necessarily select a committee with multiple members. In this paper we make a start on this problem by considering elections which elect a committee of size two (such as the consulship of ancient Rome). We establish that if such a \\\\emphconsular election rule cannot be expressed as the union of two disjoint social choice functions, then strategy-proofness implies the existence of a dictator. Although we suspect that a similar result holds for larger sized committees, there appear to be many obstacles to proving it, which we discuss in detail.\",\"bibtex\":\"@article{ianovski2019manipulability,\\n  title={Manipulability of consular election rules},\\n  author={Ianovski, Egor and Wilson, Mark C.},\\n  journal={Social Choice and Welfare},\\n  volume={52},\\n  number={2},\\n  pages={363-393},\\n  year={2019},\\n  publisher={Springer Berlin Heidelberg},\\n  keywords={social choice, voting},\\n  url_Paper={https://arxiv.org/abs/1611.07102},\\n  url_Link={https://link.springer.com/article/10.1007/s00355-018-1152-2},\\n  abstract={The Gibbard-Satterthwaite theorem is a cornerstone of social choice\\ntheory, stating that an onto social choice function cannot be both\\nstrategy-proof and non-dictatorial if the number of alternatives is at\\nleast three. The Duggan-Schwartz theorem proves an analogue in the case\\nof set-valued elections: if the function is onto with respect to\\nsingletons, and can be manipulated by neither an optimist nor a\\npessimist, it must have a weak dictator. However, the assumption that\\nthe function is onto with respect to singletons makes the\\nDuggan-Schwartz theorem inapplicable to elections which necessarily\\nselect a committee with multiple members. In this paper we make a start\\non this problem by considering elections which elect a committee of size\\ntwo (such as the consulship of ancient Rome). We establish that if such\\na \\\\emph{consular election rule} cannot be expressed as the union of two\\ndisjoint social choice functions, then strategy-proofness implies the\\nexistence of a dictator. Although we suspect that a similar result holds\\nfor larger sized committees, there appear to be many obstacles to\\nproving it, which we discuss in detail.}\\n}\\n\\n\",\"author_short\":[\"Ianovski, E.\",\"Wilson, M. C.\"],\"key\":\"ianovski2019manipulability\",\"id\":\"ianovski2019manipulability\",\"bibbaseid\":\"ianovski-wilson-manipulabilityofconsularelectionrules-2019\",\"role\":\"author\",\"urls\":{\" paper\":\"https://arxiv.org/abs/1611.07102\",\" link\":\"https://link.springer.com/article/10.1007/s00355-018-1152-2\"},\"keyword\":[\"social choice\",\"voting\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Distance rationalization of anonymous and homogeneous voting rules\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hadjibeyli\"],\"firstnames\":[\"Benjamin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Social Choice and Welfare\",\"volume\":\"52\",\"number\":\"3\",\"pages\":\"559-583\",\"year\":\"2019\",\"publisher\":\"Springer Berlin Heidelberg\",\"keywords\":\"social choice, voting\",\"url_paper\":\"https://link.springer.com/content/pdf/10.1007/s00355-018-1156-y.pdf\",\"abstract\":\"The concept of distance rationalizability of voting rules has been explored in recent years by several authors. Most previous work has dealt with a definition in terms of preference profiles. However, most voting rules in common use are anonymous and homogeneous. In this case there is a much more succinct representation (using the voting simplex) of the inputs to the rule. This representation has been widely used in the voting literature, but rarely in the context of distance rationalizability. Recently, the present authors showed, as a special case of general results on quotient spaces, exactly how to connect distance rationalizability on profiles for anonymous and homogeneous rules to geometry in the simplex. In this article we develop the connection for the important special case of votewise distances, recently introduced and studied by Elkind, Faliszewski and Slinko in several papers. This yields a direct interpretation in terms of well-developed mathematical topics not seen before in the voting literature, namely Kantorovich (also called Wasserstein) distances and the geometry of Minkowski spaces. As an application of this approach, we prove some positive and some negative results about the decisiveness of distance rationalizable anonymous and homogeneous rules. The positive results connect with the recent theory of hyperplane rules, while the negative ones deal with distances that are not metrics, controversial notions of consensus, and the fact that the $\\\\ell^1$-norm is not strictly convex. We expect that the above novel geometric interpretation will aid the analysis of rules defined by votewise distances, and the discovery of new rules with desirable properties.\",\"bibtex\":\"@article{hadjibeyli2019distance,\\n  title={Distance rationalization of anonymous and homogeneous voting rules},\\n  author={Hadjibeyli, Benjamin and Wilson, Mark C.},\\n  journal={Social Choice and Welfare},\\n  volume={52},\\n  number={3},\\n  pages={559-583},\\n  year={2019},\\n  publisher={Springer Berlin Heidelberg},\\n  keywords={social choice, voting},\\n  url_Paper={https://link.springer.com/content/pdf/10.1007/s00355-018-1156-y.pdf},\\n  abstract={The concept of distance rationalizability of voting rules has been\\nexplored in recent years by several authors. Most previous work has\\ndealt with a definition in terms of preference profiles. However, most\\nvoting rules in common use are anonymous and homogeneous. In this case\\nthere is a much more succinct representation (using the voting simplex)\\nof the inputs to the rule. This representation has been widely used in\\nthe voting literature, but rarely in the context of distance\\nrationalizability. Recently, the present authors showed, as a special\\ncase of general results on quotient spaces, exactly how to connect\\ndistance rationalizability on profiles for anonymous and homogeneous\\nrules to geometry in the simplex. In this article we develop the\\nconnection for the important special case of votewise distances,\\nrecently introduced and studied by Elkind, Faliszewski and Slinko in\\nseveral papers. This yields a direct interpretation in terms of\\nwell-developed mathematical topics not seen before in the voting\\nliterature, namely Kantorovich (also called Wasserstein) distances and\\nthe geometry of Minkowski spaces. As an application of this approach, we\\nprove some positive and some negative results about the decisiveness of\\ndistance rationalizable anonymous and homogeneous rules. The positive\\nresults connect with the recent theory of hyperplane rules, while the\\nnegative ones deal with distances that are not metrics, controversial\\nnotions of consensus, and the fact that the $\\\\ell^1$-norm is not\\nstrictly convex. We expect that the above novel geometric interpretation\\nwill aid the analysis of rules defined by votewise distances, and the\\ndiscovery of new rules with desirable properties.}\\n}\\n\\n\",\"author_short\":[\"Hadjibeyli, B.\",\"Wilson, M. C.\"],\"key\":\"hadjibeyli2019distance\",\"id\":\"hadjibeyli2019distance\",\"bibbaseid\":\"hadjibeyli-wilson-distancerationalizationofanonymousandhomogeneousvotingrules-2019\",\"role\":\"author\",\"urls\":{\" paper\":\"https://link.springer.com/content/pdf/10.1007/s00355-018-1156-y.pdf\"},\"keyword\":[\"social choice\",\"voting\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Free and fair open access journals: Flipping, fostering, founding\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Notices of the American Mathematical Society\",\"volume\":\"65\",\"pages\":\"817-820\",\"year\":\"2018\",\"keywords\":\"publication reform, advocacy\",\"url_paper\":\"https://www.ams.org/journals/notices/201807/rnoti-p817.pdf\",\"abstract\":\"\",\"bibtex\":\"@article{wilson2018free,\\n  title={Free and fair open access journals: Flipping, fostering, founding},\\n  author={Wilson, Mark C.},\\n  journal={Notices of the American Mathematical Society},\\n  volume={65},\\n  pages={817-820},\\n  year={2018},\\n    keywords={publication reform, advocacy},\\n  url_Paper={https://www.ams.org/journals/notices/201807/rnoti-p817.pdf},\\n  abstract={}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson2018free\",\"id\":\"wilson2018free\",\"bibbaseid\":\"wilson-freeandfairopenaccessjournalsflippingfosteringfounding-2018\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.ams.org/journals/notices/201807/rnoti-p817.pdf\"},\"keyword\":[\"publication reform\",\"advocacy\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":4,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Flipping JACO\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]},{\"propositions\":[\"van\"],\"lastnames\":[\"Maldeghem\"],\"firstnames\":[\"Hendrik\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Reiner\"],\"firstnames\":[\"Victor\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Athanasiadis\"],\"firstnames\":[\"Christos\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Munemasa\"],\"firstnames\":[\"Akihiro\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Thomas\"],\"firstnames\":[\"Hugh\"],\"suffixes\":[]}],\"journal\":\"European Mathematical Society Newsletter\",\"volume\":\"9\",\"number\":\"109\",\"pages\":\"38-41\",\"year\":\"2018\",\"keywords\":\"publication reform\",\"url_paper\":\"http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488x&vol=9&iss=109&rank=9\",\"abstract\":\"\",\"bibtex\":\"@article{wilson2018flipping,\\n  title={Flipping JACO},\\n  author={Wilson, Mark C. and van Maldeghem, Hendrik and Reiner, Victor and Athanasiadis, Christos and Munemasa, Akihiro and Thomas, Hugh},\\n  journal={European Mathematical Society Newsletter},\\n  volume={9},\\n  number={109},\\n  pages={38-41},\\n  year={2018},\\n  keywords={publication reform},\\n  url_Paper={http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488x&vol=9&iss=109&rank=9},\\n  abstract={}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\",\"van Maldeghem, H.\",\"Reiner, V.\",\"Athanasiadis, C.\",\"Munemasa, A.\",\"Thomas, H.\"],\"key\":\"wilson2018flipping\",\"id\":\"wilson2018flipping\",\"bibbaseid\":\"wilson-vanmaldeghem-reiner-athanasiadis-munemasa-thomas-flippingjaco-2018\",\"role\":\"author\",\"urls\":{\" paper\":\"http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488x&vol=9&iss=109&rank=9\"},\"keyword\":[\"publication reform\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"incollection\",\"title\":\"Computing the line index of balance using integer programming optimisation\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Aref\"],\"firstnames\":[\"Samin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Mason\"],\"firstnames\":[\"Andrew\",\"J\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Optimization Problems in Graph Theory\",\"pages\":\"65-84\",\"year\":\"2018\",\"publisher\":\"Springer, Cham\",\"keywords\":\"network science, computation, graphs\",\"url_paper\":\"https://arxiv.org/abs/1710.09876\",\"abstract\":\"An important measure of signed graphs is the line index of balance which has several applications in many fields. However, this graph-theoretic measure was underused for decades because of the inherent complexity in its computation which is closely related to solving NP-hard graph optimisation problems like MAXCUT. We develop new quadratic and linear programming models to compute the line index of balance exactly. Using the Gurobi integer programming optimisation solver, we evaluate the line index of balance on real-world and synthetic datasets. The synthetic data involves Erdős-Rényi graphs, Barabási-Albert graphs, and specially structured random graphs. We also use well known datasets from the sociology literature, such as signed graphs inferred from students' choice and rejection as well as datasets from the biology literature including gene regulatory networks. The results show that exact values of the line index of balance in relatively large signed graphs can be efficiently computed using our suggested optimisation models. We find that most real-world social networks and some biological networks have small line index of balance which indicates that they are close to balanced.\",\"bibtex\":\"@incollection{aref2018computing,\\n  title={Computing the line index of balance using integer programming optimisation},\\n  author={Aref, Samin and Mason, Andrew J and Wilson, Mark C.},\\n  booktitle={Optimization Problems in Graph Theory},\\n  pages={65-84},\\n  year={2018},\\n  publisher={Springer, Cham},\\n  keywords={network science, computation, graphs},\\n  url_Paper={https://arxiv.org/abs/1710.09876},\\n  abstract={An important measure of signed graphs is the line index of balance which\\nhas several applications in many fields. However, this graph-theoretic\\nmeasure was underused for decades because of the inherent complexity in\\nits computation which is closely related to solving NP-hard graph\\noptimisation problems like MAXCUT. We develop new quadratic and linear\\nprogramming models to compute the line index of balance exactly. Using\\nthe Gurobi integer programming optimisation solver, we evaluate the line\\nindex of balance on real-world and synthetic datasets. The synthetic\\ndata involves Erd\\\\H{o}s-R\\\\'{e}nyi graphs, Barab\\\\'{a}si-Albert graphs,\\nand specially structured random graphs. We also use well known datasets\\nfrom the sociology literature, such as signed graphs inferred from\\nstudents' choice and rejection as well as datasets from the biology\\nliterature including gene regulatory networks. The results show that\\nexact values of the line index of balance in relatively large signed\\ngraphs can be efficiently computed using our suggested optimisation\\nmodels. We find that most real-world social networks and some biological\\nnetworks have small line index of balance which indicates that they are\\nclose to balanced.}\\n}\\n\\n\",\"author_short\":[\"Aref, S.\",\"Mason, A. J\",\"Wilson, M. C.\"],\"key\":\"aref2018computing\",\"id\":\"aref2018computing\",\"bibbaseid\":\"aref-mason-wilson-computingthelineindexofbalanceusingintegerprogrammingoptimisation-2018\",\"role\":\"author\",\"urls\":{\" paper\":\"https://arxiv.org/abs/1710.09876\"},\"keyword\":[\"network science\",\"computation\",\"graphs\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Measuring partial balance in signed networks\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Aref\"],\"firstnames\":[\"Samin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Journal of Complex Networks\",\"volume\":\"6\",\"number\":\"4\",\"pages\":\"566-595\",\"year\":\"2018\",\"publisher\":\"Oxford University Press\",\"keywords\":\"network science, graphs\",\"url_paper\":\"http://arxiv.org/abs/1509.04037\",\"abstract\":\"Is the enemy of an enemy necessarily a friend? If not, to what extent does this tend to hold? Such questions were formulated in terms of signed (social) networks and necessary and sufficient conditions for a network to be ‘balanced’ were obtained around 1960. Since then the idea that signed networks tend over time to become more balanced has been widely used in several application areas. However, investigation of this hypothesis has been complicated by the lack of a standard measure of partial balance, since complete balance is almost never achieved in practice. We formalize the concept of a measure of partial balance, discuss various measures, compare the measures on synthetic datasets and investigate their axiomatic properties. The synthetic data involves Erdős-Rényi and specially structured random graphs. We show that some measures behave better than others in terms of axioms and ability to differentiate between graphs. We also use well-known data sets from the sociology and biology literature, such as Read's New Guinean tribes, gene regulatory networks related to two organisms, and a network involving senate bill co-sponsorship. Our results show that substantially different levels of partial balance is observed under cycle-based, eigenvalue-based and frustration-based measures. We make some recommendations for measures to be used in future work.\",\"bibtex\":\"@article{aref2018measuring,\\n  title={Measuring partial balance in signed networks},\\n  author={Aref, Samin and Wilson, Mark C.},\\n  journal={Journal of Complex Networks},\\n  volume={6},\\n  number={4},\\n  pages={566-595},\\n  year={2018},\\n  publisher={Oxford University Press},\\n  keywords={network science, graphs},\\n  url_Paper={http://arxiv.org/abs/1509.04037},\\n  abstract={Is the enemy of an enemy necessarily a friend? If not, to what extent\\ndoes this tend to hold? Such questions were formulated in terms of\\nsigned (social) networks and necessary and sufficient conditions for a\\nnetwork to be ‘balanced’ were obtained around 1960. Since then the idea\\nthat signed networks tend over time to become more balanced has been\\nwidely used in several application areas. However, investigation of this\\nhypothesis has been complicated by the lack of a standard measure of\\npartial balance, since complete balance is almost never achieved in\\npractice. We formalize the concept of a measure of partial balance,\\ndiscuss various measures, compare the measures on synthetic datasets and\\ninvestigate their axiomatic properties. The synthetic data involves\\nErd\\\\H{o}s-R\\\\'{e}nyi and specially structured random graphs. We show that\\nsome measures behave better than others in terms of axioms and ability\\nto differentiate between graphs. We also use well-known data sets from\\nthe sociology and biology literature, such as Read's New Guinean tribes,\\ngene regulatory networks related to two organisms, and a network\\ninvolving senate bill co-sponsorship. Our results show that\\nsubstantially different levels of partial balance is observed under\\ncycle-based, eigenvalue-based and frustration-based measures. We make\\nsome recommendations for measures to be used in future work.}\\n}\\n\\n\",\"author_short\":[\"Aref, S.\",\"Wilson, M. C.\"],\"key\":\"aref2018measuring\",\"id\":\"aref2018measuring\",\"bibbaseid\":\"aref-wilson-measuringpartialbalanceinsignednetworks-2018\",\"role\":\"author\",\"urls\":{\" paper\":\"http://arxiv.org/abs/1509.04037\"},\"keyword\":[\"network science\",\"graphs\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"misc\",\"title\":\"Universities spend millions on accessing results of publicly funded research\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"New Zealand Mathematical Society Newsletter\",\"year\":\"2017\",\"publisher\":\"The Conversation\",\"keywords\":\"publication reform, advocacy\",\"url_link\":\"\",\"abstract\":\"\",\"bibtex\":\"@misc{wilson2017conversation,\\n  title={Universities spend millions on accessing results of publicly funded research},\\n  author={Wilson, Mark C.},\\n  journal={New Zealand Mathematical Society Newsletter},\\n  year={2017},\\n  publisher={The Conversation},\\n    keywords={publication reform, advocacy},\\n  url_Link={},\\n  abstract={}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson2017conversation\",\"id\":\"wilson2017conversation\",\"bibbaseid\":\"wilson-universitiesspendmillionsonaccessingresultsofpubliclyfundedresearch-2017\",\"role\":\"author\",\"urls\":{\" link\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"publication reform\",\"advocacy\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":5,\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"misc\",\"title\":\"Fair open access: returning control of scholarly journals to their communities\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Holcombe\"],\"firstnames\":[\"Alex\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Impact of Social Sciences Blog\",\"year\":\"2017\",\"publisher\":\"London School of Economics and Political Science\",\"keywords\":\"publication reform, advocacy\",\"url_link\":\"https://blogs.lse.ac.uk/impactofsocialsciences/2017/10/23/fair-open-access-returning-control-of-scholarly-journals-to-their-communities/\",\"abstract\":\"\",\"bibtex\":\"@misc{holcombe2017fair,\\n  title={Fair open access: returning control of scholarly journals to their communities},\\n  author={Holcombe, Alex and Wilson, Mark C.},\\n  journal={Impact of Social Sciences Blog},\\n  year={2017},\\n  publisher={London School of Economics and Political Science},\\n    keywords={publication reform, advocacy},\\n  url_Link={https://blogs.lse.ac.uk/impactofsocialsciences/2017/10/23/fair-open-access-returning-control-of-scholarly-journals-to-their-communities/},\\n  abstract={}\\n}\\n\\n\",\"author_short\":[\"Holcombe, A.\",\"Wilson, M. C.\"],\"key\":\"holcombe2017fair\",\"id\":\"holcombe2017fair\",\"bibbaseid\":\"holcombe-wilson-fairopenaccessreturningcontrolofscholarlyjournalstotheircommunities-2017\",\"role\":\"author\",\"urls\":{\" link\":\"https://blogs.lse.ac.uk/impactofsocialsciences/2017/10/23/fair-open-access-returning-control-of-scholarly-journals-to-their-communities/\"},\"keyword\":[\"publication reform\",\"advocacy\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Results of a worldwide survey of mathematicians on journal reform\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Neylon\"],\"firstnames\":[\"Cameron\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Roberts\"],\"firstnames\":[\"David\",\"M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"European Mathematical Society Newsletter\",\"volume\":\"3\",\"number\":\"103\",\"pages\":\"46-49\",\"year\":\"2017\",\"keywords\":\"publication reform\",\"url_paper\":\"http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488X&vol=3&iss=103&rank=9\",\"abstract\":\"\",\"bibtex\":\"@article{neylon2017results,\\n  title={Results of a worldwide survey of mathematicians on journal reform},\\n  author={Neylon, Cameron and Roberts, David M. and Wilson, Mark C.},\\n  journal={European Mathematical Society Newsletter},\\n  volume={3},\\n  number={103},\\n  pages={46-49},\\n  year={2017},\\n  keywords={publication reform},\\n  url_Paper={http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488X&vol=3&iss=103&rank=9},\\n  abstract={}\\n}\\n\\n\",\"author_short\":[\"Neylon, C.\",\"Roberts, D. M.\",\"Wilson, M. C.\"],\"key\":\"neylon2017results\",\"id\":\"neylon2017results\",\"bibbaseid\":\"neylon-roberts-wilson-resultsofaworldwidesurveyofmathematiciansonjournalreform-2017\",\"role\":\"author\",\"urls\":{\" paper\":\"http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488X&vol=3&iss=103&rank=9\"},\"keyword\":[\"publication reform\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":8,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"New algorithms for matching problems\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Lo\"],\"firstnames\":[\"Jacky\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"arXiv preprint arXiv:1703.04225\",\"year\":\"2017\",\"keywords\":\"social choice, allocation, algorithms\",\"url_paper\":\"http://arxiv.org/abs/1703.04225\",\"abstract\":\"The standard two-sided and one-sided matching problems, and the closely related school choice problem, have been widely studied from an axiomatic viewpoint. A small number of algorithms dominate the literature. For two-sided matching, the Gale-Shapley algorithm; for one-sided matching, (random) Serial Dictatorship and Probabilistic Serial rule; for school choice, Gale-Shapley and the Boston mechanisms. The main reason for the dominance of these algorithms is their good (worst-case) axiomatic behaviour with respect to notions of efficiency and strategyproofness. However if we shift the focus to fairness, social welfare, tradeoffs between incompatible axioms, and average-case analysis, it is far from clear that these algorithms are optimal. We investigate new algorithms several of which have not appeared (to our knowledge) in the literature before. We give a unified presentation in which algorithms for 2-sided matching yield 1-sided matching algorithms in a systematic way. In addition to axiomatic properties, we investigate agent welfare using both theoretical and computational approaches. We find that some of the new algorithms are worthy of consideration for certain applications. In particular, when considering welfare under truthful preferences, some of the new algorithms outperform the classic ones.\",\"bibtex\":\"@article{lo2017new,\\n  title={New algorithms for matching problems},\\n  author={Lo, Jacky and Wilson, Mark C.},\\n  journal={arXiv preprint arXiv:1703.04225},\\n  year={2017},\\n  keywords={social choice, allocation, algorithms},\\n  url_Paper={http://arxiv.org/abs/1703.04225},\\n  abstract={The standard two-sided and one-sided matching problems, and the closely\\nrelated school choice problem, have been widely studied from an\\naxiomatic viewpoint. A small number of algorithms dominate the\\nliterature. For two-sided matching, the Gale-Shapley algorithm; for\\none-sided matching, (random) Serial Dictatorship and Probabilistic\\nSerial rule; for school choice, Gale-Shapley and the Boston mechanisms.\\nThe main reason for the dominance of these algorithms is their good\\n(worst-case) axiomatic behaviour with respect to notions of efficiency\\nand strategyproofness. However if we shift the focus to fairness, social\\nwelfare, tradeoffs between incompatible axioms, and average-case\\nanalysis, it is far from clear that these algorithms are optimal. We\\ninvestigate new algorithms several of which have not appeared (to our\\nknowledge) in the literature before. We give a unified presentation in\\nwhich algorithms for 2-sided matching yield 1-sided matching algorithms\\nin a systematic way. In addition to axiomatic properties, we investigate\\nagent welfare using both theoretical and computational approaches. We\\nfind that some of the new algorithms are worthy of consideration for\\ncertain applications. In particular, when considering welfare under\\ntruthful preferences, some of the new algorithms outperform the classic\\nones.}\\n}\\n\\n\",\"author_short\":[\"Lo, J.\",\"Wilson, M. C.\"],\"key\":\"lo2017new\",\"id\":\"lo2017new\",\"bibbaseid\":\"lo-wilson-newalgorithmsformatchingproblems-2017\",\"role\":\"author\",\"urls\":{\" paper\":\"http://arxiv.org/abs/1703.04225\"},\"keyword\":[\"social choice\",\"allocation\",\"algorithms\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":10,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Network analysis of New Zealand legislation\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sakhaee\"],\"firstnames\":[\"Neda\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Hendy\"],\"firstnames\":[\"Shaun\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zakeri\"],\"firstnames\":[\"Golbon\"],\"suffixes\":[]}],\"journal\":\"New Zealand Law Journal\",\"pages\":\"332-337\",\"year\":\"2017\",\"publisher\":\"\",\"keywords\":\"network science\",\"url_paper\":\"\",\"abstract\":\"A summary for a legal audience of the basic early findings in Neda's PhD work about citation networks derived from legislation.\",\"bibtex\":\"@article{sakhaee2017network,\\n  title={Network analysis of New Zealand legislation},\\n  author={Sakhaee, Neda and Wilson, Mark C. and Hendy, Shaun and Zakeri, Golbon},\\n  journal={New Zealand Law Journal},\\n  pages={332-337},\\n  year={2017},\\n  publisher={},\\n  keywords={network science},\\n  url_Paper={},\\n  abstract={A summary for a legal audience of the basic early findings in Neda's PhD\\nwork about citation networks derived from legislation.}\\n}\\n\\n\",\"author_short\":[\"Sakhaee, N.\",\"Wilson, M. C.\",\"Hendy, S.\",\"Zakeri, G.\"],\"key\":\"sakhaee2017network\",\"id\":\"sakhaee2017network\",\"bibbaseid\":\"sakhaee-wilson-hendy-zakeri-networkanalysisofnewzealandlegislation-2017\",\"role\":\"author\",\"urls\":{\" paper\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"network science\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Networked crowds answer tricky questions poorly\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Girard\"],\"firstnames\":[\"Patrick\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Pavlov\"],\"firstnames\":[\"Valery\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"\",\"volume\":\"\",\"number\":\"\",\"pages\":\"8pp\",\"year\":\"2016\",\"publisher\":\"\",\"keywords\":\"network science\",\"url_paper\":\"\",\"abstract\":\"We focus on the following basic group decision situation, which we call iterative distributed jury (IDJ), a variant of the Delphi technique. Group members seek to answer truthfully a question having a welldefined objectively correct answer; they revise answers iteratively; only summary feedback on group members' answers is available at each iteration; individual estimates are aggregated to form a group answer. Experimental studies of the effectiveness of Delphi-like methods have yielded mixed results. To investigate further, we designed a laboratory multiple choice IDJ experiment having some novel features. One novelty was that we incentivized participants to reveal their ignorance; another is the use of both logical and factual questions. We find that, perhaps surprisingly, substantial social influence occurs even in this highly anonymized and information-restricted setting, and even for purely logical questions. Eventual group accuracy is strongly dependent on the trickiness (likelihood of being answered confidently but wrongly, a concept distinct from difficulty) of the question. Also, the bulk of learning occurs by those who were willing to admit to being undecided. We find that question factors are more important than participant characteristics. In addition to consequences for the practical use of this group decision method, our quantitative results suggest specific new models of opinion dynamics that deserve detailed study.\",\"bibtex\":\"@article{GPW2016,\\n  title={Networked crowds answer tricky questions poorly},\\n  author={Girard, Patrick and Pavlov, Valery and Wilson, Mark C.},\\n  journal={},\\n  volume={},\\n  number={},\\n  pages={8pp},\\n  year={2016},\\n  publisher={},\\n  keywords={network science},\\n  url_Paper={},\\n  abstract={We focus on the following basic group decision situation, which we call\\niterative distributed jury (IDJ), a variant of the Delphi technique.\\nGroup members seek to answer truthfully a question having a welldefined\\nobjectively correct answer; they revise answers iteratively; only\\nsummary feedback on group members' answers is available at each\\niteration; individual estimates are aggregated to form a group answer.\\nExperimental studies of the effectiveness of Delphi-like methods have\\nyielded mixed results. To investigate further, we designed a laboratory\\nmultiple choice IDJ experiment having some novel features. One novelty\\nwas that we incentivized participants to reveal their ignorance; another\\nis the use of both logical and factual questions. We find that, perhaps\\nsurprisingly, substantial social influence occurs even in this highly\\nanonymized and information-restricted setting, and even for purely\\nlogical questions. Eventual group accuracy is strongly dependent on the\\ntrickiness (likelihood of being answered confidently but wrongly, a\\nconcept distinct from difficulty) of the question. Also, the bulk of\\nlearning occurs by those who were willing to admit to being undecided.\\nWe find that question factors are more important than participant\\ncharacteristics.  In addition to consequences for the practical use of\\nthis group decision method, our quantitative results suggest specific\\nnew models of opinion dynamics that deserve detailed study.} \\n}\\n\\n\",\"author_short\":[\"Girard, P.\",\"Pavlov, V.\",\"Wilson, M. C.\"],\"key\":\"GPW2016\",\"id\":\"GPW2016\",\"bibbaseid\":\"girard-pavlov-wilson-networkedcrowdsanswertrickyquestionspoorly-2016\",\"role\":\"author\",\"urls\":{\" paper\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"network science\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"New Zealand Legislation Network.\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Sakhaee\"],\"firstnames\":[\"Neda\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zakeri\"],\"firstnames\":[\"Golbon\"],\"suffixes\":[]}],\"booktitle\":\"JURIX\",\"pages\":\"199-202\",\"year\":\"2016\",\"keywords\":\"network science\",\"url_paper\":\"SWZ2016.pdf\",\"abstract\":\"This paper concerns the recently introduced concept of Legislation Networks, with an application focus on the New Zealand legislation network. Legislation networks have some novel features which make them an excellent test case for new network science tools. They involve legal documents, but differ substantially from citation networks involving case-law, Supreme Court opinions, etc. We develop several such networks, compute relevant centrality measures, and apply community detection algorithms. We study the relationship between the legislation network measures and legal/political factors. The intention is to follow-up with more detailed studies in network science (link prediction, node attribute prediction, generative models and time evolution) and legal and political analyses.\",\"bibtex\":\"@inproceedings{sakhaee2016new,\\n  title={New Zealand Legislation Network.},\\n  author={Sakhaee, Neda and Wilson, Mark C. and Zakeri, Golbon},\\n  booktitle={JURIX},\\n  pages={199-202},\\n  year={2016},\\n  keywords={network science},\\n  url_Paper={SWZ2016.pdf},\\n  abstract={This paper concerns the recently introduced concept of Legislation\\nNetworks, with an application focus on the New Zealand legislation\\nnetwork. Legislation networks have some novel features which make them\\nan excellent test case for new network science tools. They involve legal\\ndocuments, but differ substantially from citation networks involving\\ncase-law, Supreme Court opinions, etc. We develop several such networks,\\ncompute relevant centrality measures, and apply community detection\\nalgorithms. We study the relationship between the legislation network\\nmeasures and legal/political factors. The intention is to follow-up with\\nmore detailed studies in network science (link prediction, node\\nattribute prediction, generative models and time evolution) and legal\\nand political analyses.}\\n}\\n\\n\\n\",\"author_short\":[\"Sakhaee, N.\",\"Wilson, M. C.\",\"Zakeri, G.\"],\"key\":\"sakhaee2016new\",\"id\":\"sakhaee2016new\",\"bibbaseid\":\"sakhaee-wilson-zakeri-newzealandlegislationnetwork-2016\",\"role\":\"author\",\"urls\":{\" paper\":\"https://drive.google.com/SWZ2016.pdf\"},\"keyword\":[\"network science\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Distance rationalization of social rules\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Hadjibeyli\"],\"firstnames\":[\"Benjamin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"arXiv preprint arXiv:1610.01902\",\"year\":\"2016\",\"keywords\":\"social choice, voting\",\"url_paper\":\"http://arxiv.org/abs/1610.01902\",\"abstract\":\"The concept of distance rationalizability of social choice rules has been explored in recent years by several authors. We deal here with several foundational questions, and unify, correct, and generalize previous work. For example, we study a new question involving uniqueness of representation in the distance rationalizability framework, and present a counterexample. For rules satisfying various axiomatic properties such as anonymity, neutrality and homogeneity, the standard profile representation of input can be compressed substantially. We explain in detail using quotient constructions how distance rationalizability is interpreted in this situation. This enables us to connect the theory of distance rationalizability with geometric concepts such as Earth Mover distance and optimal transportation. We give improved sufficient conditions for distance rationalizable rules to satisfy anonymity, neutrality, homogeneity, consistency and continuity.\",\"bibtex\":\"@article{hadjibeyli2016distance,\\n  title={Distance rationalization of social rules},\\n  author={Hadjibeyli, Benjamin and Wilson, Mark C.},\\n  journal={arXiv preprint arXiv:1610.01902},\\n  year={2016},\\n  keywords={social choice, voting},\\n  url_Paper={http://arxiv.org/abs/1610.01902},\\n  abstract={The concept of distance rationalizability of social choice rules has\\nbeen explored in recent years by several authors. We deal here with\\nseveral foundational questions, and unify, correct, and generalize\\nprevious work. For example, we study a new question involving uniqueness\\nof representation in the distance rationalizability framework, and\\npresent a counterexample. For rules satisfying various axiomatic\\nproperties such as anonymity, neutrality and homogeneity, the standard\\nprofile representation of input can be compressed substantially. We\\nexplain in detail using quotient constructions how distance\\nrationalizability is interpreted in this situation. This enables us to\\nconnect the theory of distance rationalizability with geometric concepts\\nsuch as Earth Mover distance and optimal transportation. We give\\nimproved sufficient conditions for distance rationalizable rules to\\nsatisfy anonymity, neutrality, homogeneity, consistency and continuity.}\\n}\\n\\n\\n\",\"author_short\":[\"Hadjibeyli, B.\",\"Wilson, M. C.\"],\"key\":\"hadjibeyli2016distance\",\"id\":\"hadjibeyli2016distance\",\"bibbaseid\":\"hadjibeyli-wilson-distancerationalizationofsocialrules-2016\",\"role\":\"author\",\"urls\":{\" paper\":\"http://arxiv.org/abs/1610.01902\"},\"keyword\":[\"social choice\",\"voting\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Stephen\"],\"propositions\":[],\"lastnames\":[\"Melczer\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"title\":\"Asymptotics of lattice walks via analytic combinatorics in several variables\",\"booktitle\":\"2016 Conference on Formal Power Series and Algebraic Combinatorics, FPSAC2016\",\"series\":\"Discrete Math. Theor. Comput. Sci. Proc., AH\",\"pages\":\"863-874\",\"publisher\":\"Assoc. Discrete Math. Theor. Comput. Sci., Nancy\",\"year\":\"2016\",\"keywords\":\"ACSV applications\",\"url_paper\":\"https://dmtcs.episciences.org/6390/pdf\",\"abstract\":\"We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method, along with a rigorous computer algebra approach, to show that 23 of the 79 models admit D-finite generating functions. In 2009, Bostan and Kauers used Padé-Hermite approximants to guess differential equations which these 23 generating functions satisfy, in the process guessing asymptotics of their coefficient sequences. In this article we provide, for the first time, a complete rigorous verification of these guesses. Our technique is to use the kernel method to express 19 of the 23 generating functions as diagonals of tri-variate rational functions and apply the methods of analytic combinatorics in several variables (the remaining 4 models have algebraic generating functions and can thus be handled by univariate techniques). This approach also shows the link between combinatorial properties of the models and features of its asymptotics such as asymptotic and polynomial growth factors. In addition, we give expressions for the number of walks returning to the x-axis, the y-axis, and the origin, proving recently conjectured asymptotics of Bostan, Chyzak, van Hoeij, Kauers, and Pech.\",\"bibtex\":\"@inproceedings {MeWi2016, \\nAUTHOR = {Stephen Melczer and Wilson, Mark C.},\\n     TITLE = {Asymptotics of lattice walks via analytic combinatorics in several variables},\\n BOOKTITLE = {2016 {C}onference on {F}ormal {P}ower {S}eries and {A}lgebraic {C}ombinatorics, FPSAC2016},\\n    SERIES = {Discrete Math. Theor. Comput. Sci. Proc., AH},\\n     PAGES = {863-874},\\n PUBLISHER = {Assoc. Discrete Math. Theor. Comput. Sci., Nancy},\\n      YEAR = {2016},\\n  keywords={ACSV applications},\\n  url_Paper={https://dmtcs.episciences.org/6390/pdf},\\n  abstract={We consider the enumeration of walks on the two dimensional non-negative\\ninteger lattice with short steps. Up to isomorphism there are 79 unique\\ntwo dimensional models to consider, and previous work in this area has\\nused the kernel method, along with a rigorous computer algebra approach,\\nto show that 23 of the 79 models admit D-finite generating functions. In\\n2009, Bostan and Kauers used Pad\\\\'{e}-Hermite approximants to guess\\ndifferential equations which these 23 generating functions satisfy, in\\nthe process guessing asymptotics of their coefficient sequences. In this\\narticle we provide, for the first time, a complete rigorous verification\\nof these guesses. Our technique is to use the kernel method to express\\n19 of the 23 generating functions as diagonals of tri-variate rational\\nfunctions and apply the methods of analytic combinatorics in several\\nvariables (the remaining 4 models have algebraic generating functions\\nand can thus be handled by univariate techniques). This approach also\\nshows the link between combinatorial properties of the models and\\nfeatures of its asymptotics such as asymptotic and polynomial growth\\nfactors. In addition, we give expressions for the number of walks\\nreturning to the x-axis, the y-axis, and the origin, proving recently\\nconjectured asymptotics of Bostan, Chyzak, van Hoeij, Kauers, and Pech.}\\n  \\n}\\n\\n\\n\",\"author_short\":[\"Melczer, S.\",\"Wilson, M. C.\"],\"key\":\"MeWi2016\",\"id\":\"MeWi2016\",\"bibbaseid\":\"melczer-wilson-asymptoticsoflatticewalksviaanalyticcombinatoricsinseveralvariables-2016\",\"role\":\"author\",\"urls\":{\" paper\":\"https://dmtcs.episciences.org/6390/pdf\"},\"keyword\":[\"ACSV applications\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Diagonal asymptotics for products of combinatorial classes\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Combinatorics, Probability and Computing\",\"volume\":\"24\",\"number\":\"1\",\"pages\":\"354-372\",\"year\":\"2015\",\"publisher\":\"Cambridge University Press\",\"keywords\":\"ACSV theory\",\"url_paper\":\"https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/diagonal-asymptotics-for-products-of-combinatorial-classes/DE65A4AA078A6161905DD6CEFBEDC85E\",\"abstract\":\"We generalize and improve recent results by Bóna and Knopfmacher and by Banderier and Hitczenko concerning the joint distribution of the sum and number of parts in tuples of restricted compositions. Specifically, we generalize the problem to general combinatorial classes and relax the requirement that the sizes of the compositions be equal. We extend the main explicit results to enumeration problems whose counting sequences are Riordan arrays. In this framework, we give an alternative method for computing asymptotics in the supercritical case, which avoids explicit diagonal extraction and seems likely to be computationally more efficient.\",\"bibtex\":\"@article{wilson2015diagonal,\\n  title={Diagonal asymptotics for products of combinatorial classes},\\n  author={Wilson, Mark C.},\\n  journal={Combinatorics, Probability and Computing},\\n  volume={24},\\n  number={1},\\n  pages={354-372},\\n  year={2015},\\n  publisher={Cambridge University Press},\\n  keywords={ACSV theory},\\n  url_Paper={https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/diagonal-asymptotics-for-products-of-combinatorial-classes/DE65A4AA078A6161905DD6CEFBEDC85E},\\n  abstract={We generalize and improve recent results by B\\\\'{o}na and Knopfmacher and\\nby Banderier and Hitczenko concerning the joint distribution of the sum\\nand number of parts in tuples of restricted compositions. Specifically,\\nwe generalize the problem to general combinatorial classes and relax the\\nrequirement that the sizes of the compositions be equal. We extend the\\nmain explicit results to enumeration problems whose counting sequences\\nare Riordan arrays.  In this framework, we give an alternative method\\nfor computing asymptotics in the supercritical case, which avoids\\nexplicit diagonal extraction and seems likely to be computationally more\\nefficient.}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson2015diagonal\",\"id\":\"wilson2015diagonal\",\"bibbaseid\":\"wilson-diagonalasymptoticsforproductsofcombinatorialclasses-2015\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/diagonal-asymptotics-for-products-of-combinatorial-classes/DE65A4AA078A6161905DD6CEFBEDC85E\"},\"keyword\":[\"ACSV theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Toufik\"],\"propositions\":[],\"lastnames\":[\"Mansour\"],\"suffixes\":[]},{\"firstnames\":[\"Mark\"],\"propositions\":[],\"lastnames\":[\"Shattuck\"],\"suffixes\":[]},{\"firstnames\":[\"Mark\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Wilson\"],\"suffixes\":[]}],\"title\":\"Congruence successions in compositions\",\"journal\":\"Discret. Math. Theor. Comput. Sci.\",\"volume\":\"16\",\"number\":\"1\",\"pages\":\"327-338\",\"year\":\"2014\",\"keywords\":\"combinatorics\",\"url\":\"http://dmtcs.episciences.org/1252\",\"abstract\":\"A \\\\emphcomposition is a sequence of positive integers, called \\\\emphparts, having a fixed sum. By an \\\\emph$m$-congruence succession, we will mean a pair of adjacent parts $x$ and $y$ within a composition such that $x≡ y (\\\\text{mod} m)$. Here, we consider the problem of counting the compositions of size $n$ according to the number of $m$-congruence successions, extending recent results concerning successions on subsets and permutations. A general formula is obtained, which reduces in the limiting case to the known generating function formula for the number of Carlitz compositions. Special attention is paid to the case $m=2$, where further enumerative results may be obtained by means of combinatorial arguments. Finally, an asymptotic estimate is provided for the number of compositions of size $n$ having no $m$-congruence successions.\",\"bibtex\":\"@article{MSW2014,\\n  author    = {Toufik Mansour and\\n               Mark Shattuck and\\n               Mark C. Wilson},\\n  title     = {Congruence successions in compositions},\\n  journal   = {Discret. Math. Theor. Comput. Sci.},\\n  volume    = {16},\\n  number    = {1},\\n  pages     = {327-338},\\n  year      = {2014},\\n  keywords={combinatorics},\\n  url       = {http://dmtcs.episciences.org/1252},\\n  abstract={A \\\\emph{composition} is a sequence of positive integers, called\\n\\\\emph{parts}, having a fixed sum.  By an \\\\emph{$m$-congruence\\nsuccession}, we will mean a pair of adjacent parts $x$ and $y$ within a\\ncomposition such that $x\\\\equiv y~(\\\\text{mod}~m)$.  Here, we consider the\\nproblem of counting the compositions of size $n$ according to the number\\nof $m$-congruence successions, extending recent results concerning\\nsuccessions on subsets and permutations.  A general formula is obtained,\\nwhich reduces in the limiting case to the known generating function\\nformula for the number of Carlitz compositions.  Special attention is\\npaid to the case $m=2$, where further enumerative results may be\\nobtained by means of combinatorial arguments.  Finally, an asymptotic\\nestimate is provided for the number of compositions of size $n$ having\\nno $m$-congruence successions.}\\n}\\n\\n\",\"author_short\":[\"Mansour, T.\",\"Shattuck, M.\",\"Wilson, M. C.\"],\"key\":\"MSW2014\",\"id\":\"MSW2014\",\"bibbaseid\":\"mansour-shattuck-wilson-congruencesuccessionsincompositions-2014\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://dmtcs.episciences.org/1252\"},\"keyword\":[\"combinatorics\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Miranda\"],\"propositions\":[],\"lastnames\":[\"Emery\"],\"suffixes\":[]},{\"firstnames\":[\"Mark\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Wilson\"],\"suffixes\":[]}],\"title\":\"Iterated Regret Minimization in Voting Games\",\"booktitle\":\"COMSOC 2014, Pittsburgh, June 23-25, 2014\",\"pages\":\"12pp\",\"year\":\"2014\",\"keywords\":\"social choice, voting, game theory\",\"url\":\"http://www.cs.cmu.edu/~arielpro/comsoc-14/papers/EmeryWilson2014.pdf\",\"abstract\":\"The game-theoretic solution concept Iterated Regret Minimization (IRM) was introduced recently by Halpern and Pass. We give the first application of IRM to simultaneous voting games. We study positional scoring rules in detail and give theoretical results demonstrating the bias of IRM toward sincere voting. We present comprehensive simulation results of the effect on social welfare of IRM compared to both sincere and optimal voting. The results fit into a broader research theme of the welfare consequences of strategic voting.\",\"bibtex\":\"@inproceedings{EmWi2014,\\n  author    = {Miranda Emery and\\n               Mark C. Wilson},\\n  title     = {Iterated Regret Minimization in Voting Games},\\n  booktitle = {COMSOC 2014, Pittsburgh, June 23-25, 2014},\\n  pages     = {12pp},\\n  year      = {2014},\\n  keywords={social choice, voting, game theory},\\n url   = {http://www.cs.cmu.edu/~arielpro/comsoc-14/papers/EmeryWilson2014.pdf},\\n  abstract={The game-theoretic solution concept Iterated Regret Minimization (IRM)\\nwas introduced recently by Halpern and Pass. We give the first\\napplication of IRM to simultaneous voting games. We study positional\\nscoring rules in detail and give theoretical results demonstrating the\\nbias of IRM toward sincere voting. We present comprehensive simulation\\nresults of the effect on social welfare of IRM compared to both sincere\\nand optimal voting. The results fit into a broader research theme of the\\nwelfare consequences of strategic voting.}\\n}\\n\\n\\n\",\"author_short\":[\"Emery, M.\",\"Wilson, M. C.\"],\"key\":\"EmWi2014\",\"id\":\"EmWi2014\",\"bibbaseid\":\"emery-wilson-iteratedregretminimizationinvotinggames-2014\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://www.cs.cmu.edu/~arielpro/comsoc-14/papers/EmeryWilson2014.pdf\"},\"keyword\":[\"social choice\",\"voting\",\"game theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Simulating the 2011 Referendum in New Zealand\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Pritchard\"],\"firstnames\":[\"Geoffrey\"],\"suffixes\":[]}],\"journal\":\"Parliamentary Affairs\",\"volume\":\"67\",\"number\":\"4\",\"pages\":\"969-980\",\"year\":\"2014\",\"publisher\":\"Oxford University Press\",\"keywords\":\"electoral systems, simulation\",\"url_paper\":\"https://markcwilson.site/Research/Outputs/PrWi2013.pdf\",\"url_slides\":\"https://www.stat.auckland.ac.nz/~geoff/voting/\",\"abstract\":\"On 26 November 2011, an indicative referendum was held in New Zealand with the aim of gauging public support for a change from the current parliamentary electoral system (Mixed Member Proportional) to one of four alternatives. In order to understand the consequences (in terms of the seat distribution of parties in Parliament) of a change in electoral system, we created an online simulator several months before the referendum date. Several interesting research issues arose in this work, which in our opinion deserve greater analysis. We describe the assumptions made in order to create such a simulator, and their consequences.\",\"bibtex\":\"@article{wilson2014simulating,\\n  title={Simulating the 2011 Referendum in New Zealand},\\n  author={Wilson, Mark C. and Pritchard, Geoffrey},\\n  journal={Parliamentary Affairs},\\n  volume={67},\\n  number={4},\\n  pages={969-980},\\n  year={2014},\\n  publisher={Oxford University Press},\\n  keywords={electoral systems, simulation},\\n  url_Paper={https://markcwilson.site/Research/Outputs/PrWi2013.pdf},\\n  url_Slides={https://www.stat.auckland.ac.nz/~geoff/voting/},\\n  abstract={On 26 November 2011, an indicative referendum was held in New Zealand\\nwith the aim of gauging public support for a change from the current\\nparliamentary electoral system (Mixed Member Proportional) to one of\\nfour alternatives. In order to understand the consequences (in terms of\\nthe seat distribution of parties in Parliament) of a change in electoral\\nsystem, we created an online simulator several months before the\\nreferendum date. Several interesting research issues arose in this work,\\nwhich in our opinion deserve greater analysis. We describe the\\nassumptions made in order to create such a simulator, and their\\nconsequences.}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\",\"Pritchard, G.\"],\"key\":\"wilson2014simulating\",\"id\":\"wilson2014simulating\",\"bibbaseid\":\"wilson-pritchard-simulatingthe2011referenduminnewzealand-2014\",\"role\":\"author\",\"urls\":{\" paper\":\"https://markcwilson.site/Research/Outputs/PrWi2013.pdf\",\" slides\":\"https://www.stat.auckland.ac.nz/~geoff/voting/\"},\"keyword\":[\"electoral systems\",\"simulation\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":7,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Review of Models of Conflict and Cooperation by Rick Gillman and David Housman\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"ACM SIGACT News\",\"volume\":\"44\",\"number\":\"1\",\"pages\":\"34-35\",\"year\":\"2013\",\"publisher\":\"ACM New York, NY, USA\",\"keywords\":\"review\",\"url_paper\":\"\",\"abstract\":\"\",\"bibtex\":\"@article{wilson2013review,\\n  title={Review of Models of Conflict and Cooperation by Rick Gillman and David Housman},\\n  author={Wilson, Mark C.},\\n  journal={ACM SIGACT News},\\n  volume={44},\\n  number={1},\\n  pages={34-35},\\n  year={2013},\\n  publisher={ACM New York, NY, USA},\\n  keywords={review},\\n  url_Paper={},\\n  abstract={}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson2013review\",\"id\":\"wilson2013review\",\"bibbaseid\":\"wilson-reviewofmodelsofconflictandcooperationbyrickgillmananddavidhousman-2013\",\"role\":\"author\",\"urls\":{\" paper\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"review\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"book\",\"type\":\"book\",\"title\":\"Analytic combinatorics in several variables\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Pemantle\"],\"firstnames\":[\"Robin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"year\":\"2013\",\"publisher\":\"Cambridge University Press\",\"keywords\":\"ACSV theory\",\"url_paper\":\"\",\"abstract\":\"\",\"bibtex\":\"@book{pemantle2013analytic,\\n  title={Analytic combinatorics in several variables},\\n  author={Pemantle, Robin and Wilson, Mark C.},\\n  year={2013},\\n  publisher={Cambridge University Press},\\n  keywords={ACSV theory},\\n  url_Paper={},\\n  abstract={}\\n}\\n\\n\",\"author_short\":[\"Pemantle, R.\",\"Wilson, M. C.\"],\"key\":\"pemantle2013analytic\",\"id\":\"pemantle2013analytic\",\"bibbaseid\":\"pemantle-wilson-analyticcombinatoricsinseveralvariables-2013\",\"role\":\"author\",\"urls\":{\" paper\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"ACSV theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Power measures derived from the sequential query process\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Pritchard\"],\"firstnames\":[\"Geoffrey\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Reyhani\"],\"firstnames\":[\"Reyhaneh\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Mathematical Social Sciences\",\"volume\":\"65\",\"number\":\"3\",\"pages\":\"174-180\",\"year\":\"2013\",\"publisher\":\"North-Holland\",\"keywords\":\"social choice, cooperative games\",\"url_paper\":\"https://www.sciencedirect.com/science/article/pii/S0165489612001096?casa_token=4x3gmLGuiPIAAAAA:9crEC8R6F3yj1ut1S482WqW3UPlxOvAyL6-gzldpHWnpp7qYgbMYugOhgwxefm-mB6TFBETE_Q\",\"abstract\":\"We study a basic sequential model for the discovery of winning coalitions in a simple game, well known from its use in defining the Shapley-Shubik power index. We derive in a uniform way a family of measures of collective and individual power in simple games, and show that, as for the Shapley-Shubik index, they extend naturally to measures for TU-games. In particular, the individual measures include all weighted semivalues. We single out the simplest measure in our family for more investigation, as it is new to the literature as far as we know. Although it is very different from the Shapley value, it is closely related in several ways, and is the natural analogue of the Shapley value under a nonstandard, but natural, definition of simple game. We illustrate this new measure by calculating its values on some standard examples.\",\"bibtex\":\"@article{pritchard2013power,\\n  title={Power measures derived from the sequential query process},\\n  author={Pritchard, Geoffrey and Reyhani, Reyhaneh and Wilson, Mark C.},\\n  journal={Mathematical Social Sciences},\\n  volume={65},\\n  number={3},\\n  pages={174-180},\\n  year={2013},\\n  publisher={North-Holland},\\n  keywords={social choice, cooperative games},\\n  url_Paper={https://www.sciencedirect.com/science/article/pii/S0165489612001096?casa_token=4x3gmLGuiPIAAAAA:9crEC8R6F3yj1ut1S482WqW3UPlxOvAyL6-gzldpHWnpp7qYgbMYugOhgwxefm-mB6TFBETE_Q},\\n  abstract={We study a basic sequential model for the discovery of winning\\ncoalitions in a simple game, well known from its use in defining the\\nShapley-Shubik power index. We derive in a uniform way a family of\\nmeasures of collective and individual power in simple games, and show\\nthat, as for the Shapley-Shubik index, they extend naturally to measures\\nfor TU-games. In particular, the individual measures include all\\nweighted semivalues. We single out the simplest measure in our family\\nfor more investigation, as it is new to the literature as far as we\\nknow. Although it is very different from the Shapley value, it is\\nclosely related in several ways, and is the natural analogue of the\\nShapley value under a nonstandard, but natural, definition of simple\\ngame. We illustrate this new measure by calculating its values on some\\nstandard examples.}\\n}\\n\\n\",\"author_short\":[\"Pritchard, G.\",\"Reyhani, R.\",\"Wilson, M. C.\"],\"key\":\"pritchard2013power\",\"id\":\"pritchard2013power\",\"bibbaseid\":\"pritchard-reyhani-wilson-powermeasuresderivedfromthesequentialqueryprocess-2013\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.sciencedirect.com/science/article/pii/S0165489612001096?casa_token=4x3gmLGuiPIAAAAA:9crEC8R6F3yj1ut1S482WqW3UPlxOvAyL6-gzldpHWnpp7qYgbMYugOhgwxefm-mB6TFBETE_Q\"},\"keyword\":[\"social choice\",\"cooperative games\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"misc\",\"title\":\"Submission to the Electoral Commission review of MMP\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Fowlie\"],\"firstnames\":[\"Michael\"],\"suffixes\":[]}],\"year\":\"2012\",\"publisher\":\"Electoral Commission of New Zealand\",\"keywords\":\"electoral systems\",\"url_paper\":\"https://elections.nz/assets/2012-report-of-the-Electoral-Commission-on-the-review-of-mmp.pdf\",\"abstract\":\"\",\"bibtex\":\"@misc{WiFo2012,\\n  title={Submission to the Electoral Commission review of MMP},\\n  author={Wilson, Mark C. and Fowlie, Michael},\\n  year={2012},\\n  publisher={Electoral Commission of New Zealand},\\n   keywords={electoral systems},\\n  url_Paper={https://elections.nz/assets/2012-report-of-the-Electoral-Commission-on-the-review-of-mmp.pdf},\\n  abstract={},\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\",\"Fowlie, M.\"],\"key\":\"WiFo2012\",\"id\":\"WiFo2012\",\"bibbaseid\":\"wilson-fowlie-submissiontotheelectoralcommissionreviewofmmp-2012\",\"role\":\"author\",\"urls\":{\" paper\":\"https://elections.nz/assets/2012-report-of-the-Electoral-Commission-on-the-review-of-mmp.pdf\"},\"keyword\":[\"electoral systems\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"misc\",\"title\":\"The Elsevier boycott and beyond\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"New Zealand Mathematical Society Newsletter\",\"year\":\"2012\",\"publisher\":\"\",\"keywords\":\"publication reform, advocacy\",\"url_paper\":\"https://markcwilson.site/Research/Outputs/elsevier-nzms.pdf\",\"abstract\":\"\",\"bibtex\":\"@misc{wilson2012elsevier,\\n  title={The Elsevier boycott and beyond},\\n  author={Wilson, Mark C.},\\n  journal={New Zealand Mathematical Society Newsletter},\\n  year={2012},\\n  publisher={},\\n    keywords={publication reform, advocacy},\\n  url_Paper={https://markcwilson.site/Research/Outputs/elsevier-nzms.pdf},\\n  abstract={}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson2012elsevier\",\"id\":\"wilson2012elsevier\",\"bibbaseid\":\"wilson-theelsevierboycottandbeyond-2012\",\"role\":\"author\",\"urls\":{\" paper\":\"https://markcwilson.site/Research/Outputs/elsevier-nzms.pdf\"},\"keyword\":[\"publication reform\",\"advocacy\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":2,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Random Cayley digraphs of diameter 2 and given degree\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Širáň\"],\"firstnames\":[\"Jozef\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Potočnik\"],\"firstnames\":[\"Primož\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Lladser\"],\"firstnames\":[\"Manuel\",\"E.\"],\"suffixes\":[]}],\"journal\":\"Discrete Mathematics & Theoretical Computer Science\",\"volume\":\"14\",\"year\":\"2012\",\"publisher\":\"Episciences. org\",\"keywords\":\"combinatorics\",\"url_paper\":\"https://dmtcs.episciences.org/588/pdf\",\"abstract\":\"\",\"bibtex\":\"@article{wilson2012random,\\n  title={Random Cayley digraphs of diameter 2 and given degree},\\n  author={Wilson, Mark C. and {\\\\v{S}}ir{\\\\'a}{\\\\v{n}}, Jozef and Poto{\\\\v{c}}nik, Primo{\\\\v{z}} and Lladser, Manuel E.},\\n  journal={Discrete Mathematics \\\\& Theoretical Computer Science},\\n  volume={14},\\n  year={2012},\\n  publisher={Episciences. org},\\n  keywords={combinatorics},\\n  url_Paper={https://dmtcs.episciences.org/588/pdf},\\n  abstract={}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\",\"Širáň, J.\",\"Potočnik, P.\",\"Lladser, M. E.\"],\"key\":\"wilson2012random\",\"id\":\"wilson2012random\",\"bibbaseid\":\"wilson-ir-potonik-lladser-randomcayleydigraphsofdiameter2andgivendegree-2012\",\"role\":\"author\",\"urls\":{\" paper\":\"https://dmtcs.episciences.org/588/pdf\"},\"keyword\":[\"combinatorics\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Best reply dynamics for scoring rules\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Reyhani\"],\"firstnames\":[\"Reyhaneh\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 20th European Conference on Artificial Intelligence\",\"pages\":\"672-677\",\"year\":\"2012\",\"organization\":\"IOS Press\",\"keywords\":\"social choice, voting\",\"url_paper\":\"https://ebooks.iospress.nl/doi/10.3233/978-1-61499-098-7-672\",\"abstract\":\"We consider best-reply dynamics for voting games in which all players are strategic and no coalitions are formed. We study the class of scoring rules, show convergence of a suitably restricted version for the plurality and veto rules, and failure of convergence for other rules including $k$-approval and Borda. In particular, for 3 candidates convergence fails for all rules other than plurality and veto. We give a unified proof for the convergence of these two rules. Our proofs in the case of plurality improve the known bound on convergence, and the other convergence results are new.\",\"bibtex\":\"@inproceedings{reyhani2012best,\\n  title={Best reply dynamics for scoring rules},\\n  author={Reyhani, Reyhaneh and Wilson, Mark C.},\\n  booktitle={Proceedings of the 20th European Conference on Artificial Intelligence},\\n  pages={672-677},\\n  year={2012},\\n  organization={IOS Press},\\n  keywords={social choice, voting},\\n  url_Paper={https://ebooks.iospress.nl/doi/10.3233/978-1-61499-098-7-672},\\n  abstract={We consider best-reply dynamics for voting games in which all players\\nare strategic and no coalitions are formed. We study the class of\\nscoring rules, show convergence of a suitably restricted version for the\\nplurality and veto rules, and failure of convergence for other rules\\nincluding $k$-approval and Borda. In particular, for 3 candidates\\nconvergence fails for all rules other than plurality and veto. We give a\\nunified proof for the convergence of these two rules. Our proofs in the\\ncase of plurality improve the known bound on convergence, and the other\\nconvergence results are new.}\\n}\\n\\n\",\"author_short\":[\"Reyhani, R.\",\"Wilson, M. C.\"],\"key\":\"reyhani2012best\",\"id\":\"reyhani2012best\",\"bibbaseid\":\"reyhani-wilson-bestreplydynamicsforscoringrules-2012\",\"role\":\"author\",\"urls\":{\" paper\":\"https://ebooks.iospress.nl/doi/10.3233/978-1-61499-098-7-672\"},\"keyword\":[\"social choice\",\"voting\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Reyhaneh\"],\"propositions\":[],\"lastnames\":[\"Reyhani\"],\"suffixes\":[]},{\"firstnames\":[\"Mark\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Wilson\"],\"suffixes\":[]},{\"firstnames\":[\"Javad\"],\"propositions\":[],\"lastnames\":[\"Khazaei\"],\"suffixes\":[]}],\"title\":\"Coordination via Polling in Plurality Voting Games under Inertia\",\"booktitle\":\"COMSOC 2012, Krakow, September 11-13, 2012\",\"pages\":\"359-370\",\"year\":\"2012\",\"keywords\":\"social choice, voting, game theory\",\"url\":\"http://home.agh.edu.pl/~faliszew/COMSOC-2012/proceedings/paper_52.pdf\",\"abstract\":\"We discuss a general model for strategic voting in plurality elections under uncertainty, using the concept of inertia to deal with information and risk attitude of agents. The model is flexible enough to be used for human societies and artificially designed multiagent systems. Under some further assumptions we show that a sequence of pre-election polls can help agents to coordinate on an equilibrium outcome. This mechanism is closely related to the STV voting rule and gives insight into the political science principle known as Duverger's law.\",\"bibtex\":\"@inproceedings{RWK2012,\\n  author    = {Reyhaneh Reyhani and\\n               Mark C. Wilson and Javad Khazaei},\\n  title     = {Coordination via Polling in Plurality Voting Games\\nunder Inertia},\\n  booktitle = {COMSOC 2012, Krakow, September 11-13, 2012},\\n  pages     = {359-370},\\n  year      = {2012},\\n  keywords={social choice, voting, game theory},\\n  url       = {http://home.agh.edu.pl/~faliszew/COMSOC-2012/proceedings/paper_52.pdf},\\n  abstract={We discuss a general model for strategic voting in plurality elections\\nunder uncertainty, using the concept of inertia to deal with information\\nand risk attitude of agents. The model is flexible enough to be used for\\nhuman societies and artificially designed multiagent systems. Under some\\nfurther assumptions we show that a sequence of pre-election polls can\\nhelp agents to coordinate on an equilibrium outcome. This mechanism is\\nclosely related to the STV voting rule and gives insight into the\\npolitical science principle known as Duverger's law.}\\n}\\n\\n\\n\",\"author_short\":[\"Reyhani, R.\",\"Wilson, M. C.\",\"Khazaei, J.\"],\"key\":\"RWK2012\",\"id\":\"RWK2012\",\"bibbaseid\":\"reyhani-wilson-khazaei-coordinationviapollinginpluralityvotinggamesunderinertia-2012\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://home.agh.edu.pl/~faliszew/COMSOC-2012/proceedings/paper_52.pdf\"},\"keyword\":[\"social choice\",\"voting\",\"game theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"A new approach to asymptotics of Maclaurin coefficients of algebraic functions\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Raichev\"],\"firstnames\":[\"Alexander\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"arXiv preprint arXiv:1202.3826\",\"year\":\"2012\",\"keywords\":\"ACSV theory\",\"url_paper\":\"https://arxiv.org/pdf/1202.3826.pdf\",\"abstract\":\"We propose a general method for deriving asymptotics of the Maclaurin series coefficients of algebraic functions that is based on a procedure of K. V. Safonov and multivariate singularity analysis. We test the feasibility of this this approach by experimenting on several examples.\",\"bibtex\":\"@article{raichev2012new,\\n  title={A new approach to asymptotics of Maclaurin coefficients of algebraic functions},\\n  author={Raichev, Alexander and Wilson, Mark C.},\\n  journal={arXiv preprint arXiv:1202.3826},\\n  year={2012},\\n  keywords={ACSV theory},\\n  url_Paper={https://arxiv.org/pdf/1202.3826.pdf},\\n  abstract={We propose a general method for deriving asymptotics of the Maclaurin\\nseries coefficients of algebraic functions that is based on a procedure of K. V. Safonov\\nand multivariate singularity analysis. We test the feasibility of this this approach by\\nexperimenting on several examples.}\\n}\\n\\n\",\"author_short\":[\"Raichev, A.\",\"Wilson, M. C.\"],\"key\":\"raichev2012new\",\"id\":\"raichev2012new\",\"bibbaseid\":\"raichev-wilson-anewapproachtoasymptoticsofmaclaurincoefficientsofalgebraicfunctions-2012\",\"role\":\"author\",\"urls\":{\" paper\":\"https://arxiv.org/pdf/1202.3826.pdf\"},\"keyword\":[\"ACSV theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Egor\"],\"propositions\":[],\"lastnames\":[\"Ianovski\"],\"suffixes\":[]},{\"firstnames\":[\"Lan\"],\"propositions\":[],\"lastnames\":[\"Yu\"],\"suffixes\":[]},{\"firstnames\":[\"Edith\"],\"propositions\":[],\"lastnames\":[\"Elkind\"],\"suffixes\":[]},{\"firstnames\":[\"Mark\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Wilson\"],\"suffixes\":[]}],\"title\":\"The Complexity of Safe Manipulation under Scoring Rules\",\"booktitle\":\"IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011\",\"pages\":\"246-251\",\"year\":\"2011\",\"keywords\":\"social choice, voting, algorithms\",\"url\":\"http://ijcai.org/papers11/Papers/IJCAI11-052.pdf\",\"abstract\":\"Slinko and White have recently introduced a new model of coalitional manipulation of voting rules under limited communication, which they call safe strategic voting\\\". The computational aspects of this model were first studied by Hazon and Elkind, who provide polynomial-time algorithms for finding a safe strategic vote under $k$-approval and the Bucklin rule. In this paper, we answer an open question of Hazon and Elkind by presenting a polynomial-time algorithm for finding a safe strategic vote under the Borda rule. Our results for Borda generalize to several interesting classes of scoring rules.\",\"bibtex\":\"@inproceedings{IYEW2011,\\n  author    = {Egor Ianovski and\\n               Lan Yu and\\n               Edith Elkind and\\n               Mark C. Wilson},\\n  title     = {The Complexity of Safe Manipulation under Scoring Rules},\\n  booktitle = {{IJCAI} 2011, Proceedings of the 22nd International Joint Conference\\n               on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22,\\n               2011},\\n  pages     = {246-251},\\n  year      = {2011},\\n keywords={social choice, voting, algorithms},\\n url       = {http://ijcai.org/papers11/Papers/IJCAI11-052.pdf},\\n abstract={Slinko and White have recently introduced a new model of coalitional\\nmanipulation of voting rules under limited communication, which they\\ncall safe strategic voting\\\". The computational aspects of this model\\nwere first studied by Hazon and Elkind, who provide polynomial-time\\nalgorithms for finding a safe strategic vote under $k$-approval and the\\nBucklin rule. In this paper, we answer an open question of Hazon and\\nElkind by presenting a polynomial-time algorithm for finding a safe\\nstrategic vote under the Borda rule. Our results for Borda generalize to\\nseveral interesting classes of scoring rules.}\\n }\\n\\n\",\"author_short\":[\"Ianovski, E.\",\"Yu, L.\",\"Elkind, E.\",\"Wilson, M. C.\"],\"key\":\"IYEW2011\",\"id\":\"IYEW2011\",\"bibbaseid\":\"ianovski-yu-elkind-wilson-thecomplexityofsafemanipulationunderscoringrules-2011\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://ijcai.org/papers11/Papers/IJCAI11-052.pdf\"},\"keyword\":[\"social choice\",\"voting\",\"algorithms\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Reyhaneh\"],\"propositions\":[],\"lastnames\":[\"Reyhani\"],\"suffixes\":[]},{\"firstnames\":[\"Mark\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Wilson\"],\"suffixes\":[]}],\"title\":\"The Probability of Safe Manipulation\",\"booktitle\":\"COMSOC 2010, Düsseldorf, September 13-16, 2010\",\"pages\":\"423-430\",\"year\":\"2010\",\"keywords\":\"social choice, voting\",\"url\":\"http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/papers/comsoc2010.pdf\",\"abstract\":\"The concept of safe manipulation has recently been introduced by Slinko and White. We show how to compute the asymptotic probability that a safe manipulation exists for a given scoring rule under the uniform distribution on voting situations (the so- called Impartial Anonymous Culture). The technique used is computation of volumes of convex polytopes. We present explicit numerical results in the 3-candidate case.\",\"bibtex\":\"@inproceedings{ReWi2010,\\n  author    = {Reyhaneh Reyhani and\\n               Mark C. Wilson},\\n  title     = {The Probability of Safe Manipulation},\\n  booktitle = {COMSOC 2010, D\\\\\\\"{u}sseldorf, September 13-16, 2010},\\n  pages     = {423-430},\\n  year      = {2010},\\n  keywords={social choice, voting},\\n  url       = {http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/papers/comsoc2010.pdf},\\n  abstract={The concept of safe manipulation has recently been introduced by Slinko\\nand White. We show how to compute the asymptotic probability that a safe\\nmanipulation exists for a given scoring rule under the uniform\\ndistribution on voting situations (the so- called Impartial Anonymous\\nCulture). The technique used is computation of volumes of convex\\npolytopes. We present explicit numerical results in the 3-candidate\\ncase.}\\n}\\n\\n\\n\",\"author_short\":[\"Reyhani, R.\",\"Wilson, M. C.\"],\"key\":\"ReWi2010\",\"id\":\"ReWi2010\",\"bibbaseid\":\"reyhani-wilson-theprobabilityofsafemanipulation-2010\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/papers/comsoc2010.pdf\"},\"keyword\":[\"social choice\",\"voting\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Review of The mathematics of voting and elections: a hands-on approach by Jonathan K. Hodge and Richard E. Klima american mathematical society (mathematical world series, volume 22) 226+ xiv pages\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"ACM SIGACT News\",\"volume\":\"41\",\"number\":\"3\",\"pages\":\"34-36\",\"year\":\"2010\",\"publisher\":\"ACM New York, NY, USA\",\"keywords\":\"review\",\"url_paper\":\"\",\"abstract\":\"\",\"bibtex\":\"@article{wilson2010mathematics,\\n  title={Review of The mathematics of voting and elections: a hands-on approach by Jonathan K. Hodge and Richard E. Klima american mathematical society (mathematical world series, volume 22) 226+ xiv pages},\\n  author={Wilson, Mark C.},\\n  journal={ACM SIGACT News},\\n  volume={41},\\n  number={3},\\n  pages={34-36},\\n  year={2010},\\n  publisher={ACM New York, NY, USA},\\n  keywords={review},\\n  url_Paper={},\\n  abstract={}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson2010mathematics\",\"id\":\"wilson2010mathematics\",\"bibbaseid\":\"wilson-reviewofthemathematicsofvotingandelectionsahandsonapproachbyjonathankhodgeandrichardeklimaamericanmathematicalsocietymathematicalworldseriesvolume22226xivpages-2010\",\"role\":\"author\",\"urls\":{\" paper\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"review\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Asymptotics of coefficients of multivariate generating functions: improvements for multiple points\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Raichev\"],\"firstnames\":[\"Alexander\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"arXiv preprint arXiv:1009.5715\",\"year\":\"2010\",\"keywords\":\"ACSV theory\",\"url_paper\":\"\",\"abstract\":\"Let $F(x)= ∑_{ν∈ℕ^d} F_ν x^ν$ be a multivariate power series with complex coefficients that converges in a neighborhood of the origin. Assume $F=G/H$ for some functions $G$ and $H$ holomorphic in a neighborhood of the origin. We derive asymptotics for the coefficients $F_{rα}$ as $r \\\\to ∞$ with $rα ∈ ℕ^d$ for $α$ in a permissible subset of $d$-tuples of positive reals. More specifically, we give an algorithm for computing arbitrary terms of the asymptotic expansion for $F_{rα}$ when the asymptotics are controlled by a transverse multiple point of the analytic variety $H = 0$. This improves upon earlier work by R. Pemantle and M. C. Wilson. We have implemented our algorithm in Sage and apply it to obtain accurate numerical results for several rational combinatorial generating functions.\",\"bibtex\":\"@article{raichev2010asymptotics,\\n  title={Asymptotics of coefficients of multivariate generating functions: improvements for multiple points},\\n  author={Raichev, Alexander and Wilson, Mark C.},\\n  journal={arXiv preprint arXiv:1009.5715},\\n  year={2010},\\n  keywords={ACSV theory},\\n  url_Paper={},\\n  abstract={Let $F(x)= \\\\sum_{\\\\nu\\\\in\\\\mathbb{N}^d} F_\\\\nu x^\\\\nu$ be a multivariate\\npower series with complex coefficients that converges in a neighborhood\\nof the origin. Assume $F=G/H$ for some functions $G$ and $H$ holomorphic\\nin a neighborhood of the origin. We derive asymptotics for the\\ncoefficients $F_{r\\\\alpha}$ as $r \\\\to \\\\infty$ with $r\\\\alpha \\\\in\\n\\\\mathbb{N}^d$ for $\\\\alpha$ in a permissible subset of $d$-tuples of\\npositive reals. More specifically, we give an algorithm for computing\\narbitrary terms of the asymptotic expansion for $F_{r\\\\alpha}$ when the\\nasymptotics are controlled by a transverse multiple point of the\\nanalytic variety $H = 0$. This improves upon earlier work  by R.\\nPemantle and M. C. Wilson. We have implemented our algorithm in Sage and\\napply it to obtain accurate numerical results for several rational\\ncombinatorial generating functions.}\\n}\\n\\n\",\"author_short\":[\"Raichev, A.\",\"Wilson, M. C.\"],\"key\":\"raichev2010asymptotics\",\"id\":\"raichev2010asymptotics\",\"bibbaseid\":\"raichev-wilson-asymptoticsofcoefficientsofmultivariategeneratingfunctionsimprovementsformultiplepoints-2010\",\"role\":\"author\",\"urls\":{\" paper\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"ACSV theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"An interesting new Mahonian permutation statistic\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Electronic Journal of Combinatorics\",\"pages\":\"R147\",\"year\":\"2010\",\"keywords\":\"combinatorics\",\"url_paper\":\"https://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r147/pdf\",\"abstract\":\"The standard algorithm for generating a random permutation gives rise to an obvious permutation statistic DIS that is readily seen to be Mahonian. We give evidence showing that it is not equal to any previously published statistic. Nor does its joint distribution with the standard Eulerian statistics des and exc appear to coincide with any known Euler-Mahonian pair. A general construction of Skandera yields an Eulerian partner eul such that (eul, DIS) is equidistributed with (des, MAJ). However eul itself appears not to be a known Eulerian statistic. Several ideas for further research on this topic are listed.\",\"bibtex\":\"@article{wilson2010interesting,\\n  title={An interesting new Mahonian permutation statistic},\\n  author={Wilson, Mark C.},\\n  journal={Electronic Journal of Combinatorics},\\n  pages={R147},\\n  year={2010},\\n  keywords={combinatorics},\\n  url_Paper={https://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r147/pdf},\\n  abstract={The standard algorithm for generating a random permutation gives rise to\\nan obvious permutation statistic DIS that is readily seen to be\\nMahonian. We give evidence showing that it is not equal to any\\npreviously published statistic. Nor does its joint distribution with the\\nstandard Eulerian statistics des and exc appear to coincide with any\\nknown Euler-Mahonian pair.\\n\\nA general construction of Skandera yields an Eulerian partner eul such\\nthat (eul, DIS) is equidistributed with (des, MAJ). However eul itself\\nappears not to be a known Eulerian statistic.\\n\\nSeveral ideas for further research on this topic are listed.}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson2010interesting\",\"id\":\"wilson2010interesting\",\"bibbaseid\":\"wilson-aninterestingnewmahonianpermutationstatistic-2010\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r147/pdf\"},\"keyword\":[\"combinatorics\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":3,\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"incollection\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Pemantle\"],\"firstnames\":[\"Robin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"title\":\"Asymptotic expansions of oscillatory integrals with complex phase\",\"booktitle\":\"Algorithmic probability and combinatorics\",\"series\":\"Contemp. Math.\",\"volume\":\"520\",\"pages\":\"221-240\",\"publisher\":\"Amer. Math. Soc., Providence, RI\",\"year\":\"2010\",\"keywords\":\"ACSV theory\",\"url_paper\":\"https://arxiv.org/pdf/0903.3585.pdf\",\"abstract\":\"We consider saddle point integrals in $d$ variables whose phase function is neither real nor purely imaginary. Results analogous to those for Laplace (real phase) and Fourier (imaginary phase) integrals hold whenever the phase function is analytic and nondegenerate. These results generalize what is well known for integrals of Laplace and Fourier type. The method is via contour shifting in complex $d$-space. This work is motivated by applications to asymptotic enumeration.\",\"bibtex\":\"@incollection {PeWi2010,\\n    AUTHOR = {Pemantle, Robin and Wilson, Mark C.},\\n     TITLE = {Asymptotic expansions of oscillatory integrals with complex\\n              phase},\\n BOOKTITLE = {Algorithmic probability and combinatorics},\\n    SERIES = {Contemp. Math.},\\n    VOLUME = {520},\\n     PAGES = {221-240},\\n PUBLISHER = {Amer. Math. Soc., Providence, RI},\\n      YEAR = {2010},\\n       keywords={ACSV theory},\\n  url_Paper={https://arxiv.org/pdf/0903.3585.pdf},\\n  abstract={We consider saddle point integrals in $d$ variables whose phase function\\nis neither real nor purely imaginary. Results analogous to those for\\nLaplace (real phase) and Fourier (imaginary phase) integrals hold\\nwhenever the phase function is analytic and nondegenerate. These results\\ngeneralize what is well known for integrals of Laplace and Fourier type.\\nThe method is via contour shifting in complex $d$-space. This work is\\nmotivated by applications to asymptotic enumeration.}\\n}\\n\\n\",\"author_short\":[\"Pemantle, R.\",\"Wilson, M. C.\"],\"key\":\"PeWi2010\",\"id\":\"PeWi2010\",\"bibbaseid\":\"pemantle-wilson-asymptoticexpansionsofoscillatoryintegralswithcomplexphase-2010\",\"role\":\"author\",\"urls\":{\" paper\":\"https://arxiv.org/pdf/0903.3585.pdf\"},\"keyword\":[\"ACSV theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"book\",\"type\":\"book\",\"title\":\"Introduction to Algorithms, Data Structures and Formal Languages\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Dinneen\"],\"firstnames\":[\"Michael\",\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Gimel'farb\"],\"firstnames\":[\"Georgi˘ı\",\"L'vovich\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"year\":\"2009\",\"publisher\":\"Pearson Education New Zealand\",\"keywords\":\"algorithms, teaching\",\"url_paper\":\"\",\"abstract\":\"\",\"bibtex\":\"@book{dinneen2009introduction,\\n  title={Introduction to Algorithms, Data Structures and Formal Languages},\\n  author={Dinneen, Michael J. and Gimel'farb, Georgi{\\\\u\\\\i} L'vovich and Wilson, Mark C.},\\n  year={2009},\\n  publisher={Pearson Education New Zealand},\\n  keywords={algorithms, teaching},\\n  url_Paper={},\\n  abstract={}\\n}\\n\\n\",\"author_short\":[\"Dinneen, M. J.\",\"Gimel'farb, G. L.\",\"Wilson, M. C.\"],\"key\":\"dinneen2009introduction\",\"id\":\"dinneen2009introduction\",\"bibbaseid\":\"dinneen-gimelfarb-wilson-introductiontoalgorithmsdatastructuresandformallanguages-2009\",\"role\":\"author\",\"urls\":{\" paper\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"algorithms\",\"teaching\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Pritchard\"],\"firstnames\":[\"Geoffrey\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Mathematical Social Sciences\",\"volume\":\"58\",\"number\":\"1\",\"pages\":\"35-57\",\"year\":\"2009\",\"publisher\":\"North-Holland\",\"keywords\":\"social choice, voting, computation\",\"url_paper\":\"https://www.sciencedirect.com/science/article/abs/pii/S0165489609000225\",\"abstract\":\"We consider the problem of manipulation of elections using positional voting rules under Impartial Culture voter behaviour. We consider both the logical possibility of coalitional manipulation, and the number of voters that must be recruited to form a manipulating coalition. It is shown that the manipulation problem may be well approximated by a very simple linear program in two variables. This permits a comparative analysis of the asymptotic (large-population) manipulability of the various rules. It is seen that the manipulation resistance of positional rules with 5 or 6 (or more) candidates is quite different from the more commonly analyzed 3- and 4-candidate cases.\",\"bibtex\":\"@article{pritchard2009asymptotics,\\n  title={Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour},\\n  author={Pritchard, Geoffrey and Wilson, Mark C.},\\n  journal={Mathematical Social Sciences},\\n  volume={58},\\n  number={1},\\n  pages={35-57},\\n  year={2009},\\n  publisher={North-Holland},\\n  keywords={social choice, voting, computation},\\n  url_Paper={https://www.sciencedirect.com/science/article/abs/pii/S0165489609000225},\\n  abstract={We consider the problem of manipulation of elections using positional\\nvoting rules under Impartial Culture voter behaviour. We consider both\\nthe logical possibility of coalitional manipulation, and the number of\\nvoters that must be recruited to form a manipulating coalition. It is\\nshown that the manipulation problem may be well approximated by a very\\nsimple linear program in two variables. This permits a comparative\\nanalysis of the asymptotic (large-population) manipulability of the\\nvarious rules. It is seen that the manipulation resistance of positional\\nrules with 5 or 6 (or more) candidates is quite different from the more\\ncommonly analyzed 3- and 4-candidate cases.}\\n}\\n\\n\",\"author_short\":[\"Pritchard, G.\",\"Wilson, M. C.\"],\"key\":\"pritchard2009asymptotics\",\"id\":\"pritchard2009asymptotics\",\"bibbaseid\":\"pritchard-wilson-asymptoticsoftheminimummanipulatingcoalitionsizeforpositionalvotingrulesunderimpartialculturebehaviour-2009\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.sciencedirect.com/science/article/abs/pii/S0165489609000225\"},\"keyword\":[\"social choice\",\"voting\",\"computation\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Random and exhaustive generation of permutations and cycles\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Annals of Combinatorics\",\"volume\":\"12\",\"number\":\"4\",\"pages\":\"509-520\",\"year\":\"2009\",\"publisher\":\"SP Birkhäuser Verlag Basel\",\"keywords\":\"algorithms, combinatorics\",\"url_paper\":\"https://link.springer.com/content/pdf/10.1007/s00026-009-0003-3.pdf\",\"abstract\":\"In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. This algorithm is very similar to the standard method for generating a random permutation, but is less well known. We consider both methods in a unified way, and discuss their relation with exhaustive generation methods. We analyse several random variables associated with the algorithms and find their grand probability generating functions, which gives easy access to moments and limit laws.\",\"bibtex\":\"@article{wilson2009random,\\n  title={Random and exhaustive generation of permutations and cycles},\\n  author={Wilson, Mark C.},\\n  journal={Annals of Combinatorics},\\n  volume={12},\\n  number={4},\\n  pages={509-520},\\n  year={2009},\\n  publisher={SP Birkh{\\\\\\\"a}user Verlag Basel},\\n  keywords={algorithms, combinatorics},\\n  url_Paper={https://link.springer.com/content/pdf/10.1007/s00026-009-0003-3.pdf},\\n  abstract={In 1986 S. Sattolo introduced a simple algorithm for uniform random\\ngeneration of cyclic permutations on a fixed number of symbols. This\\nalgorithm is very similar to the standard method for generating a random\\npermutation, but is less well known. We consider both methods in a\\nunified way, and discuss their relation with exhaustive generation\\nmethods. We analyse several random variables associated with the\\nalgorithms and find their grand probability generating functions, which\\ngives easy access to moments and limit laws.}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson2009random\",\"id\":\"wilson2009random\",\"bibbaseid\":\"wilson-randomandexhaustivegenerationofpermutationsandcycles-2009\",\"role\":\"author\",\"urls\":{\" paper\":\"https://link.springer.com/content/pdf/10.1007/s00026-009-0003-3.pdf\"},\"keyword\":[\"algorithms\",\"combinatorics\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Twenty combinatorial examples of asymptotics derived from multivariate generating functions\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Pemantle\"],\"firstnames\":[\"Robin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"SIAM Review\",\"volume\":\"50\",\"number\":\"2\",\"pages\":\"199-272\",\"year\":\"2008\",\"publisher\":\"Society for Industrial and Applied Mathematics\",\"keywords\":\"ACSV theory\",\"url_paper\":\"https://epubs.siam.org/doi/epdf/10.1137/050643866\",\"abstract\":\"Let $F$ be a power series in at least two variables that defines a meromorphic function in a neighbourhood of the origin; for example, $F$ may be a rational multivariate generating function. We discuss recent results that allow the effective computation of asymptotic expansions for the coefficients of $F$, uniform in certain explicitly defined cones of directions. The purpose of this article is to illustrate the use of these techniques on a variety of problems of combinatorial interest. The first part reviews the Morse-theoretic underpinnings of these techniques, and then summarizes the necessary results so that only elementary analyses are needed to check hypotheses and carry out computations. The remainder focuses on combinatorial applications. Specific examples deal with enumeration of words with forbidden substrings, edges and cycles in graphs, polyominoes, descents and solutions to integer equations. After the individual examples, we discuss three broad classes of examples, namely functions derived via the transfer matrix method, those derived via the kernel method, and those derived via the method of Lagrange inversion. Generating functions derived in these three ways are amenable to our asymptotic analyses, and we state some further general results that apply to these cases.\",\"bibtex\":\"@article{pemantle2008twenty,\\n  title={Twenty combinatorial examples of asymptotics derived from multivariate generating functions},\\n  author={Pemantle, Robin and Wilson, Mark C.},\\n  journal={SIAM Review},\\n  volume={50},\\n  number={2},\\n  pages={199-272},\\n  year={2008},\\n  publisher={Society for Industrial and Applied Mathematics},\\n  keywords={ACSV theory},\\n  url_Paper={https://epubs.siam.org/doi/epdf/10.1137/050643866},\\n  abstract={Let $F$ be a power series in at least two variables that defines a\\nmeromorphic function in a neighbourhood of the origin; for example, $F$\\nmay be a rational multivariate generating function. We discuss recent\\nresults that allow the effective computation of asymptotic expansions\\nfor the coefficients of  $F$, uniform in certain explicitly defined\\ncones of directions.\\n\\nThe purpose of this article is to illustrate the use of these techniques\\non a variety of problems of combinatorial interest. The first part\\nreviews the Morse-theoretic underpinnings of these techniques, and then\\nsummarizes the necessary results so that only elementary analyses are\\nneeded to check hypotheses and carry out computations. The remainder\\nfocuses on combinatorial applications. Specific examples deal with\\nenumeration of words with forbidden substrings, edges and cycles in\\ngraphs, polyominoes, descents and solutions to integer equations. After\\nthe individual examples, we discuss three broad classes of examples,\\nnamely functions derived via the transfer matrix method, those derived\\nvia the kernel method, and those derived via the method of Lagrange\\ninversion. Generating functions derived in these three ways are amenable\\nto our asymptotic analyses, and we state some further general results\\nthat apply to these cases.}\\n}\\n\\n\",\"author_short\":[\"Pemantle, R.\",\"Wilson, M. C.\"],\"key\":\"pemantle2008twenty\",\"id\":\"pemantle2008twenty\",\"bibbaseid\":\"pemantle-wilson-twentycombinatorialexamplesofasymptoticsderivedfrommultivariategeneratingfunctions-2008\",\"role\":\"author\",\"urls\":{\" paper\":\"https://epubs.siam.org/doi/epdf/10.1137/050643866\"},\"keyword\":[\"ACSV theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Asymptotics of coefficients of multivariate generating functions: improvements for smooth points\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Raichev\"],\"firstnames\":[\"Alexander\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Electronic Journal of Combinatorics\",\"pages\":\"R89-R89\",\"year\":\"2008\",\"keywords\":\"ACSV theory\",\"url_paper\":\"https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r89/pdf\",\"abstract\":\"Let $∑_{β∈ℕ^d} F_β x^β$ be a multivariate power series, a generating function for a combinatorial class perhaps. Assume that in a neighborhood of the origin this series represents a nonentire function $F=G/H^p$ where $G$ and $H$ are holomorphic and $p$ is a positive integer. Given a direction $α∈ℕ_+^d$ for which asymptotics are controlled by a smooth point of the singular variety $H = 0$, we compute the asymptotics of $F_{nα}$ as $n\\\\to∞$. We do this via multivariate singularity analysis and give an explicit formula for the full asymptotic expansion. This improves on earlier work of R. Pemantle and the second author, and allows for much more accurate numerical approximation, as demonstrated in our examples.\",\"bibtex\":\"@article{raichev2008asymptotics,\\n  title={Asymptotics of coefficients of multivariate generating functions: improvements for smooth points},\\n  author={Raichev, Alexander and Wilson, Mark C.},\\n  journal={Electronic Journal of Combinatorics},\\n  pages={R89-R89},\\n  year={2008},\\n  keywords={ACSV theory},\\n  url_Paper={https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r89/pdf},\\n  abstract={Let $\\\\sum_{\\\\beta\\\\in\\\\mathbb{N}^d} F_\\\\beta x^\\\\beta$ be a multivariate\\npower series, a generating function for a combinatorial class perhaps.\\nAssume that in a neighborhood of the origin this series represents a\\nnonentire function $F=G/H^p$ where $G$ and $H$ are holomorphic and $p$\\nis a positive integer. Given a direction $\\\\alpha\\\\in\\\\mathbb{N}_+^d$ for\\nwhich asymptotics are controlled by a smooth point of the singular\\nvariety $H = 0$, we compute the asymptotics of $F_{n\\\\alpha}$ as\\n$n\\\\to\\\\infty$. We do this via multivariate singularity analysis and give\\nan explicit formula for the full asymptotic expansion. This improves on\\nearlier work of R. Pemantle and the second author, and allows for much\\nmore accurate numerical approximation, as demonstrated in our examples.}\\n}\\n\\n\",\"author_short\":[\"Raichev, A.\",\"Wilson, M. C.\"],\"key\":\"raichev2008asymptotics\",\"id\":\"raichev2008asymptotics\",\"bibbaseid\":\"raichev-wilson-asymptoticsofcoefficientsofmultivariategeneratingfunctionsimprovementsforsmoothpoints-2008\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r89/pdf\"},\"keyword\":[\"ACSV theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Raichev\"],\"firstnames\":[\"Alexander\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"booktitle\":\"2007 Conference on Analysis of Algorithms, AofA 07\",\"title\":\"A new method for computing asymptotics of diagonal coefficients of multivariate generating functions\",\"pages\":\"439-449\",\"publisher\":\"Assoc. Discrete Math. Theor. Comput. Sci., Nancy\",\"series\":\"Discrete Math. Theor. Comput. Sci. Proc., AH\",\"abstract\":\"Let $∑_{\\\\mathbf{n}∈ℕ^d} F_\\\\mathbf{n} \\\\mathbf{x}^\\\\mathbf{n}$ be a multivariate generating function that converges in a neighborhood of the origin of $ℂ^d$. We present a new, multivariate method for computing the asymptotics of the diagonal coefficients $F_{a_1n,…,a_dn}$ and show its superiority over the standard, univariate diagonal method. Several examples are given in detail.\",\"keywords\":\"ACSV theory\",\"url_link\":\"https://dmtcs.episciences.org/3531/pdf\",\"year\":\"2007\",\"bibtex\":\"@InProceedings{RaWi2007,\\n  author    = {Raichev, Alexander and Wilson, Mark C.},\\n  booktitle = {2007 {C}onference on {A}nalysis of {A}lgorithms, {A}of{A} 07},\\n  title     = {A new method for computing asymptotics of diagonal coefficients of multivariate generating functions},\\n  pages     = {439-449},\\n  publisher = {Assoc. Discrete Math. Theor. Comput. Sci., Nancy},\\n  series    = {Discrete Math. Theor. Comput. Sci. Proc., AH},\\n  abstract  = {Let $\\\\sum_{\\\\mathbf{n}\\\\in\\\\mathbb{N}^d} F_\\\\mathbf{n}\\n\\\\mathbf{x}^\\\\mathbf{n}$ be a multivariate generating function that\\nconverges in a neighborhood of the origin of $\\\\mathbb{C}^d$. We present\\na new, multivariate method for computing the asymptotics of the diagonal\\ncoefficients $F_{a_1n,\\\\ldots,a_dn}$ and show its superiority over the\\nstandard, univariate diagonal method. Several examples are given in\\ndetail.},\\n  keywords  = {ACSV theory},\\n  url_link  = {https://dmtcs.episciences.org/3531/pdf},\\n  year      = {2007},\\n}\\n\\n\",\"author_short\":[\"Raichev, A.\",\"Wilson, M. C.\"],\"key\":\"RaWi2007\",\"id\":\"RaWi2007\",\"bibbaseid\":\"raichev-wilson-anewmethodforcomputingasymptoticsofdiagonalcoefficientsofmultivariategeneratingfunctions-2007\",\"role\":\"author\",\"urls\":{\" link\":\"https://dmtcs.episciences.org/3531/pdf\"},\"keyword\":[\"ACSV theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Probability calculations under the IAC hypothesis\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Pritchard\"],\"firstnames\":[\"Geoffrey\"],\"suffixes\":[]}],\"journal\":\"Mathematical Social Sciences\",\"volume\":\"54\",\"number\":\"3\",\"pages\":\"244-256\",\"year\":\"2007\",\"publisher\":\"North-Holland\",\"keywords\":\"social choice, voting, computation\",\"url_paper\":\"https://www.sciencedirect.com/science/article/abs/pii/S0165489607000443\",\"abstract\":\"We show how powerful algorithms recently developed for counting lattice points and computing volumes of convex polyhedra can be used to compute probabilities of a wide variety of events of interest in social choice theory. Several illustrative examples are given.\",\"bibtex\":\"@article{wilson2007probability,\\n  title={Probability calculations under the IAC hypothesis},\\n  author={Wilson, Mark C. and Pritchard, Geoffrey},\\n  journal={Mathematical Social Sciences},\\n  volume={54},\\n  number={3},\\n  pages={244-256},\\n  year={2007},\\n  publisher={North-Holland},\\n  keywords={social choice, voting, computation},\\n  url_Paper={https://www.sciencedirect.com/science/article/abs/pii/S0165489607000443},\\n  abstract={We show how powerful algorithms recently developed for counting lattice\\npoints and computing volumes of convex polyhedra can be used to compute\\nprobabilities of a wide variety of events of interest in social choice\\ntheory. Several illustrative examples are given.}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\",\"Pritchard, G.\"],\"key\":\"wilson2007probability\",\"id\":\"wilson2007probability\",\"bibbaseid\":\"wilson-pritchard-probabilitycalculationsundertheiachypothesis-2007\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.sciencedirect.com/science/article/abs/pii/S0165489607000443\"},\"keyword\":[\"social choice\",\"voting\",\"computation\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Exact results on manipulability of positional voting rules\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Pritchard\"],\"firstnames\":[\"Geoffrey\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Social Choice and Welfare\",\"volume\":\"29\",\"number\":\"3\",\"pages\":\"487-513\",\"year\":\"2007\",\"publisher\":\"Springer-Verlag\",\"keywords\":\"social choice, voting\",\"url_paper\":\"https://link.springer.com/content/pdf/10.1007/s00355-007-0216-5.pdf\",\"url_link\":\"https://link.springer.com/article/10.1007/s00355-007-0216-5\",\"abstract\":\"We consider 3-candidate elections under a general scoring rule and derive precise conditions for a given voting situation to be strategically manipulable by a given coalition of voters. We present an algorithm that makes use of these conditions to compute the minimum size $M$ of a manipulating coalition for a given voting situation. The algorithm works for any voter preference model - here we present numerical results for IC and for IAC, for a selection of scoring rules, and for numbers of voters up to 150. A full description of the distribution of $M$ is obtained, generalizing all previous work on the topic. The results obtained show interesting phenomena and suggest several conjectures. In particular we see that rules `` between plurality and Borda\\\" behave very differently from those `` between Borda and antiplurality\\\".\",\"bibtex\":\"@article{pritchard2007exact,\\n  title={Exact results on manipulability of positional voting rules},\\n  author={Pritchard, Geoffrey and Wilson, Mark C.},\\n  journal={Social Choice and Welfare},\\n  volume={29},\\n  number={3},\\n  pages={487-513},\\n  year={2007},\\n  publisher={Springer-Verlag},\\n  keywords={social choice, voting},\\n  url_Paper={https://link.springer.com/content/pdf/10.1007/s00355-007-0216-5.pdf},\\n  url_Link={https://link.springer.com/article/10.1007/s00355-007-0216-5},\\n  abstract={We consider 3-candidate elections under a general scoring rule and\\nderive precise conditions for a given voting situation to be\\nstrategically manipulable by a given coalition of voters. We present an\\nalgorithm that makes use of these conditions to compute the minimum size\\n$M$ of a manipulating coalition for a given voting situation. The\\nalgorithm works for any voter preference model - here we present\\nnumerical results for IC and for IAC, for a selection of scoring rules,\\nand for numbers of voters up to 150. A full description of the\\ndistribution of $M$ is obtained, generalizing all previous work on the\\ntopic. The results obtained show interesting phenomena and suggest\\nseveral conjectures. In particular we see that rules {``} between\\nplurality and Borda{\\\"} behave very differently from those {``} between\\nBorda and antiplurality{\\\"}.}\\n}\\n\\n\",\"author_short\":[\"Pritchard, G.\",\"Wilson, M. C.\"],\"key\":\"pritchard2007exact\",\"id\":\"pritchard2007exact\",\"bibbaseid\":\"pritchard-wilson-exactresultsonmanipulabilityofpositionalvotingrules-2007\",\"role\":\"author\",\"urls\":{\" paper\":\"https://link.springer.com/content/pdf/10.1007/s00355-007-0216-5.pdf\",\" link\":\"https://link.springer.com/article/10.1007/s00355-007-0216-5\"},\"keyword\":[\"social choice\",\"voting\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"downloads\":1,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"title\":\"Asymptotics for generalized Riordan arrays\",\"booktitle\":\"2005 International Conference on Analysis of Algorithms\",\"series\":\"Discrete Math. Theor. Comput. Sci. Proc., AD\",\"pages\":\"323-333 (electronic)\",\"publisher\":\"Assoc. Discrete Math. Theor. Comput. Sci., Nancy\",\"year\":\"2005\",\"keywords\":\"ACSV theory\",\"url_paper\":\"https://dmtcs.episciences.org/3389/pdf\",\"abstract\":\"The machinery of Riordan arrays has been used recently by several authors. We show how meromorphic singularity analysis can be used to provide uniform bivariate asymptotic expansions, in the central regime, for a generalization of these arrays. We show how to do this systematically, for various descriptions of the array. Several examples from recent literature are given.\",\"bibtex\":\"@inproceedings {Wils2005,\\n    AUTHOR = {Wilson, Mark C.},\\n     TITLE = {Asymptotics for generalized {R}iordan arrays},\\n BOOKTITLE = {2005 {I}nternational {C}onference on {A}nalysis of\\n              {A}lgorithms},\\n    SERIES = {Discrete Math. Theor. Comput. Sci. Proc., AD},\\n     PAGES = {323-333 (electronic)},\\n PUBLISHER = {Assoc. Discrete Math. Theor. Comput. Sci., Nancy},\\n      YEAR = {2005},\\n       keywords={ACSV theory},\\n  url_Paper={https://dmtcs.episciences.org/3389/pdf},\\n  abstract={The machinery of Riordan arrays has been used recently by several\\nauthors. We show how meromorphic singularity analysis can be used to\\nprovide uniform bivariate asymptotic expansions, in the central regime,\\nfor a generalization of these arrays. We show how to do this\\nsystematically, for various descriptions of the array. Several examples\\nfrom recent literature are given.}\\n }\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"Wils2005\",\"id\":\"Wils2005\",\"bibbaseid\":\"wilson-asymptoticsforgeneralizedriordanarrays-2005\",\"role\":\"author\",\"urls\":{\" paper\":\"https://dmtcs.episciences.org/3389/pdf\"},\"keyword\":[\"ACSV theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Asymptotics of multivariate sequences II: multiple points of the singular variety\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Pemantle\"],\"firstnames\":[\"Robin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Combinatorics, Probability and Computing\",\"volume\":\"13\",\"number\":\"4-5\",\"pages\":\"735-761\",\"year\":\"2004\",\"publisher\":\"Cambridge University Press\",\"keywords\":\"ACSV theory\",\"url_paper\":\"https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/asymptotics-of-multivariate-sequences-ii-multiple-points-of-the-singular-variety/F8B144EBED2754E43361A3BE4B0C3B01\",\"abstract\":\"Let $F(\\\\b{z})=∑_\\\\b{r} a_\\\\b{r}\\\\b{z^r}$ be a multivariate generating function which is meromorphic in some neighborhood of the origin of $ℂ^d$, and let $\\\\mathcal{V}$ be its set of singularities. Effective asymptotic expansions for the coefficients can be obtained by complex contour integration near points of $\\\\mathcal{V}$. In the first article in this series, we treated the case of smooth points of $\\\\mathcal{V}$. In this article we deal with multiple points of $\\\\mathcal{V}$. Our results show that the central limit (Ornstein-Zernike) behavior typical of the smooth case does not hold in the multiple point case. For example, when $\\\\mathcal{V}$ has a multiple point singularity at $(1 , … , 1)$, rather than $a_\\\\b{r}$ decaying as $|\\\\b{r}|^{-1/2}$ as $|\\\\b{r}| \\\\to ∞$, $a_\\\\b{r}$ is very nearly polynomial in a cone of directions.\",\"bibtex\":\"@article{pemantle2004asymptotics,\\n  title={Asymptotics of multivariate sequences II: multiple points of the singular variety},\\n  author={Pemantle, Robin and Wilson, Mark C.},\\n  journal={Combinatorics, Probability and Computing},\\n  volume={13},\\n  number={4-5},\\n  pages={735-761},\\n  year={2004},\\n  publisher={Cambridge University Press},\\n  keywords={ACSV theory},\\n  url_Paper={https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/asymptotics-of-multivariate-sequences-ii-multiple-points-of-the-singular-variety/F8B144EBED2754E43361A3BE4B0C3B01},\\n  abstract={Let $F(\\\\b{z})=\\\\sum_\\\\b{r} a_\\\\b{r}\\\\b{z^r}$ be a multivariate  generating\\nfunction which is meromorphic in some neighborhood of the origin of\\n$\\\\mathbb{C}^d$, and let $\\\\mathcal{V}$ be its set of singularities.\\nEffective asymptotic expansions for the coefficients can be obtained by\\ncomplex contour integration near points of $\\\\mathcal{V}$. In the first\\narticle in this series, we treated the case of smooth points  of\\n$\\\\mathcal{V}$. In this article we deal with multiple points of\\n$\\\\mathcal{V}$. Our results show that the central limit\\n(Ornstein-Zernike) behavior typical of the smooth case does not hold in\\nthe multiple point case. For example, when $\\\\mathcal{V}$ has a multiple\\npoint singularity at $(1 , \\\\ldots , 1)$, rather than $a_\\\\b{r}$ decaying\\nas $|\\\\b{r}|^{-1/2}$ as $|\\\\b{r}| \\\\to \\\\infty$, $a_\\\\b{r}$ is very nearly\\npolynomial in a cone of directions.}\\n}\\n\\n\",\"author_short\":[\"Pemantle, R.\",\"Wilson, M. C.\"],\"key\":\"pemantle2004asymptotics\",\"id\":\"pemantle2004asymptotics\",\"bibbaseid\":\"pemantle-wilson-asymptoticsofmultivariatesequencesiimultiplepointsofthesingularvariety-2004\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/asymptotics-of-multivariate-sequences-ii-multiple-points-of-the-singular-variety/F8B144EBED2754E43361A3BE4B0C3B01\"},\"keyword\":[\"ACSV theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Degree-and time-constrained broadcast networks\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Dinneen\"],\"firstnames\":[\"Michael\",\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Pritchard\"],\"firstnames\":[\"Geoffrey\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Networks\",\"volume\":\"39\",\"number\":\"3\",\"pages\":\"121-129\",\"year\":\"2002\",\"publisher\":\"Wiley\",\"keywords\":\"combinatorics, algorithms, graphs\",\"url_paper\":\"DPW2002.pdf\",\"abstract\":\"We consider the problem of constructing networks with as many nodes as possible, subject to upper bounds on the degree and broadcast time. The paper includes the results of an extensive empirical study of broadcasting in small regular graphs using a stochastic search algorithm to approximate the broadcast time. Significant improvements on known results are obtained for cubic broadcast networks.\",\"bibtex\":\"@article{dinneen2002degree,\\n  title={Degree-and time-constrained broadcast networks},\\n  author={Dinneen, Michael J. and Pritchard, Geoffrey and Wilson, Mark C.},\\n  journal={Networks},\\n  volume={39},\\n  number={3},\\n  pages={121-129},\\n  year={2002},\\n  publisher={Wiley},\\n  keywords={combinatorics, algorithms, graphs},\\n  url_Paper={DPW2002.pdf},\\n  abstract={We consider the problem of constructing networks with as many nodes as\\npossible, subject to upper bounds on the degree and broadcast time. The\\npaper includes the results of an extensive empirical study of\\nbroadcasting in small regular graphs using a stochastic search algorithm\\nto approximate the broadcast time. Significant improvements on known\\nresults are obtained for cubic broadcast networks.} \\n}\\n\\n\",\"author_short\":[\"Dinneen, M. J.\",\"Pritchard, G.\",\"Wilson, M. C.\"],\"key\":\"dinneen2002degree\",\"id\":\"dinneen2002degree\",\"bibbaseid\":\"dinneen-pritchard-wilson-degreeandtimeconstrainedbroadcastnetworks-2002\",\"role\":\"author\",\"urls\":{\" paper\":\"https://drive.google.com/DPW2002.pdf\"},\"keyword\":[\"combinatorics\",\"algorithms\",\"graphs\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Asymptotics of multivariate sequences: I. smooth points of the singular variety\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Pemantle\"],\"firstnames\":[\"Robin\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Journal of Combinatorial Theory, Series A\",\"volume\":\"97\",\"number\":\"1\",\"pages\":\"129-161\",\"year\":\"2002\",\"publisher\":\"Academic Press\",\"keywords\":\"ACSV theory\",\"url_paper\":\"https://www.sciencedirect.com/science/article/pii/S0097316501932017\",\"abstract\":\"Given a multivariate generating function $F(z_1 , … , z_d) = ∑ a_{r_1 , … , r_d} z_1^{r_1} ⋯ z_d^{r_d}$, we determine asymptotics for the coefficients. Our approach is to use Cauchy's integral formula near singular points of $F$, resulting in a tractable oscillating integral. This paper treats the case where the singular point of $F$ is a smooth point of a surface of poles. Companion papers G treat singular points of $F$ where the local geometry is more complicated, and for which other methods of analysis are not known.\",\"bibtex\":\"@article{pemantle2002asymptotics,\\n  title={Asymptotics of multivariate sequences: I. smooth points of the singular variety},\\n  author={Pemantle, Robin and Wilson, Mark C.},\\n  journal={Journal of Combinatorial Theory, Series A},\\n  volume={97},\\n  number={1},\\n  pages={129-161},\\n  year={2002},\\n  publisher={Academic Press},\\n  keywords={ACSV theory},\\n  url_Paper={https://www.sciencedirect.com/science/article/pii/S0097316501932017},\\n  abstract={Given a multivariate generating function $F(z_1 , \\\\ldots , z_d) = \\\\sum\\na_{r_1 , \\\\ldots , r_d} z_1^{r_1} \\\\cdots z_d^{r_d}$, we determine\\nasymptotics for the coefficients. Our approach is to use Cauchy's\\nintegral formula near singular points of $F$, resulting in a tractable\\noscillating integral. This paper treats the case where the singular\\npoint of $F$ is a smooth point of a surface of poles. Companion papers G\\ntreat singular points of $F$ where the local geometry is more\\ncomplicated, and for which other methods of analysis are not known.}\\n}\\n\\n\",\"author_short\":[\"Pemantle, R.\",\"Wilson, M. C.\"],\"key\":\"pemantle2002asymptotics\",\"id\":\"pemantle2002asymptotics\",\"bibbaseid\":\"pemantle-wilson-asymptoticsofmultivariatesequencesismoothpointsofthesingularvariety-2002\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.sciencedirect.com/science/article/pii/S0097316501932017\"},\"keyword\":[\"ACSV theory\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"misc\",\"title\":\"Submission to the Tertiary Education Advisory Commission\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Gracewood\"],\"firstnames\":[\"Jolisa\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Easther\"],\"firstnames\":[\"Richard\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Peet\"],\"firstnames\":[\"Amanda\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Elleray\"],\"firstnames\":[\"Michelle\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Somerville\"],\"firstnames\":[\"A.T.\"],\"suffixes\":[]}],\"year\":\"2000\",\"keywords\":\"advocacy\",\"url_paper\":\"\",\"abstract\":\"\",\"bibtex\":\"@misc{wilson2000submission,\\n  title={Submission to the Tertiary Education Advisory Commission},\\n  author={Wilson, Mark C. and Gracewood, Jolisa and Easther, Richard and Peet, Amanda and \\n  Elleray, Michelle and Somerville, A.T.},\\n  year={2000},\\n  keywords={advocacy},\\n  url_Paper={},\\n  abstract={}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\",\"Gracewood, J.\",\"Easther, R.\",\"Peet, A.\",\"Elleray, M.\",\"Somerville, A.\"],\"key\":\"wilson2000submission\",\"id\":\"wilson2000submission\",\"bibbaseid\":\"wilson-gracewood-easther-peet-elleray-somerville-submissiontothetertiaryeducationadvisorycommission-2000\",\"role\":\"author\",\"urls\":{\" paper\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"advocacy\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"X-inner automorphisms of semi-commutative quantum algebras\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Bergen\"],\"firstnames\":[\"Jeffrey\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Journal of Algebra\",\"volume\":\"220\",\"number\":\"1\",\"pages\":\"152-173\",\"year\":\"1999\",\"publisher\":\"Academic Press\",\"keywords\":\"algebra\",\"url_paper\":\"https://www.sciencedirect.com/science/article/pii/S0021869399979279\",\"abstract\":\"Many important quantum algebras such as quantum symplectic space, quantum euclidean space, quantum matrices, $q$-analogs of the Heisenberg algebra and the quantum Weyl algebra are semi-commutative. In addition, enveloping algebras $U(L_+)$ of even Lie color algebras are also semi-commutative. In this paper, we generalize work of Montgomery and examine the X-inner automorphisms of such algebras. The theorems and examples in our paper show that for algebras $R$ of this type, the non-identity X-inner automorphisms of $R$ tend to have infinite order. Thus if $G$ is a finite group of automorphisms of $R$, then the action of $G$ will be X-outer and this immediately gives useful information about crossed products $R∗_t G$.\",\"bibtex\":\"@article{bergen1999x,\\n  title={X-inner automorphisms of semi-commutative quantum algebras},\\n  author={Bergen, Jeffrey and Wilson, Mark C.},\\n  journal={Journal of Algebra},\\n  volume={220},\\n  number={1},\\n  pages={152-173},\\n  year={1999},\\n  publisher={Academic Press},\\n  keywords={algebra},\\n  url_Paper={https://www.sciencedirect.com/science/article/pii/S0021869399979279},\\n  abstract={Many important quantum algebras such as quantum symplectic space,\\nquantum euclidean space, quantum matrices, $q$-analogs of the Heisenberg\\nalgebra and the quantum Weyl algebra are semi-commutative. In addition,\\nenveloping algebras $U(L_+)$ of even Lie color algebras are also\\nsemi-commutative. In this paper, we generalize work of Montgomery and\\nexamine the X-inner automorphisms of such algebras. The theorems and\\nexamples in our paper show that for algebras $R$ of this type, the\\nnon-identity X-inner automorphisms of  $R$ tend to have infinite order.\\nThus if $G$ is a finite group of automorphisms of $R$, then the action\\nof $G$ will be X-outer and this immediately gives useful information\\nabout crossed products  $R∗_t G$.}\\n}\\n\\n\",\"author_short\":[\"Bergen, J.\",\"Wilson, M. C.\"],\"key\":\"bergen1999x\",\"id\":\"bergen1999x\",\"bibbaseid\":\"bergen-wilson-xinnerautomorphismsofsemicommutativequantumalgebras-1999\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.sciencedirect.com/science/article/pii/S0021869399979279\"},\"keyword\":[\"algebra\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Associative algebras satisfying a semigroup identity\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Riley\"],\"firstnames\":[\"D.M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Glasgow Mathematical Journal\",\"volume\":\"41\",\"number\":\"3\",\"pages\":\"453-462\",\"year\":\"1999\",\"publisher\":\"Cambridge University Press\",\"keywords\":\"algebra\",\"url_paper\":\"https://www.cambridge.org/core/journals/glasgow-mathematical-journal/article/associative-algebras-satisfying-a-semigroup-identity/89A9FE38678C0635AE59E0B3286291CA\",\"abstract\":\"Denote by $(R,·)$ the multiplicative semigroup of an associative algebra $R$ over an infinite field, and let $(R,∘)$ represent $R$ when viewed as a semigroup via the circle operation $x∘ y=x+y+xy$. In this paper we characterize the existence of an identity in these semigroups in terms of the Lie structure of $R$. Namely, we prove that the following conditions on $R$ are equivalent: the semigroup $(R,∘)$ satisfies an identity; the semigroup $(R,·)$ satisfies a reduced identity; and, the associated Lie algebra of $R$ satisfies the Engel condition. When $R$ is finitely generated these conditions are each equivalent to $R$ being upper Lie nilpotent.\",\"bibtex\":\"@article{riley1999associative,\\n  title={Associative algebras satisfying a semigroup identity},\\n  author={Riley, D.M. and Wilson, Mark C.},\\n  journal={Glasgow Mathematical Journal},\\n  volume={41},\\n  number={3},\\n  pages={453-462},\\n  year={1999},\\n  publisher={Cambridge University Press},\\n  keywords={algebra},\\n  url_Paper={https://www.cambridge.org/core/journals/glasgow-mathematical-journal/article/associative-algebras-satisfying-a-semigroup-identity/89A9FE38678C0635AE59E0B3286291CA},\\n  abstract={Denote by $(R,\\\\cdot)$ the multiplicative semigroup of an associative\\nalgebra $R$ over an infinite field, and let $(R,\\\\circ)$ represent $R$\\nwhen viewed as a semigroup via the circle operation $x\\\\circ y=x+y+xy$.\\nIn this paper we characterize the existence of an identity in these\\nsemigroups in terms of the Lie structure of $R$. Namely, we prove that\\nthe following conditions on $R$ are equivalent: the semigroup\\n$(R,\\\\circ)$ satisfies an identity; the semigroup $(R,\\\\cdot)$ satisfies a\\nreduced identity; and, the associated Lie algebra of $R$ satisfies the\\nEngel condition. When $R$ is finitely generated these conditions are\\neach equivalent to $R$ being upper Lie nilpotent.}\\n}\\n\\n\",\"author_short\":[\"Riley, D.\",\"Wilson, M. C.\"],\"key\":\"riley1999associative-1\",\"id\":\"riley1999associative-1\",\"bibbaseid\":\"riley-wilson-associativealgebrassatisfyingasemigroupidentity-1999\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.cambridge.org/core/journals/glasgow-mathematical-journal/article/associative-algebras-satisfying-a-semigroup-identity/89A9FE38678C0635AE59E0B3286291CA\"},\"keyword\":[\"algebra\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Construction of time-relaxed minimal broadcast networks\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Dinneen\"],\"firstnames\":[\"Michael\",\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ventura\"],\"firstnames\":[\"Jose\",\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zakeri\"],\"firstnames\":[\"Golbon\"],\"suffixes\":[]}],\"journal\":\"Parallel Processing Letters\",\"volume\":\"9\",\"number\":\"01\",\"pages\":\"53-68\",\"year\":\"1999\",\"publisher\":\"World Scientific Publishing Company\",\"keywords\":\"algorithms, combinatorics, graphs\",\"url_paper\":\"https://www.worldscientific.com/doi/abs/10.1142/S0129626499000086\",\"abstract\":\"In broadcasting, or one-to-all communication, a message originally held in one node of the network must be transmitted to all the other nodes. A minimal broadcast network is a communication network that can transmit a message originated at any node to all other nodes of the network in minimum time. In this paper, we present a compound method to construct sparse, time-relaxed, minimal broadcast networks ( $t$-mbn), in which broadcasting can be accomplished in slightly more than the minimum time. The proposed method generates a new network by connecting a subset of nodes from several copies of a $t_1$-mbn using the structure of another $t_2$-mbn. The objective is to construct a network as sparse as possible satisfying the desired broadcasting time constraint. Computational results illustrate the effectiveness of the proposed method.\",\"bibtex\":\"@article{dinneen1999construction,\\n  title={Construction of time-relaxed minimal broadcast networks},\\n  author={Dinneen, Michael J. and Ventura, Jose A. and Wilson, Mark C. and Zakeri, Golbon},\\n  journal={Parallel Processing Letters},\\n  volume={9},\\n  number={01},\\n  pages={53-68},\\n  year={1999},\\n  publisher={World Scientific Publishing Company},\\n  keywords={algorithms, combinatorics, graphs},\\n  url_Paper={https://www.worldscientific.com/doi/abs/10.1142/S0129626499000086},\\n  abstract={In broadcasting, or one-to-all communication, a message originally held\\nin one node of the network must be transmitted to all the other nodes. A\\nminimal broadcast network is a communication network that can transmit a\\nmessage originated at any node to all other nodes of the network in\\nminimum time. In this paper, we present a compound method to construct\\nsparse, time-relaxed, minimal broadcast networks ( $t$-mbn), in which\\nbroadcasting can be accomplished in slightly more than the minimum time.\\nThe proposed method generates a new network by connecting a subset of\\nnodes from several copies of a $t_1$-mbn using the structure of another\\n$t_2$-mbn. The objective is to construct a network as sparse as possible\\nsatisfying the desired broadcasting time constraint. Computational\\nresults illustrate the effectiveness of the proposed method.}\\n}\\n\\n\",\"author_short\":[\"Dinneen, M. J.\",\"Ventura, J. A.\",\"Wilson, M. C.\",\"Zakeri, G.\"],\"key\":\"dinneen1999construction\",\"id\":\"dinneen1999construction\",\"bibbaseid\":\"dinneen-ventura-wilson-zakeri-constructionoftimerelaxedminimalbroadcastnetworks-1999\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.worldscientific.com/doi/abs/10.1142/S0129626499000086\"},\"keyword\":[\"algorithms\",\"combinatorics\",\"graphs\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Group algebras and enveloping algebras with nonmatrix and semigroup identities\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Riley\"],\"firstnames\":[\"D.M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Communications in Algebra\",\"volume\":\"27\",\"number\":\"7\",\"pages\":\"3545-3556\",\"year\":\"1999\",\"publisher\":\"Taylor & Francis\",\"keywords\":\"algebra\",\"url_paper\":\"https://www.tandfonline.com/doi/abs/10.1080/00927879908826645\",\"abstract\":\"Let $K$ be a field of characteristic $p>0$. Denote by $ω(R)$ the augmentation ideal of either a group algebra $R=K[G]$ or a restricted enveloping algebra $R=u(L)$ over $K$. We first characterize those $R$ for which $ω(R)$ satisfies a polynomial identity not satisfied by the algebra of all $2× 2$ matrices over $K$. Then, we examine those $R$ for which $ω(R)$ satisfies a semigroup identity (that is, a polynomial identity which can be written as the difference of two monomials).\",\"bibtex\":\"@article{riley1999group,\\n  title={Group algebras and enveloping algebras with nonmatrix and semigroup identities},\\n  author={Riley, D.M. and Wilson, Mark C.},\\n  journal={Communications in Algebra},\\n  volume={27},\\n  number={7},\\n  pages={3545-3556},\\n  year={1999},\\n  publisher={Taylor \\\\& Francis},\\n  keywords={algebra},\\n  url_Paper={https://www.tandfonline.com/doi/abs/10.1080/00927879908826645},\\n  abstract={Let $K$ be a field of characteristic $p>0$.  Denote by $\\\\omega(R)$ the\\naugmentation ideal of either a group algebra $R=K[G]$ or a restricted\\nenveloping algebra $R=u(L)$ over $K$.   We first characterize those $R$\\nfor which $\\\\omega(R)$ satisfies a polynomial identity not satisfied by\\nthe algebra of all $2\\\\times 2$ matrices over $K$. Then, we examine those\\n$R$ for which $\\\\omega(R)$ satisfies a semigroup identity (that is, a\\npolynomial identity which can be written as the difference of two\\nmonomials).}\\n}\\n\\n\",\"author_short\":[\"Riley, D.\",\"Wilson, M. C.\"],\"key\":\"riley1999group\",\"id\":\"riley1999group\",\"bibbaseid\":\"riley-wilson-groupalgebrasandenvelopingalgebraswithnonmatrixandsemigroupidentities-1999\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.tandfonline.com/doi/abs/10.1080/00927879908826645\"},\"keyword\":[\"algebra\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Associative rings satisfying the Engel condition\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Riley\"],\"firstnames\":[\"D.M.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Proceedings of the American Mathematical Society\",\"volume\":\"127\",\"number\":\"4\",\"pages\":\"973-976\",\"year\":\"1999\",\"keywords\":\"algebra\",\"url_paper\":\"https://www.ams.org/journals/proc/1999-127-04/S0002-9939-99-04643-2/S0002-9939-99-04643-2.pdf\",\"abstract\":\"Let $C$ be a commutative ring, and let $R$ be an associative $C$-algebra generated by elements $\\\\{x_1,…,x_d\\\\}$. We show that if $R$ satisfies the Engel condition of degree $n$ then $R$ is upper Lie nilpotent of class bounded by a function that depends only on $d$ and $n$. We deduce that the Engel condition in an arbitrary associative ring is inherited by its group of units, and implies a semigroup identity.\",\"bibtex\":\"@article{riley1999associative,\\n  title={Associative rings satisfying the Engel condition},\\n  author={Riley, D.M. and Wilson, Mark C.},\\n  journal={Proceedings of the American Mathematical Society},\\n  volume={127},\\n  number={4},\\n  pages={973-976},\\n  year={1999},\\n  keywords={algebra},\\n  url_Paper={https://www.ams.org/journals/proc/1999-127-04/S0002-9939-99-04643-2/S0002-9939-99-04643-2.pdf},\\n  abstract={Let $C$ be a commutative ring, and let $R$ be an associative $C$-algebra\\ngenerated by elements $\\\\{x_1,\\\\ldots,x_d\\\\}$. We show that if $R$\\nsatisfies the Engel condition of degree $n$ then $R$ is upper Lie\\nnilpotent of class bounded by a function that depends only on $d$ and\\n$n$. We deduce that the Engel condition in an arbitrary associative ring\\nis inherited by its group of units, and implies a semigroup identity.}\\n}\\n\\n\",\"author_short\":[\"Riley, D.\",\"Wilson, M. C.\"],\"key\":\"riley1999associative\",\"id\":\"riley1999associative\",\"bibbaseid\":\"riley-wilson-associativeringssatisfyingtheengelcondition-1999\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.ams.org/journals/proc/1999-127-04/S0002-9939-99-04643-2/S0002-9939-99-04643-2.pdf\"},\"keyword\":[\"algebra\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Compound constructions of broadcast networks\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Dinneen\"],\"firstnames\":[\"Michael\",\"J.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Ventura\"],\"firstnames\":[\"Jose\",\"A.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Zakeri\"],\"firstnames\":[\"Golbon\"],\"suffixes\":[]}],\"journal\":\"Discrete Applied Mathematics\",\"volume\":\"93\",\"number\":\"2-3\",\"pages\":\"205-232\",\"year\":\"1999\",\"publisher\":\"North-Holland\",\"keywords\":\"algorithms, combinatorics, graphs\",\"url_paper\":\"https://www.sciencedirect.com/science/article/pii/S0166218X99000438\",\"abstract\":\"Compound methods have been shown to be very effective in the construction of minimal broadcast networks (mbns). Compound methods generate a large mbn by combining multiple copies of an mbn $G$ using the structure of another mbn $H$. Node deletion is also allowed in some of these methods. The subset of connecting nodes of $G$ has been defined as solid $h$-cover by Bermond, Fraigniaud and Peters, and center node set by Weng and Ventura. This article shows that the two concepts are equivalent. We also provide new properties for center node sets, including bounds on the minimum size of a center node set, show how to reduce the number of center nodes of an mbn generated by a compound method, and propose an iterative compounding algorithm that generates the sparsest known mbns in many cases.\",\"bibtex\":\"@article{dinneen1999compound,\\n  title={Compound constructions of broadcast networks},\\n  author={Dinneen, Michael J. and Ventura, Jose A. and Wilson, Mark C. and Zakeri, Golbon},\\n  journal={Discrete Applied Mathematics},\\n  volume={93},\\n  number={2-3},\\n  pages={205-232},\\n  year={1999},\\n  publisher={North-Holland},\\n  keywords={algorithms, combinatorics, graphs},\\n  url_Paper={https://www.sciencedirect.com/science/article/pii/S0166218X99000438},\\n  abstract={Compound methods have been shown to be very effective in the\\nconstruction of minimal broadcast networks (mbns). Compound methods\\ngenerate a large mbn by combining multiple copies of an mbn $G$ using\\nthe structure of another mbn $H$. Node deletion is also allowed in some\\nof these methods. The subset of connecting nodes of $G$ has been defined\\nas solid  $h$-cover by Bermond, Fraigniaud and Peters, and center node\\nset by Weng and Ventura. This article shows that the two concepts are\\nequivalent. We also provide new properties for center node sets,\\nincluding bounds on the minimum size of a center node set, show how to\\nreduce the number of center nodes of an mbn generated by a compound\\nmethod, and propose an iterative compounding algorithm that generates\\nthe sparsest known mbns in many cases.}\\n}\\n\\n\",\"author_short\":[\"Dinneen, M. J.\",\"Ventura, J. A.\",\"Wilson, M. C.\",\"Zakeri, G.\"],\"key\":\"dinneen1999compound\",\"id\":\"dinneen1999compound\",\"bibbaseid\":\"dinneen-ventura-wilson-zakeri-compoundconstructionsofbroadcastnetworks-1999\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.sciencedirect.com/science/article/pii/S0166218X99000438\"},\"keyword\":[\"algorithms\",\"combinatorics\",\"graphs\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Primitive ideals in Hopf algebra extensions\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"arXiv preprint math/9808122\",\"year\":\"1998\",\"keywords\":\"algebra\",\"url_paper\":\"https://arxiv.org/pdf/math/9808122.pdf\",\"abstract\":\"My last paper in algebra, never published formally.\",\"bibtex\":\"@article{wilson1998primitive,\\n  title={Primitive ideals in Hopf algebra extensions},\\n  author={Wilson, Mark C.},\\n  journal={arXiv preprint math/9808122},\\n  year={1998},\\n  keywords={algebra},\\n  url_Paper={https://arxiv.org/pdf/math/9808122.pdf},\\n  abstract={My last paper in algebra, never published formally.}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson1998primitive\",\"id\":\"wilson1998primitive\",\"bibbaseid\":\"wilson-primitiveidealsinhopfalgebraextensions-1998\",\"role\":\"author\",\"urls\":{\" paper\":\"https://arxiv.org/pdf/math/9808122.pdf\"},\"keyword\":[\"algebra\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Bell's primeness criterion and the simple Lie superalgebras\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Journal of Pure and Applied Algebra\",\"volume\":\"133\",\"number\":\"1-2\",\"pages\":\"241-260\",\"year\":\"1998\",\"publisher\":\"North-Holland\",\"keywords\":\"algebra\",\"url_paper\":\"https://www.sciencedirect.com/science/article/pii/S0022404997001990\",\"abstract\":\"We determine all finite-dimensional simple Lie superalgebras $L$ such that $U(L)$ satisfies a primeness criterion due to Bell. Some open problems related to primeness of enveloping algebras are listed.\",\"bibtex\":\"@article{wilson1998bell,\\n  title={Bell's primeness criterion and the simple Lie superalgebras},\\n  author={Wilson, Mark C.},\\n  journal={Journal of Pure and Applied Algebra},\\n  volume={133},\\n  number={1-2},\\n  pages={241-260},\\n  year={1998},\\n  publisher={North-Holland},\\n  keywords={algebra},\\n  url_Paper={https://www.sciencedirect.com/science/article/pii/S0022404997001990},\\n  abstract={We determine all finite-dimensional simple Lie superalgebras $L$ such\\nthat $U(L)$ satisfies a primeness criterion due to Bell. Some open\\nproblems related to primeness of enveloping algebras are listed.}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson1998bell\",\"id\":\"wilson1998bell\",\"bibbaseid\":\"wilson-bellsprimenesscriterionandthesimpleliesuperalgebras-1998\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.sciencedirect.com/science/article/pii/S0022404997001990\"},\"keyword\":[\"algebra\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Primeness of the enveloping algebra of the special Lie superalgebras\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Pritchard\"],\"firstnames\":[\"Geoffrey\"],\"suffixes\":[]}],\"journal\":\"Archiv der Mathematik\",\"volume\":\"70\",\"number\":\"3\",\"pages\":\"187-196\",\"year\":\"1998\",\"publisher\":\"Birkhäuser Verlag\",\"keywords\":\"algebra\",\"url_paper\":\"https://link.springer.com/article/10.1007/s000130050183\",\"abstract\":\"A primeness criterion due to Bell is shown to apply to the universal enveloping algebra of the Cartan type Lie superalgebras $S(V)$ and $\\\\widetilde{S}(V;t)$ when $\\\\dim V$ is even. On the other hand, if $\\\\dim V$ is odd then $U(S(V))$ is never semiprime.\",\"bibtex\":\"@article{wilson1998primeness,\\n  title={Primeness of the enveloping algebra of the special Lie superalgebras},\\n  author={Wilson, Mark C. and Pritchard, Geoffrey},\\n  journal={Archiv der Mathematik},\\n  volume={70},\\n  number={3},\\n  pages={187-196},\\n  year={1998},\\n  publisher={Birkh{\\\\\\\"a}user Verlag},\\n  keywords={algebra},\\n  url_Paper={https://link.springer.com/article/10.1007/s000130050183},\\n  abstract={A primeness criterion due to Bell is shown to apply to the universal\\nenveloping algebra of the Cartan type Lie superalgebras $S(V)$ and\\n$\\\\widetilde{S}(V;t)$ when $\\\\dim V$ is even. On the other hand, if $\\\\dim\\nV$ is odd then $U(S(V))$ is never semiprime.}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\",\"Pritchard, G.\"],\"key\":\"wilson1998primeness\",\"id\":\"wilson1998primeness\",\"bibbaseid\":\"wilson-pritchard-primenessoftheenvelopingalgebraofthespecialliesuperalgebras-1998\",\"role\":\"author\",\"urls\":{\" paper\":\"https://link.springer.com/article/10.1007/s000130050183\"},\"keyword\":[\"algebra\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Crossed products of restricted enveloping algebras\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Communications in Algebra\",\"volume\":\"25\",\"number\":\"2\",\"pages\":\"487-496\",\"year\":\"1997\",\"publisher\":\"Taylor & Francis\",\"keywords\":\"algebra\",\"url_paper\":\"https://www.tandfonline.com/doi/abs/10.1080/00927879708825868\",\"abstract\":\"Let $K$ be a field of characteristic $p>0$, let $L$ be a restricted Lie algebra and let $R$ be an associative $K$-algebra. It is shown that the various constructions in the literature of crossed product of $R$ with $u(L)$ are equivalent. We calculate explicit formulae relating the parameters involved and obtain a formula which hints at a noncommutative version of the Bell polynomials.\",\"bibtex\":\"@article{wilson1997crossed,\\n  title={Crossed products of restricted enveloping algebras},\\n  author={Wilson, Mark C.},\\n  journal={Communications in Algebra},\\n  volume={25},\\n  number={2},\\n  pages={487-496},\\n  year={1997},\\n  publisher={Taylor \\\\& Francis},\\n  keywords={algebra},\\n  url_Paper={https://www.tandfonline.com/doi/abs/10.1080/00927879708825868},\\n  abstract={Let $K$ be a field of characteristic $p>0$, let $L$ be a restricted Lie\\nalgebra and let $R$ be an associative $K$-algebra. It is shown that the\\nvarious constructions in the literature of crossed product of  $R$ with\\n$u(L)$ are equivalent. We calculate explicit formulae relating the\\nparameters involved and obtain a formula which hints at a noncommutative\\nversion of the Bell polynomials.}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson1997crossed\",\"id\":\"wilson1997crossed\",\"bibbaseid\":\"wilson-crossedproductsofrestrictedenvelopingalgebras-1997\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.tandfonline.com/doi/abs/10.1080/00927879708825868\"},\"keyword\":[\"algebra\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Bell's primeness criterion for $W(2n+ 1)$\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Pritchard\"],\"firstnames\":[\"Geoffrey\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Wood\"],\"firstnames\":[\"David\",\"H.\"],\"suffixes\":[]}],\"journal\":\"Experimental Mathematics\",\"volume\":\"6\",\"number\":\"1\",\"pages\":\"77-85\",\"year\":\"1997\",\"publisher\":\"Taylor & Francis Group\",\"keywords\":\"algebra\",\"url_paper\":\"https://doi.org/10.1080/10586458.1997.10504352\",\"abstract\":\"On the basis of experimental work involving matrix computations, we conjecture that a criterion due to Bell for primeness of the universal enveloping algebra of a Lie superalgebra applies to the Cartan type Lie superalgebras $W(n)$ for $n=3$ but does not apply for odd $n≥ 5$. The experiments lead to a rigorous proof, which we present.\",\"bibtex\":\"@article{wilson1997bell,\\n  title={Bell's primeness criterion for $W(2n+ 1)$},\\n  author={Wilson, Mark C. and Pritchard, Geoffrey and Wood, David H.},\\n  journal={Experimental Mathematics},\\n  volume={6},\\n  number={1},\\n  pages={77-85},\\n  year={1997},\\n  publisher={Taylor \\\\& Francis Group},\\n  keywords={algebra},\\n  url_Paper={https://doi.org/10.1080/10586458.1997.10504352},\\n  abstract={On the basis of experimental work involving matrix computations, we\\nconjecture that a criterion due to Bell for primeness of the universal\\nenveloping algebra of a Lie superalgebra applies to the Cartan type Lie\\nsuperalgebras $W(n)$ for $n=3$ but does not apply for odd $n\\\\geq 5$. The\\nexperiments lead to a rigorous proof, which we present.}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\",\"Pritchard, G.\",\"Wood, D. H.\"],\"key\":\"wilson1997bell\",\"id\":\"wilson1997bell\",\"bibbaseid\":\"wilson-pritchard-wood-bellsprimenesscriterionforw2n1-1997\",\"role\":\"author\",\"urls\":{\" paper\":\"https://doi.org/10.1080/10586458.1997.10504352\"},\"keyword\":[\"algebra\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Primeness of the enveloping algebra of Hamiltonian superalgebras\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Bulletin of the Australian Mathematical Society\",\"volume\":\"56\",\"number\":\"3\",\"pages\":\"483-488\",\"year\":\"1997\",\"publisher\":\"Cambridge University Press\",\"keywords\":\"algebra\",\"url_paper\":\"https://www.cambridge.org/core/journals/bulletin-of-the-australian-mathematical-society/article/primeness-of-the-enveloping-algebra-of-hamiltonian-superalgebras/A643AA62E4FAC8098924C1DE44E463C8\",\"abstract\":\"In 1990 Allen Bell presented a sufficient condition for the primeness of the universal enveloping algebra of a Lie superalgebra. Let $Q$ be a nonsingular bilinear form on a finite-dimensional vector space over a field of characteristic zero. In this paper we show that Bell's criterion applies to the Hamiltonian Cartan type superalgebras determined by $Q$, and hence obtain some new prime noetherian rings.\",\"bibtex\":\"@article{wilson1997primeness,\\n  title={Primeness of the enveloping algebra of Hamiltonian superalgebras},\\n  author={Wilson, Mark C.},\\n  journal={Bulletin of the Australian Mathematical Society},\\n  volume={56},\\n  number={3},\\n  pages={483-488},\\n  year={1997},\\n  publisher={Cambridge University Press},\\n  keywords={algebra},\\n  url_Paper={https://www.cambridge.org/core/journals/bulletin-of-the-australian-mathematical-society/article/primeness-of-the-enveloping-algebra-of-hamiltonian-superalgebras/A643AA62E4FAC8098924C1DE44E463C8},\\n  abstract={In 1990 Allen Bell presented a sufficient condition for the primeness of\\nthe universal enveloping algebra of a Lie superalgebra. Let $Q$ be a\\nnonsingular bilinear form on a finite-dimensional vector space over a\\nfield of characteristic zero. In this paper we show that Bell's\\ncriterion applies to the Hamiltonian Cartan type superalgebras\\ndetermined by $Q$, and hence obtain some new prime noetherian rings.}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson1997primeness\",\"id\":\"wilson1997primeness\",\"bibbaseid\":\"wilson-primenessoftheenvelopingalgebraofhamiltoniansuperalgebras-1997\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.cambridge.org/core/journals/bulletin-of-the-australian-mathematical-society/article/primeness-of-the-enveloping-algebra-of-hamiltonian-superalgebras/A643AA62E4FAC8098924C1DE44E463C8\"},\"keyword\":[\"algebra\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Primeness of the enveloping algebra of a Cartan type Lie superalgebra\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Proceedings of the American Mathematical Society\",\"volume\":\"124\",\"number\":\"2\",\"pages\":\"383-387\",\"year\":\"1996\",\"keywords\":\"algebra\",\"url_paper\":\"\",\"abstract\":\"We show that a primeness criterion for enveloping algebras of Lie superalgebras discovered by Bell is applicable to the Cartan type Lie superalgebras $W(n)$, $n$ even. Other algebras are considered but there are no definitive answers in these cases.\",\"bibtex\":\"@article{wilson1996primeness,\\n  title={Primeness of the enveloping algebra of a Cartan type Lie superalgebra},\\n  author={Wilson, Mark C.},\\n  journal={Proceedings of the American Mathematical Society},\\n  volume={124},\\n  number={2},\\n  pages={383-387},\\n  year={1996},\\n  keywords={algebra},\\n  url_Paper={},\\n  abstract={We show that a primeness criterion for enveloping algebras of Lie\\nsuperalgebras discovered by Bell is applicable to the Cartan type Lie\\nsuperalgebras $W(n)$, $n$ even. Other algebras are considered but there\\nare no definitive answers in these cases.}\\n}\\n\\n\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson1996primeness\",\"id\":\"wilson1996primeness\",\"bibbaseid\":\"wilson-primenessoftheenvelopingalgebraofacartantypeliesuperalgebra-1996\",\"role\":\"author\",\"urls\":{\" paper\":\"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"},\"keyword\":[\"algebra\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Delta methods in enveloping algebras of Lie color algebras\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Wilson\"],\"firstnames\":[\"Mark\",\"C.\"],\"suffixes\":[]}],\"journal\":\"Journal of Algebra\",\"volume\":\"175\",\"number\":\"2\",\"pages\":\"661-696\",\"year\":\"1995\",\"publisher\":\"Academic Press\",\"keywords\":\"algebra\",\"url_paper\":\"https://www.sciencedirect.com/science/article/pii/S0021869385712070\",\"abstract\":\"In recent papers J. Bergen and D.S. Passman have applied so-called `Delta methods' to enveloping algebras of Lie superalgebras. This paper generalizes their results to the class of Lie colour algebras. The methods and results in this paper are very similar to those of Bergen and Passman, and many of their proofs generalize easily. However, at some points there are serious difficulties to overcome. The results obtained show that if $L$ is a Lie colour algebra then the join of all finite-dimensional ideals of $L$ controls certain properties of the universal enveloping algebras $U(L)$. Specifically, we consider primeness, semiprimeness, constants, semi-invariants, almost constants, faithfulness of the adjoint action, the centre, almost centralizers and the central closure.\",\"bibtex\":\"@article{wilson1995delta,\\n  title={Delta methods in enveloping algebras of Lie color algebras},\\n  author={Wilson, Mark C.},\\n  journal={Journal of Algebra},\\n  volume={175},\\n  number={2},\\n  pages={661-696},\\n  year={1995},\\n  publisher={Academic Press},\\n  keywords={algebra},\\n  url_Paper={https://www.sciencedirect.com/science/article/pii/S0021869385712070},\\n  abstract={In recent papers J. Bergen and D.S. Passman have applied so-called\\n`Delta methods' to enveloping algebras of Lie superalgebras. This paper\\ngeneralizes their results to the class of Lie colour algebras. The\\nmethods and results in this paper are very similar to those of Bergen\\nand Passman, and many of their proofs generalize easily. However, at\\nsome points there are serious difficulties to overcome. The results\\nobtained show that if $L$ is a Lie colour algebra then the join of all\\nfinite-dimensional ideals of  $L$ controls certain properties of the\\nuniversal enveloping algebras  $U(L)$. Specifically, we consider\\nprimeness, semiprimeness, constants, semi-invariants, almost constants,\\nfaithfulness of the adjoint action, the centre, almost centralizers and\\nthe central closure.}\\n}\\n\\n\",\"author_short\":[\"Wilson, M. C.\"],\"key\":\"wilson1995delta\",\"id\":\"wilson1995delta\",\"bibbaseid\":\"wilson-deltamethodsinenvelopingalgebrasofliecoloralgebras-1995\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.sciencedirect.com/science/article/pii/S0021869385712070\"},\"keyword\":[\"algebra\"],\"metadata\":{\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\"html\":\"\"}],\n      metadata: {\"owner\":\"wilson, m\",\"authorlinks\":{\"wilson, m\":\"https://markcwilson.site/Research/social_choice/index.html\"}},\n      ownerID: \"2SHj7sd7JeFWTntxS\"\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"uc\" href=\"data:text/bibtex;base64,@article{pritchard2023multi,
  title={Multi-district preference modelling},
  author={Pritchard, Geoffrey and Wilson, Mark C},
  journal={Quality \& Quantity},
  volume={57},
  keywords={electoral systems},
  number={1},
  pages={587--613},
  year={2023},
  url_Paper={},
  abstract   = {Generating realistic artificial preference distributions is an important
part of any simulation analysis of electoral systems. While this has
been discussed in some detail in the context of a single electoral
district, many electoral systems of interest are based on districts.
Neither treating preferences between districts as independent nor
ignoring the district structure yields satisfactory results. We present
a model based on an extension of the classic Eggenberger-P\'{o}lya urn,
in which each district is represented by an urn and there is correlation
between urns. We show in detail that this procedure has a small number
of tunable parameters, is computationally efficient, and produces
{``}realistic-looking{"} distributions. We present applications to
retrospective analysis and forecasting of real elections, and intend to
use the methodology to help set optimal parameters for electoral
systems. (Subsumes SocArXiv paper xpb8w from 2018)}
}



@Article{PrWi2022,
  author  = {Pritchard, Geoffrey and Wilson, Mark C.},
  journal = {Stochastic Systems},
  abstract  = {We make a detailed analysis of three key algorithms (Serial Dictatorship
and the naive and adaptive variants of the Boston algorithm) for the housing alloca-
tion problem, under the assumption that agent preferences are chosen iid uniformly
from linear orders on the items. We compute limiting distributions (with respect to
some common utility functions) as $n\to\infty$ of both the utilitarian welfare and the or-
der bias. To do this, we compute limiting distributions of the outcomes for an arbitrary
agent whose initial relative position in the tiebreak order is $\theta\in [0, 1]$, as a function of θ.
We expect that these fundamental results on the stochastic processes underlying these
mechanisms will have wider applicability in future. Overall our results show that the
differences in utilitarian welfare performance of the three algorithms are fairly small,
but the differences in order bias are much greater. Also, Naive Boston beats Adaptive
Boston, which beats Serial Dictatorship, on both welfare and order bias.
},
  title   = {Asymptotic welfare performance of Boston assignment algorithms},
  year    = {2023},
  number  = {2},
  pages   = {247--270},
  volume  = {13},
  doi     = {},
  keywords = {social choice,assignment},
  url_paper = {https://pubsonline.informs.org/doi/abs/10.1287/stsy.2022.0104},
  url_slides = {https://www.dropbox.com/s/1jk218g16pp8qas/Mark_Wilson.pdf?dl=0},
}



@Article{GhWi2023,
author = {Ghaffari, Fatemeh and Wilson, Mark C.},
abstract = {We introduce and analyse a simple probabilistic model of article
production and citation behavior that explicitly assumes that there is
no decline in citability of a given article over time. It makes
predictions about the number and age of items appearing in the reference
list of an article. The latter topics have been studied before, but only
in the context of data, and to our knowledge no models have been
presented. We then perform large-scale analyses of reference list length
for a variety of academic disciplines. The results show that our simple
model cannot be rejected, and indeed fits the aggregated data on
reference lists rather well. Over the last few decades, the relationship
between total publications and mean reference list length is linear to a
high level of accuracy. Although our model is clearly an
oversimplification, it will likely prove useful for further modeling of
the scholarly literature. Finally, we connect our work to the large
literature on ``aging" or ``obsolescence" of scholarly publications, and
argue that the importance of that area of research is no longer clear,
while much of the existing literature is confused and confusing.},
title = {A model for reference list length of scholarly articles},
journal = {Scientometrics},
year = {2023},
pages = {5335–5350},
volume={128},
number={9},
keywords = {scientometrics},
url_paper = {https://arxiv.org/pdf/2305.00089.pdf},
url_slides = {},
}



@Article{GrWi2020,
  author     = {Grofman, Bernard N. and Wilson, Mark C.},
  title      = {Models of inter-election change in partisan vote share},
  pages      = {481--498},
  volume	 = {34},
  issue      = {4},
  journal    = {J. Theoretical Politics},
  abstract   = {Consider an election of a given type (say a legislative or presidential
election) involving some set of districts for which we have data at two
distinct points in time, time 1 and time 2. If there are only two
political parties, A and B, we may think of the overall difference in
the mean party vote share of party A between the two elections as the
aggregate inter-election swing between the two parties.  If we know this
mean inter-election swing, the question we seek to answer is: ``How do
we expect the aggregate swing to be distributed across the districts or
states (or smaller units such as counties) as a function of previous
vote share (and perhaps, other factors)?''

In the electoral systems and political party literatures there have been
two main answers to that question: uniform swing and  proportional
swing. Our main theoretical contributions are (a) to provide an
axiomatic foundation  for desirable properties of a model of
inter-election changes in vote shares in a districted legislature; (b)
to use those axioms to demonstrate why using uniform swing or
proportional swing is a bad idea, (c) to provide a reasonably simple
swing model that does satisfy the axioms, and (d) to show how to
integrate a reversion to the mean effect into models of inter-election
swing.

Our main empirical contributions address the question of why, despite
their theoretical flaws, there is strong evidence that the two standard
models, especially uniform swing, provide a very good fit to empirical
data.  We show that these models can be expected to work well when (a)
elections are close, or (b) when we restrict ourselves to data where
swing is low, or  (c) when we eliminate the cases where the model is
most likely to go wrong. In particular, sometimes the model tested is
not the standard model; in that either (c1) a piecewise or truncated
variant of the model is being used,  or (c2) there is a correction
(usually 75\%) for districts that are uncontested.  As we show
empirically with data from U.S. congressional elections, either of these
corrections will at least marginally  improve fit on one or more of five
indicators: mistakes about directionality of change, mistakes in winner,
estimates that are outside the [0..1] bounds, mean-square error, and
correlation between actual and predicted values. We also show that our
new model provides an equal or better fit to U.S. congressional data
than the traditional models, while having much nicer axiomatic
properties.},
  keywords   = {electoral systems},
  url_paper  = {https://markcwilson.site/Research/Outputs/GrWi2020.pdf},
  url_slides = {https://www.youtube.com/watch?v=C0eIF1oAk-U},
  year       = {2022},
}



@Article{GMRW2022,
author = {Greenwood, Torin and Melczer, Stephen and Ruza, Tiadora and Wilson, Mark C.},
journal = {S\'{e}minaire Lotharingien de Combinatoire},
abstract = {We present a strategy for computing asymptotics of coefficients of
$d$-variate algebraic generating functions. Using known constructions,
we embed the coefficient array into an array represented by a rational
generating functions in $d+1$ variables, and then apply ACSV theory to
analyse the latter. This method allows us to give systematic results in
the multivariate case, seems more promising than trying to derive
analogs of the rational ACSV theory for algebraic GFs, and gives the
prospect of further improvements as embedding methods are studied in
more detail.},
title = {Asymptotics of coefficients of algebraic series via embedding into rational series (extended abstract)},
year = {2022},
pages = {12pp},
volume = {86B}, 
keywords={ACSV applications, ACSV theory},
url_paper = {https://www.emis.de/journals/SLC/wpapers/FPSAC2022/30.pdf},
url_slides = {},
}



@Article{DiWi2021,
  author     = {DiPilla, Morgan and Wilson, Mark C.},
  title      = {New algorithms for school choice},
  pages      = {8pp},
  journal    = {},
  abstract   = {Algorithms for the school choice problem have been widely studied. A
small number of algorithms for producing a solution dominate the
literature, for example Serial Dictatorship (SD) and the Deferred
Acceptance (DA) algorithm. One main reason for the dominance of these
algorithms is their good (worst-case) axiomatic behaviour with respect
to notions of Pareto efficiency, justified envy and manipulation.
However if we shift the focus to fairness, social welfare, the
inevitable tradeoffs between incompatible axioms, and average-case
analysis, it is far from clear that these algorithms are the last word.

We introduce a 6-parameter family of 40 inequivalent algorithms derived
from DA, most of which have not appeared (to our knowledge) in the
literature before. The family includes SD and the naive and adaptive
versions of the Boston mechanism, the most commonly used school choice
algorithm other than SD and DA. We investigate agent welfare, order bias
and stability via numerical simulation, under the assumption of truthful
preferences. We find that some of the new algorithms are worthy of much
more study. In particular, when we consider order bias, some of the new
algorithms clearly outperform the classic ones, while losing almost
nothing in stability and utilitarian welfare.}, 
  keywords   = {social choice, assignment},
  url_paper  = {https://markcwilson.site/Research/Outputs/DiWi2021.pdf},
  url_slides = {},
  year       = {2021},
}




@Article{Wils2021,
  author  = {Wilson, Mark C.},
  journal = {Journal of Scholarly Publishing},
  title   = {Reassembling Scholarly Communications: Histories, Infrastructures, and Global Politics of Open Access by Martin Paul Eve and Jonathan Gray},
  year    = {2021},
  number  = {3},
  pages   = {190-192},
  volume  = {52},
  keywords = {publication reform,scholarly communication},
  doi     = {10.3138/jsp.52.3.05},
  eprint  = {https://doi.org/10.3138/jsp.52.3.05},
  url     = {https://doi.org/10.3138/jsp.52.3.05},
}





@Article{FrPW2021,
  author  = {Freeman, Rupert and Pritchard, Geoffrey and Wilson, Mark C.},
  journal = {},
  abstract  = {We introduce a new fairness criterion, order symmetry, for
assignment mechanisms that match $n$ objects to $n$ agents with ordinal
preferences over the objects. An assignment mechanism is order symmetric
with respect to some probability measure over preference profiles if
every agent is equally likely to receive their favorite object, every
agent is equally likely to receive their second favorite, and so on.
When associated with a sufficiently symmetric probability measure, order
symmetry is a relaxation of anonymity that, crucially, can be satisfied
by discrete assignment mechanisms. Furthermore, it can be achieved
without sacrificing other desirable axiomatic properties satisfied by
existing mechanisms. In particular, we show that it can be achieved in
conjunction with strategyproofness and ex post efficiency via the top
trading cycles mechanism (but not serial dictatorship). We additionally
design a novel mechanism that is both order symmetric and ordinally
efficient. The practical utility of order symmetry is substantiated by
simulations on Impartial Culture and Mallows-distributed preferences for 
four common assignment mechanisms.},
  title   = {Order Symmetry: a new fairness criterion for assignment algorithms},
  year    = {2021},
  number  = {},
  pages   = {44pp},
  volume  = {},
  doi     = {},
  keywords = {social choice,assignment},
  url_paper = {https://osf.io/preprints/socarxiv/xt37c/},
  url_slides = {https://www.youtube.com/watch?v=qdyEspDXa90&list=PLKz9ISqcKAGCKccL_XdTCfo7WBRGMS21i&index=5},
}



@article{ramgoolam2020quiver,
  title={Quiver asymptotics: free chiral ring},
  author={Ramgoolam, Sanjaye and Wilson, Mark C and Zahabi, Ali},
  journal={Journal of Physics A: Mathematical and Theoretical},
  volume={53},
  number={10},
  pages={105401},
  year={2020},
  publisher={IOP Publishing},
  keywords={ACSV applications},
  url_Paper={https://iopscience.iop.org/article/10.1088/1751-8121/ab6fc6/pdf},
  abstract={The large N generating functions for the counting of chiral operators in
$\mathcal{N} = 1$, four-dimensional quiver gauge theories have
previously been obtained in terms of the weighted adjacency matrix of
the quiver diagram. We introduce the methods of multi-variate asymptotic
analysis to study this counting in the limit of large charges. We
describe a Hagedorn phase transition associated with this asymptotics,
which refines and generalizes known results on the 2-matrix harmonic
oscillator. Explicit results are obtained for two infinite classes of
quiver theories, namely the generalized clover quivers and affine
$\mathbb{C}^3 \setminus \hat{A}_n$ orbifold quivers.}
}





@Article{aref2020modeling,
  author    = {Aref, Samin and Mason, Andrew J and Wilson, Mark C.},
  title     = {A modeling and computational study of the frustration index in signed networks},
  number    = {1},
  pages     = {95-110},
  volume    = {75},
  abstract  = {Computing the frustration index of a signed graph is a key step toward
solving problems in many fields including social networks, political
science, physics, chemistry, and biology. The frustration index
determines the distance of a network from a state of total structural
balance. Although the definition of the frustration index goes back to
the 1950's, its exact algorithmic computation, which is closely related
to classic NP-hard graph problems, has only become a focus in recent
years. We develop three new binary linear programming models to compute
the frustration index exactly and efficiently as the solution to a
global optimisation problem. Solving the models with prioritised
branching and valid inequalities in Gurobi, we can compute the
frustration index of real signed networks with over 15000 edges in less
than a minute on inexpensive hardware. We provide extensive performance
analysis for both random and real signed networks and show that our
models outperform all existing approaches by large factors. Based on
solve time, algorithm output, and effective branching factor we
highlight the superiority of our models to both exact and heuristic
methods in the literature.},
  journal   = {Networks},
  keywords  = {network science, computation, graphs},
  publisher = {Wiley},
  url_paper = {https://arxiv.org/abs/1611.09030},
  year      = {2020},
}



@article{sakhaee2020information,
  title={Information extraction framework to build legislation network},
  author={Sakhaee, Neda and Wilson, Mark C.},
  journal={Artificial Intelligence and Law},
  pages={1-24},
  year={2020},
  publisher={Springer Netherlands},
  keywords={network science},
  url_Paper={https://link.springer.com/content/pdf/10.1007/s10506-020-09263-3.pdf},
  abstract={This paper concerns an Information Extraction process for building a
dynamic Legislation Network from legal documents. Unlike supervised
learning approaches which require additional calculations, the idea here
is to apply Information Extraction methodologies by identifying distinct
expressions in legal text and extract quality network information. The
study highlights the importance of data accuracy in network analysis and
improves approximate string matching techniques for producing reliable
network datasets with more than 98 percent precision and recall. The
values, applications, and the complexity of the created dynamic
Legislation Network are also discussed and challenged.}
}



@article{WiZh2020,
  title={Non-cumulative measures of researcher citation impact},
  author={Wilson, Mark C. and Tang, Zhou},
  journal={Quantitative Science Studies},
  volume={},
  number={},
  pages={11pp},
  year={2020},
  publisher={},
  keywords={scientometrics},
  url_Paper={https://www.mitpressjournals.org/doi/pdf/10.1162/qss_a_00074},
  url_Slides={https://www.youtube.com/watch?v=6bmh-u9biUc},
  abstract={The most commonly used publication metrics for individual researchers
are the the total number of publications, the total number of citations,
and Hirsch’s $h$-index. Each of these is cumulative, and hence increases
throughout a researcher’s career, making it less suitable for evaluation
of junior researchers or assessing recent impact. Most other
author-level measures in the literature share this cumulative property.
By contrast, we aim to study non-cumulative measures that answer the
question “in terms of citation impact, what have you done lately?” We
single out six measures from the rather sparse literature, including
Hirsch’s $m$-index, a time-scaled version of the $h$-index. We introduce
new measures based on the idea of “citation acceleration”. After
presenting several axioms for non-cumulative measures, we conclude that
one of our new measures has much better theoretical justification. We
present a small-scale study of its performance on real data and conclude
that it shows substantial promise for future use.}
}




@article{wilson2019dummies,
  title={Research publishing for the nonexpert},
  author={Wilson, Mark C.},
  journal={New Zealand Mathematical Society Newsletter},
  year={2019},
  volume={137},
  pages={14-18},
  publisher={},
    keywords={publication reform, advocacy},
  url_Paper={https://markcwilson.site/Research/Outputs/oa_dummies.pdf},
  abstract={}
}



@incollection{wilson2019inputs,
  title={Inputs, Algorithms, Quality Measures: More Realistic Simulation in Social Choice},
  author={Wilson, Mark C.},
  booktitle={The Future of Economic Design},
  pages={165-171},
  year={2019},
  publisher={Springer, Cham},
  keywords={social choice, simulation},
  url_Paper={https://markcwilson.site/Research/Outputs/FED.pdf},
  abstract={Much of my research deals with trying to evaluate the performance of
social choice \emph{algorithms} via simulations, which requires
appropriate \emph{inputs} and \emph{quality measures}. All three areas
offer substantial scope for improvement in the coming years. For
concreteness and because of my own limited experience, I focus on the
allocation of indivisible goods and on voting, although many of the
ideas are more broadly applicable.}
}



@article{aref2019balance,
  title={Balance and frustration in signed networks},
  author={Aref, Samin and Wilson, Mark C.},
  journal={Journal of Complex Networks},
  volume={7},
  number={2},
  pages={163-189},
  year={2019},
  publisher={Oxford University Press},
  keywords={network science, graphs},
  url_Paper= {https://academic.oup.com/comnet/article-abstract/7/2/163/5074195},
  abstract={The frustration index is a key measure for analysing signed networks,
which has been underused due to its computational complexity. We use an
exact optimisation-based method to analyse frustration as a global
structural property of signed networks coming from diverse application
areas. In the classic friend-enemy interpretation of balance theory, a
by-product of computing the frustration index is the partitioning of
nodes into two internally solidary but mutually hostile groups. The main
purpose of this paper is to present general methodology for answering
questions related to partial balance in signed networks, and apply it to
a range of representative examples that are now analysable because of
advances in computational methods. We provide exact numerical results on
social and biological signed networks, networks of formal alliances and
antagonisms between countries, and financial portfolio networks.
Molecular graphs of carbon and Ising models are also considered. We
point out several mistakes in the signed networks literature caused by
inaccurate computation, implementation errors or inappropriate
measures.}
}



@Article{melczer2019higher,
  author     = {Melczer, Stephen and Wilson, Mark C.},
  title      = {Higher dimensional lattice walks: Connecting combinatorial and analytic behavior},
  number     = {4},
  pages      = {2140-2174},
  volume     = {33},
  abstract   = {We consider the enumeration of walks on the non-negative lattice
$\mathbb{N}^d$, with steps defined by a set $\mathcal{S} \subset \{ -1,
0, 1 \}^d \setminus \{\mathbf{0}\}$. Previous work in this area has
established asymptotics for the number of walks in certain families of
models by applying the techniques of analytic combinatorics in several
variables (ACSV), where one encodes the generating function of a lattice
path model as the diagonal of a multivariate rational function. Melczer
and Mishna obtained asymptotics when the set of steps $\mathcal{S}$ is
symmetric over every axis; in this setting one can always apply the
methods of ACSV to a multivariate rational function whose  set of
singularities is a smooth manifold (the simplest case). Here we go
further, providing asymptotics for models with generating functions that
must be encoded by multivariate rational functions having non-smooth
singular sets.  In the process, our analysis connects past work to
deeper structural results in the theory of analytic combinatorics in
several variables.  One application is a closed form for asymptotics of
models defined by step sets that are symmetric over all but one axis. As
a special case, we apply our results when $d=2$ to give a rigorous proof
of asymptotics conjectured by Bostan and Kauers; asymptotics for walks
returning to boundary axes and the origin are also given.},
  journal    = {SIAM Journal on Discrete Mathematics},
  keywords   = {ACSV applications},
  publisher  = {Society for Industrial and Applied Mathematics},
  url_paper  = {https://arxiv.org/abs/1810.06170},
  url_slides = {https://www.youtube.com/watch?v=o5SOHJbGO4g},
  year       = {2019},
}



@article{ianovski2019manipulability,
  title={Manipulability of consular election rules},
  author={Ianovski, Egor and Wilson, Mark C.},
  journal={Social Choice and Welfare},
  volume={52},
  number={2},
  pages={363-393},
  year={2019},
  publisher={Springer Berlin Heidelberg},
  keywords={social choice, voting},
  url_Paper={https://arxiv.org/abs/1611.07102},
  url_Link={https://link.springer.com/article/10.1007/s00355-018-1152-2},
  abstract={The Gibbard-Satterthwaite theorem is a cornerstone of social choice
theory, stating that an onto social choice function cannot be both
strategy-proof and non-dictatorial if the number of alternatives is at
least three. The Duggan-Schwartz theorem proves an analogue in the case
of set-valued elections: if the function is onto with respect to
singletons, and can be manipulated by neither an optimist nor a
pessimist, it must have a weak dictator. However, the assumption that
the function is onto with respect to singletons makes the
Duggan-Schwartz theorem inapplicable to elections which necessarily
select a committee with multiple members. In this paper we make a start
on this problem by considering elections which elect a committee of size
two (such as the consulship of ancient Rome). We establish that if such
a \emph{consular election rule} cannot be expressed as the union of two
disjoint social choice functions, then strategy-proofness implies the
existence of a dictator. Although we suspect that a similar result holds
for larger sized committees, there appear to be many obstacles to
proving it, which we discuss in detail.}
}



@article{hadjibeyli2019distance,
  title={Distance rationalization of anonymous and homogeneous voting rules},
  author={Hadjibeyli, Benjamin and Wilson, Mark C.},
  journal={Social Choice and Welfare},
  volume={52},
  number={3},
  pages={559-583},
  year={2019},
  publisher={Springer Berlin Heidelberg},
  keywords={social choice, voting},
  url_Paper={https://link.springer.com/content/pdf/10.1007/s00355-018-1156-y.pdf},
  abstract={The concept of distance rationalizability of voting rules has been
explored in recent years by several authors. Most previous work has
dealt with a definition in terms of preference profiles. However, most
voting rules in common use are anonymous and homogeneous. In this case
there is a much more succinct representation (using the voting simplex)
of the inputs to the rule. This representation has been widely used in
the voting literature, but rarely in the context of distance
rationalizability. Recently, the present authors showed, as a special
case of general results on quotient spaces, exactly how to connect
distance rationalizability on profiles for anonymous and homogeneous
rules to geometry in the simplex. In this article we develop the
connection for the important special case of votewise distances,
recently introduced and studied by Elkind, Faliszewski and Slinko in
several papers. This yields a direct interpretation in terms of
well-developed mathematical topics not seen before in the voting
literature, namely Kantorovich (also called Wasserstein) distances and
the geometry of Minkowski spaces. As an application of this approach, we
prove some positive and some negative results about the decisiveness of
distance rationalizable anonymous and homogeneous rules. The positive
results connect with the recent theory of hyperplane rules, while the
negative ones deal with distances that are not metrics, controversial
notions of consensus, and the fact that the $\ell^1$-norm is not
strictly convex. We expect that the above novel geometric interpretation
will aid the analysis of rules defined by votewise distances, and the
discovery of new rules with desirable properties.}
}



@article{wilson2018free,
  title={Free and fair open access journals: Flipping, fostering, founding},
  author={Wilson, Mark C.},
  journal={Notices of the American Mathematical Society},
  volume={65},
  pages={817-820},
  year={2018},
    keywords={publication reform, advocacy},
  url_Paper={https://www.ams.org/journals/notices/201807/rnoti-p817.pdf},
  abstract={}
}



@article{wilson2018flipping,
  title={Flipping JACO},
  author={Wilson, Mark C. and van Maldeghem, Hendrik and Reiner, Victor and Athanasiadis, Christos and Munemasa, Akihiro and Thomas, Hugh},
  journal={European Mathematical Society Newsletter},
  volume={9},
  number={109},
  pages={38-41},
  year={2018},
  keywords={publication reform},
  url_Paper={http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488x&vol=9&iss=109&rank=9},
  abstract={}
}



@incollection{aref2018computing,
  title={Computing the line index of balance using integer programming optimisation},
  author={Aref, Samin and Mason, Andrew J and Wilson, Mark C.},
  booktitle={Optimization Problems in Graph Theory},
  pages={65-84},
  year={2018},
  publisher={Springer, Cham},
  keywords={network science, computation, graphs},
  url_Paper={https://arxiv.org/abs/1710.09876},
  abstract={An important measure of signed graphs is the line index of balance which
has several applications in many fields. However, this graph-theoretic
measure was underused for decades because of the inherent complexity in
its computation which is closely related to solving NP-hard graph
optimisation problems like MAXCUT. We develop new quadratic and linear
programming models to compute the line index of balance exactly. Using
the Gurobi integer programming optimisation solver, we evaluate the line
index of balance on real-world and synthetic datasets. The synthetic
data involves Erd\H{o}s-R\'{e}nyi graphs, Barab\'{a}si-Albert graphs,
and specially structured random graphs. We also use well known datasets
from the sociology literature, such as signed graphs inferred from
students' choice and rejection as well as datasets from the biology
literature including gene regulatory networks. The results show that
exact values of the line index of balance in relatively large signed
graphs can be efficiently computed using our suggested optimisation
models. We find that most real-world social networks and some biological
networks have small line index of balance which indicates that they are
close to balanced.}
}



@article{aref2018measuring,
  title={Measuring partial balance in signed networks},
  author={Aref, Samin and Wilson, Mark C.},
  journal={Journal of Complex Networks},
  volume={6},
  number={4},
  pages={566-595},
  year={2018},
  publisher={Oxford University Press},
  keywords={network science, graphs},
  url_Paper={http://arxiv.org/abs/1509.04037},
  abstract={Is the enemy of an enemy necessarily a friend? If not, to what extent
does this tend to hold? Such questions were formulated in terms of
signed (social) networks and necessary and sufficient conditions for a
network to be ‘balanced’ were obtained around 1960. Since then the idea
that signed networks tend over time to become more balanced has been
widely used in several application areas. However, investigation of this
hypothesis has been complicated by the lack of a standard measure of
partial balance, since complete balance is almost never achieved in
practice. We formalize the concept of a measure of partial balance,
discuss various measures, compare the measures on synthetic datasets and
investigate their axiomatic properties. The synthetic data involves
Erd\H{o}s-R\'{e}nyi and specially structured random graphs. We show that
some measures behave better than others in terms of axioms and ability
to differentiate between graphs. We also use well-known data sets from
the sociology and biology literature, such as Read's New Guinean tribes,
gene regulatory networks related to two organisms, and a network
involving senate bill co-sponsorship. Our results show that
substantially different levels of partial balance is observed under
cycle-based, eigenvalue-based and frustration-based measures. We make
some recommendations for measures to be used in future work.}
}



@misc{wilson2017conversation,
  title={Universities spend millions on accessing results of publicly funded research},
  author={Wilson, Mark C.},
  journal={New Zealand Mathematical Society Newsletter},
  year={2017},
  publisher={The Conversation},
    keywords={publication reform, advocacy},
  url_Link={},
  abstract={}
}



@misc{holcombe2017fair,
  title={Fair open access: returning control of scholarly journals to their communities},
  author={Holcombe, Alex and Wilson, Mark C.},
  journal={Impact of Social Sciences Blog},
  year={2017},
  publisher={London School of Economics and Political Science},
    keywords={publication reform, advocacy},
  url_Link={https://blogs.lse.ac.uk/impactofsocialsciences/2017/10/23/fair-open-access-returning-control-of-scholarly-journals-to-their-communities/},
  abstract={}
}



@article{neylon2017results,
  title={Results of a worldwide survey of mathematicians on journal reform},
  author={Neylon, Cameron and Roberts, David M. and Wilson, Mark C.},
  journal={European Mathematical Society Newsletter},
  volume={3},
  number={103},
  pages={46-49},
  year={2017},
  keywords={publication reform},
  url_Paper={http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488X&vol=3&iss=103&rank=9},
  abstract={}
}



@article{lo2017new,
  title={New algorithms for matching problems},
  author={Lo, Jacky and Wilson, Mark C.},
  journal={arXiv preprint arXiv:1703.04225},
  year={2017},
  keywords={social choice, allocation, algorithms},
  url_Paper={http://arxiv.org/abs/1703.04225},
  abstract={The standard two-sided and one-sided matching problems, and the closely
related school choice problem, have been widely studied from an
axiomatic viewpoint. A small number of algorithms dominate the
literature. For two-sided matching, the Gale-Shapley algorithm; for
one-sided matching, (random) Serial Dictatorship and Probabilistic
Serial rule; for school choice, Gale-Shapley and the Boston mechanisms.
The main reason for the dominance of these algorithms is their good
(worst-case) axiomatic behaviour with respect to notions of efficiency
and strategyproofness. However if we shift the focus to fairness, social
welfare, tradeoffs between incompatible axioms, and average-case
analysis, it is far from clear that these algorithms are optimal. We
investigate new algorithms several of which have not appeared (to our
knowledge) in the literature before. We give a unified presentation in
which algorithms for 2-sided matching yield 1-sided matching algorithms
in a systematic way. In addition to axiomatic properties, we investigate
agent welfare using both theoretical and computational approaches. We
find that some of the new algorithms are worthy of consideration for
certain applications. In particular, when considering welfare under
truthful preferences, some of the new algorithms outperform the classic
ones.}
}



@article{sakhaee2017network,
  title={Network analysis of New Zealand legislation},
  author={Sakhaee, Neda and Wilson, Mark C. and Hendy, Shaun and Zakeri, Golbon},
  journal={New Zealand Law Journal},
  pages={332-337},
  year={2017},
  publisher={},
  keywords={network science},
  url_Paper={},
  abstract={A summary for a legal audience of the basic early findings in Neda's PhD
work about citation networks derived from legislation.}
}



@article{GPW2016,
  title={Networked crowds answer tricky questions poorly},
  author={Girard, Patrick and Pavlov, Valery and Wilson, Mark C.},
  journal={},
  volume={},
  number={},
  pages={8pp},
  year={2016},
  publisher={},
  keywords={network science},
  url_Paper={},
  abstract={We focus on the following basic group decision situation, which we call
iterative distributed jury (IDJ), a variant of the Delphi technique.
Group members seek to answer truthfully a question having a welldefined
objectively correct answer; they revise answers iteratively; only
summary feedback on group members' answers is available at each
iteration; individual estimates are aggregated to form a group answer.
Experimental studies of the effectiveness of Delphi-like methods have
yielded mixed results. To investigate further, we designed a laboratory
multiple choice IDJ experiment having some novel features. One novelty
was that we incentivized participants to reveal their ignorance; another
is the use of both logical and factual questions. We find that, perhaps
surprisingly, substantial social influence occurs even in this highly
anonymized and information-restricted setting, and even for purely
logical questions. Eventual group accuracy is strongly dependent on the
trickiness (likelihood of being answered confidently but wrongly, a
concept distinct from difficulty) of the question. Also, the bulk of
learning occurs by those who were willing to admit to being undecided.
We find that question factors are more important than participant
characteristics.  In addition to consequences for the practical use of
this group decision method, our quantitative results suggest specific
new models of opinion dynamics that deserve detailed study.} 
}



@inproceedings{sakhaee2016new,
  title={New Zealand Legislation Network.},
  author={Sakhaee, Neda and Wilson, Mark C. and Zakeri, Golbon},
  booktitle={JURIX},
  pages={199-202},
  year={2016},
  keywords={network science},
  url_Paper={SWZ2016.pdf},
  abstract={This paper concerns the recently introduced concept of Legislation
Networks, with an application focus on the New Zealand legislation
network. Legislation networks have some novel features which make them
an excellent test case for new network science tools. They involve legal
documents, but differ substantially from citation networks involving
case-law, Supreme Court opinions, etc. We develop several such networks,
compute relevant centrality measures, and apply community detection
algorithms. We study the relationship between the legislation network
measures and legal/political factors. The intention is to follow-up with
more detailed studies in network science (link prediction, node
attribute prediction, generative models and time evolution) and legal
and political analyses.}
}




@article{hadjibeyli2016distance,
  title={Distance rationalization of social rules},
  author={Hadjibeyli, Benjamin and Wilson, Mark C.},
  journal={arXiv preprint arXiv:1610.01902},
  year={2016},
  keywords={social choice, voting},
  url_Paper={http://arxiv.org/abs/1610.01902},
  abstract={The concept of distance rationalizability of social choice rules has
been explored in recent years by several authors. We deal here with
several foundational questions, and unify, correct, and generalize
previous work. For example, we study a new question involving uniqueness
of representation in the distance rationalizability framework, and
present a counterexample. For rules satisfying various axiomatic
properties such as anonymity, neutrality and homogeneity, the standard
profile representation of input can be compressed substantially. We
explain in detail using quotient constructions how distance
rationalizability is interpreted in this situation. This enables us to
connect the theory of distance rationalizability with geometric concepts
such as Earth Mover distance and optimal transportation. We give
improved sufficient conditions for distance rationalizable rules to
satisfy anonymity, neutrality, homogeneity, consistency and continuity.}
}




@inproceedings {MeWi2016, 
AUTHOR = {Stephen Melczer and Wilson, Mark C.},
     TITLE = {Asymptotics of lattice walks via analytic combinatorics in several variables},
 BOOKTITLE = {2016 {C}onference on {F}ormal {P}ower {S}eries and {A}lgebraic {C}ombinatorics, FPSAC2016},
    SERIES = {Discrete Math. Theor. Comput. Sci. Proc., AH},
     PAGES = {863-874},
 PUBLISHER = {Assoc. Discrete Math. Theor. Comput. Sci., Nancy},
      YEAR = {2016},
  keywords={ACSV applications},
  url_Paper={https://dmtcs.episciences.org/6390/pdf},
  abstract={We consider the enumeration of walks on the two dimensional non-negative
integer lattice with short steps. Up to isomorphism there are 79 unique
two dimensional models to consider, and previous work in this area has
used the kernel method, along with a rigorous computer algebra approach,
to show that 23 of the 79 models admit D-finite generating functions. In
2009, Bostan and Kauers used Pad\'{e}-Hermite approximants to guess
differential equations which these 23 generating functions satisfy, in
the process guessing asymptotics of their coefficient sequences. In this
article we provide, for the first time, a complete rigorous verification
of these guesses. Our technique is to use the kernel method to express
19 of the 23 generating functions as diagonals of tri-variate rational
functions and apply the methods of analytic combinatorics in several
variables (the remaining 4 models have algebraic generating functions
and can thus be handled by univariate techniques). This approach also
shows the link between combinatorial properties of the models and
features of its asymptotics such as asymptotic and polynomial growth
factors. In addition, we give expressions for the number of walks
returning to the x-axis, the y-axis, and the origin, proving recently
conjectured asymptotics of Bostan, Chyzak, van Hoeij, Kauers, and Pech.}
  
}




@article{wilson2015diagonal,
  title={Diagonal asymptotics for products of combinatorial classes},
  author={Wilson, Mark C.},
  journal={Combinatorics, Probability and Computing},
  volume={24},
  number={1},
  pages={354-372},
  year={2015},
  publisher={Cambridge University Press},
  keywords={ACSV theory},
  url_Paper={https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/diagonal-asymptotics-for-products-of-combinatorial-classes/DE65A4AA078A6161905DD6CEFBEDC85E},
  abstract={We generalize and improve recent results by B\'{o}na and Knopfmacher and
by Banderier and Hitczenko concerning the joint distribution of the sum
and number of parts in tuples of restricted compositions. Specifically,
we generalize the problem to general combinatorial classes and relax the
requirement that the sizes of the compositions be equal. We extend the
main explicit results to enumeration problems whose counting sequences
are Riordan arrays.  In this framework, we give an alternative method
for computing asymptotics in the supercritical case, which avoids
explicit diagonal extraction and seems likely to be computationally more
efficient.}
}



@article{MSW2014,
  author    = {Toufik Mansour and
               Mark Shattuck and
               Mark C. Wilson},
  title     = {Congruence successions in compositions},
  journal   = {Discret. Math. Theor. Comput. Sci.},
  volume    = {16},
  number    = {1},
  pages     = {327-338},
  year      = {2014},
  keywords={combinatorics},
  url       = {http://dmtcs.episciences.org/1252},
  abstract={A \emph{composition} is a sequence of positive integers, called
\emph{parts}, having a fixed sum.  By an \emph{$m$-congruence
succession}, we will mean a pair of adjacent parts $x$ and $y$ within a
composition such that $x\equiv y~(\text{mod}~m)$.  Here, we consider the
problem of counting the compositions of size $n$ according to the number
of $m$-congruence successions, extending recent results concerning
successions on subsets and permutations.  A general formula is obtained,
which reduces in the limiting case to the known generating function
formula for the number of Carlitz compositions.  Special attention is
paid to the case $m=2$, where further enumerative results may be
obtained by means of combinatorial arguments.  Finally, an asymptotic
estimate is provided for the number of compositions of size $n$ having
no $m$-congruence successions.}
}



@inproceedings{EmWi2014,
  author    = {Miranda Emery and
               Mark C. Wilson},
  title     = {Iterated Regret Minimization in Voting Games},
  booktitle = {COMSOC 2014, Pittsburgh, June 23-25, 2014},
  pages     = {12pp},
  year      = {2014},
  keywords={social choice, voting, game theory},
 url   = {http://www.cs.cmu.edu/~arielpro/comsoc-14/papers/EmeryWilson2014.pdf},
  abstract={The game-theoretic solution concept Iterated Regret Minimization (IRM)
was introduced recently by Halpern and Pass. We give the first
application of IRM to simultaneous voting games. We study positional
scoring rules in detail and give theoretical results demonstrating the
bias of IRM toward sincere voting. We present comprehensive simulation
results of the effect on social welfare of IRM compared to both sincere
and optimal voting. The results fit into a broader research theme of the
welfare consequences of strategic voting.}
}




@article{wilson2014simulating,
  title={Simulating the 2011 Referendum in New Zealand},
  author={Wilson, Mark C. and Pritchard, Geoffrey},
  journal={Parliamentary Affairs},
  volume={67},
  number={4},
  pages={969-980},
  year={2014},
  publisher={Oxford University Press},
  keywords={electoral systems, simulation},
  url_Paper={https://markcwilson.site/Research/Outputs/PrWi2013.pdf},
  url_Slides={https://www.stat.auckland.ac.nz/~geoff/voting/},
  abstract={On 26 November 2011, an indicative referendum was held in New Zealand
with the aim of gauging public support for a change from the current
parliamentary electoral system (Mixed Member Proportional) to one of
four alternatives. In order to understand the consequences (in terms of
the seat distribution of parties in Parliament) of a change in electoral
system, we created an online simulator several months before the
referendum date. Several interesting research issues arose in this work,
which in our opinion deserve greater analysis. We describe the
assumptions made in order to create such a simulator, and their
consequences.}
}



@article{wilson2013review,
  title={Review of Models of Conflict and Cooperation by Rick Gillman and David Housman},
  author={Wilson, Mark C.},
  journal={ACM SIGACT News},
  volume={44},
  number={1},
  pages={34-35},
  year={2013},
  publisher={ACM New York, NY, USA},
  keywords={review},
  url_Paper={},
  abstract={}
}



@book{pemantle2013analytic,
  title={Analytic combinatorics in several variables},
  author={Pemantle, Robin and Wilson, Mark C.},
  year={2013},
  publisher={Cambridge University Press},
  keywords={ACSV theory},
  url_Paper={},
  abstract={}
}



@article{pritchard2013power,
  title={Power measures derived from the sequential query process},
  author={Pritchard, Geoffrey and Reyhani, Reyhaneh and Wilson, Mark C.},
  journal={Mathematical Social Sciences},
  volume={65},
  number={3},
  pages={174-180},
  year={2013},
  publisher={North-Holland},
  keywords={social choice, cooperative games},
  url_Paper={https://www.sciencedirect.com/science/article/pii/S0165489612001096?casa_token=4x3gmLGuiPIAAAAA:9crEC8R6F3yj1ut1S482WqW3UPlxOvAyL6-gzldpHWnpp7qYgbMYugOhgwxefm-mB6TFBETE_Q},
  abstract={We study a basic sequential model for the discovery of winning
coalitions in a simple game, well known from its use in defining the
Shapley-Shubik power index. We derive in a uniform way a family of
measures of collective and individual power in simple games, and show
that, as for the Shapley-Shubik index, they extend naturally to measures
for TU-games. In particular, the individual measures include all
weighted semivalues. We single out the simplest measure in our family
for more investigation, as it is new to the literature as far as we
know. Although it is very different from the Shapley value, it is
closely related in several ways, and is the natural analogue of the
Shapley value under a nonstandard, but natural, definition of simple
game. We illustrate this new measure by calculating its values on some
standard examples.}
}



@misc{WiFo2012,
  title={Submission to the Electoral Commission review of MMP},
  author={Wilson, Mark C. and Fowlie, Michael},
  year={2012},
  publisher={Electoral Commission of New Zealand},
   keywords={electoral systems},
  url_Paper={https://elections.nz/assets/2012-report-of-the-Electoral-Commission-on-the-review-of-mmp.pdf},
  abstract={},
}



@misc{wilson2012elsevier,
  title={The Elsevier boycott and beyond},
  author={Wilson, Mark C.},
  journal={New Zealand Mathematical Society Newsletter},
  year={2012},
  publisher={},
    keywords={publication reform, advocacy},
  url_Paper={https://markcwilson.site/Research/Outputs/elsevier-nzms.pdf},
  abstract={}
}



@article{wilson2012random,
  title={Random Cayley digraphs of diameter 2 and given degree},
  author={Wilson, Mark C. and {\v{S}}ir{\'a}{\v{n}}, Jozef and Poto{\v{c}}nik, Primo{\v{z}} and Lladser, Manuel E.},
  journal={Discrete Mathematics \& Theoretical Computer Science},
  volume={14},
  year={2012},
  publisher={Episciences. org},
  keywords={combinatorics},
  url_Paper={https://dmtcs.episciences.org/588/pdf},
  abstract={}
}



@inproceedings{reyhani2012best,
  title={Best reply dynamics for scoring rules},
  author={Reyhani, Reyhaneh and Wilson, Mark C.},
  booktitle={Proceedings of the 20th European Conference on Artificial Intelligence},
  pages={672-677},
  year={2012},
  organization={IOS Press},
  keywords={social choice, voting},
  url_Paper={https://ebooks.iospress.nl/doi/10.3233/978-1-61499-098-7-672},
  abstract={We consider best-reply dynamics for voting games in which all players
are strategic and no coalitions are formed. We study the class of
scoring rules, show convergence of a suitably restricted version for the
plurality and veto rules, and failure of convergence for other rules
including $k$-approval and Borda. In particular, for 3 candidates
convergence fails for all rules other than plurality and veto. We give a
unified proof for the convergence of these two rules. Our proofs in the
case of plurality improve the known bound on convergence, and the other
convergence results are new.}
}



@inproceedings{RWK2012,
  author    = {Reyhaneh Reyhani and
               Mark C. Wilson and Javad Khazaei},
  title     = {Coordination via Polling in Plurality Voting Games
under Inertia},
  booktitle = {COMSOC 2012, Krakow, September 11-13, 2012},
  pages     = {359-370},
  year      = {2012},
  keywords={social choice, voting, game theory},
  url       = {http://home.agh.edu.pl/~faliszew/COMSOC-2012/proceedings/paper_52.pdf},
  abstract={We discuss a general model for strategic voting in plurality elections
under uncertainty, using the concept of inertia to deal with information
and risk attitude of agents. The model is flexible enough to be used for
human societies and artificially designed multiagent systems. Under some
further assumptions we show that a sequence of pre-election polls can
help agents to coordinate on an equilibrium outcome. This mechanism is
closely related to the STV voting rule and gives insight into the
political science principle known as Duverger's law.}
}




@article{raichev2012new,
  title={A new approach to asymptotics of Maclaurin coefficients of algebraic functions},
  author={Raichev, Alexander and Wilson, Mark C.},
  journal={arXiv preprint arXiv:1202.3826},
  year={2012},
  keywords={ACSV theory},
  url_Paper={https://arxiv.org/pdf/1202.3826.pdf},
  abstract={We propose a general method for deriving asymptotics of the Maclaurin
series coefficients of algebraic functions that is based on a procedure of K. V. Safonov
and multivariate singularity analysis. We test the feasibility of this this approach by
experimenting on several examples.}
}



@inproceedings{IYEW2011,
  author    = {Egor Ianovski and
               Lan Yu and
               Edith Elkind and
               Mark C. Wilson},
  title     = {The Complexity of Safe Manipulation under Scoring Rules},
  booktitle = {{IJCAI} 2011, Proceedings of the 22nd International Joint Conference
               on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22,
               2011},
  pages     = {246-251},
  year      = {2011},
 keywords={social choice, voting, algorithms},
 url       = {http://ijcai.org/papers11/Papers/IJCAI11-052.pdf},
 abstract={Slinko and White have recently introduced a new model of coalitional
manipulation of voting rules under limited communication, which they
call safe strategic voting". The computational aspects of this model
were first studied by Hazon and Elkind, who provide polynomial-time
algorithms for finding a safe strategic vote under $k$-approval and the
Bucklin rule. In this paper, we answer an open question of Hazon and
Elkind by presenting a polynomial-time algorithm for finding a safe
strategic vote under the Borda rule. Our results for Borda generalize to
several interesting classes of scoring rules.}
 }



@inproceedings{ReWi2010,
  author    = {Reyhaneh Reyhani and
               Mark C. Wilson},
  title     = {The Probability of Safe Manipulation},
  booktitle = {COMSOC 2010, D\"{u}sseldorf, September 13-16, 2010},
  pages     = {423-430},
  year      = {2010},
  keywords={social choice, voting},
  url       = {http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/papers/comsoc2010.pdf},
  abstract={The concept of safe manipulation has recently been introduced by Slinko
and White. We show how to compute the asymptotic probability that a safe
manipulation exists for a given scoring rule under the uniform
distribution on voting situations (the so- called Impartial Anonymous
Culture). The technique used is computation of volumes of convex
polytopes. We present explicit numerical results in the 3-candidate
case.}
}




@article{wilson2010mathematics,
  title={Review of The mathematics of voting and elections: a hands-on approach by Jonathan K. Hodge and Richard E. Klima american mathematical society (mathematical world series, volume 22) 226+ xiv pages},
  author={Wilson, Mark C.},
  journal={ACM SIGACT News},
  volume={41},
  number={3},
  pages={34-36},
  year={2010},
  publisher={ACM New York, NY, USA},
  keywords={review},
  url_Paper={},
  abstract={}
}



@article{raichev2010asymptotics,
  title={Asymptotics of coefficients of multivariate generating functions: improvements for multiple points},
  author={Raichev, Alexander and Wilson, Mark C.},
  journal={arXiv preprint arXiv:1009.5715},
  year={2010},
  keywords={ACSV theory},
  url_Paper={},
  abstract={Let $F(x)= \sum_{\nu\in\mathbb{N}^d} F_\nu x^\nu$ be a multivariate
power series with complex coefficients that converges in a neighborhood
of the origin. Assume $F=G/H$ for some functions $G$ and $H$ holomorphic
in a neighborhood of the origin. We derive asymptotics for the
coefficients $F_{r\alpha}$ as $r \to \infty$ with $r\alpha \in
\mathbb{N}^d$ for $\alpha$ in a permissible subset of $d$-tuples of
positive reals. More specifically, we give an algorithm for computing
arbitrary terms of the asymptotic expansion for $F_{r\alpha}$ when the
asymptotics are controlled by a transverse multiple point of the
analytic variety $H = 0$. This improves upon earlier work  by R.
Pemantle and M. C. Wilson. We have implemented our algorithm in Sage and
apply it to obtain accurate numerical results for several rational
combinatorial generating functions.}
}



@article{wilson2010interesting,
  title={An interesting new Mahonian permutation statistic},
  author={Wilson, Mark C.},
  journal={Electronic Journal of Combinatorics},
  pages={R147},
  year={2010},
  keywords={combinatorics},
  url_Paper={https://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r147/pdf},
  abstract={The standard algorithm for generating a random permutation gives rise to
an obvious permutation statistic DIS that is readily seen to be
Mahonian. We give evidence showing that it is not equal to any
previously published statistic. Nor does its joint distribution with the
standard Eulerian statistics des and exc appear to coincide with any
known Euler-Mahonian pair.

A general construction of Skandera yields an Eulerian partner eul such
that (eul, DIS) is equidistributed with (des, MAJ). However eul itself
appears not to be a known Eulerian statistic.

Several ideas for further research on this topic are listed.}
}



@incollection {PeWi2010,
    AUTHOR = {Pemantle, Robin and Wilson, Mark C.},
     TITLE = {Asymptotic expansions of oscillatory integrals with complex
              phase},
 BOOKTITLE = {Algorithmic probability and combinatorics},
    SERIES = {Contemp. Math.},
    VOLUME = {520},
     PAGES = {221-240},
 PUBLISHER = {Amer. Math. Soc., Providence, RI},
      YEAR = {2010},
       keywords={ACSV theory},
  url_Paper={https://arxiv.org/pdf/0903.3585.pdf},
  abstract={We consider saddle point integrals in $d$ variables whose phase function
is neither real nor purely imaginary. Results analogous to those for
Laplace (real phase) and Fourier (imaginary phase) integrals hold
whenever the phase function is analytic and nondegenerate. These results
generalize what is well known for integrals of Laplace and Fourier type.
The method is via contour shifting in complex $d$-space. This work is
motivated by applications to asymptotic enumeration.}
}



@book{dinneen2009introduction,
  title={Introduction to Algorithms, Data Structures and Formal Languages},
  author={Dinneen, Michael J. and Gimel'farb, Georgi{\u\i} L'vovich and Wilson, Mark C.},
  year={2009},
  publisher={Pearson Education New Zealand},
  keywords={algorithms, teaching},
  url_Paper={},
  abstract={}
}



@article{pritchard2009asymptotics,
  title={Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour},
  author={Pritchard, Geoffrey and Wilson, Mark C.},
  journal={Mathematical Social Sciences},
  volume={58},
  number={1},
  pages={35-57},
  year={2009},
  publisher={North-Holland},
  keywords={social choice, voting, computation},
  url_Paper={https://www.sciencedirect.com/science/article/abs/pii/S0165489609000225},
  abstract={We consider the problem of manipulation of elections using positional
voting rules under Impartial Culture voter behaviour. We consider both
the logical possibility of coalitional manipulation, and the number of
voters that must be recruited to form a manipulating coalition. It is
shown that the manipulation problem may be well approximated by a very
simple linear program in two variables. This permits a comparative
analysis of the asymptotic (large-population) manipulability of the
various rules. It is seen that the manipulation resistance of positional
rules with 5 or 6 (or more) candidates is quite different from the more
commonly analyzed 3- and 4-candidate cases.}
}



@article{wilson2009random,
  title={Random and exhaustive generation of permutations and cycles},
  author={Wilson, Mark C.},
  journal={Annals of Combinatorics},
  volume={12},
  number={4},
  pages={509-520},
  year={2009},
  publisher={SP Birkh{\"a}user Verlag Basel},
  keywords={algorithms, combinatorics},
  url_Paper={https://link.springer.com/content/pdf/10.1007/s00026-009-0003-3.pdf},
  abstract={In 1986 S. Sattolo introduced a simple algorithm for uniform random
generation of cyclic permutations on a fixed number of symbols. This
algorithm is very similar to the standard method for generating a random
permutation, but is less well known. We consider both methods in a
unified way, and discuss their relation with exhaustive generation
methods. We analyse several random variables associated with the
algorithms and find their grand probability generating functions, which
gives easy access to moments and limit laws.}
}



@article{pemantle2008twenty,
  title={Twenty combinatorial examples of asymptotics derived from multivariate generating functions},
  author={Pemantle, Robin and Wilson, Mark C.},
  journal={SIAM Review},
  volume={50},
  number={2},
  pages={199-272},
  year={2008},
  publisher={Society for Industrial and Applied Mathematics},
  keywords={ACSV theory},
  url_Paper={https://epubs.siam.org/doi/epdf/10.1137/050643866},
  abstract={Let $F$ be a power series in at least two variables that defines a
meromorphic function in a neighbourhood of the origin; for example, $F$
may be a rational multivariate generating function. We discuss recent
results that allow the effective computation of asymptotic expansions
for the coefficients of  $F$, uniform in certain explicitly defined
cones of directions.

The purpose of this article is to illustrate the use of these techniques
on a variety of problems of combinatorial interest. The first part
reviews the Morse-theoretic underpinnings of these techniques, and then
summarizes the necessary results so that only elementary analyses are
needed to check hypotheses and carry out computations. The remainder
focuses on combinatorial applications. Specific examples deal with
enumeration of words with forbidden substrings, edges and cycles in
graphs, polyominoes, descents and solutions to integer equations. After
the individual examples, we discuss three broad classes of examples,
namely functions derived via the transfer matrix method, those derived
via the kernel method, and those derived via the method of Lagrange
inversion. Generating functions derived in these three ways are amenable
to our asymptotic analyses, and we state some further general results
that apply to these cases.}
}



@article{raichev2008asymptotics,
  title={Asymptotics of coefficients of multivariate generating functions: improvements for smooth points},
  author={Raichev, Alexander and Wilson, Mark C.},
  journal={Electronic Journal of Combinatorics},
  pages={R89-R89},
  year={2008},
  keywords={ACSV theory},
  url_Paper={https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r89/pdf},
  abstract={Let $\sum_{\beta\in\mathbb{N}^d} F_\beta x^\beta$ be a multivariate
power series, a generating function for a combinatorial class perhaps.
Assume that in a neighborhood of the origin this series represents a
nonentire function $F=G/H^p$ where $G$ and $H$ are holomorphic and $p$
is a positive integer. Given a direction $\alpha\in\mathbb{N}_+^d$ for
which asymptotics are controlled by a smooth point of the singular
variety $H = 0$, we compute the asymptotics of $F_{n\alpha}$ as
$n\to\infty$. We do this via multivariate singularity analysis and give
an explicit formula for the full asymptotic expansion. This improves on
earlier work of R. Pemantle and the second author, and allows for much
more accurate numerical approximation, as demonstrated in our examples.}
}



@InProceedings{RaWi2007,
  author    = {Raichev, Alexander and Wilson, Mark C.},
  booktitle = {2007 {C}onference on {A}nalysis of {A}lgorithms, {A}of{A} 07},
  title     = {A new method for computing asymptotics of diagonal coefficients of multivariate generating functions},
  pages     = {439-449},
  publisher = {Assoc. Discrete Math. Theor. Comput. Sci., Nancy},
  series    = {Discrete Math. Theor. Comput. Sci. Proc., AH},
  abstract  = {Let $\sum_{\mathbf{n}\in\mathbb{N}^d} F_\mathbf{n}
\mathbf{x}^\mathbf{n}$ be a multivariate generating function that
converges in a neighborhood of the origin of $\mathbb{C}^d$. We present
a new, multivariate method for computing the asymptotics of the diagonal
coefficients $F_{a_1n,\ldots,a_dn}$ and show its superiority over the
standard, univariate diagonal method. Several examples are given in
detail.},
  keywords  = {ACSV theory},
  url_link  = {https://dmtcs.episciences.org/3531/pdf},
  year      = {2007},
}



@article{wilson2007probability,
  title={Probability calculations under the IAC hypothesis},
  author={Wilson, Mark C. and Pritchard, Geoffrey},
  journal={Mathematical Social Sciences},
  volume={54},
  number={3},
  pages={244-256},
  year={2007},
  publisher={North-Holland},
  keywords={social choice, voting, computation},
  url_Paper={https://www.sciencedirect.com/science/article/abs/pii/S0165489607000443},
  abstract={We show how powerful algorithms recently developed for counting lattice
points and computing volumes of convex polyhedra can be used to compute
probabilities of a wide variety of events of interest in social choice
theory. Several illustrative examples are given.}
}



@article{pritchard2007exact,
  title={Exact results on manipulability of positional voting rules},
  author={Pritchard, Geoffrey and Wilson, Mark C.},
  journal={Social Choice and Welfare},
  volume={29},
  number={3},
  pages={487-513},
  year={2007},
  publisher={Springer-Verlag},
  keywords={social choice, voting},
  url_Paper={https://link.springer.com/content/pdf/10.1007/s00355-007-0216-5.pdf},
  url_Link={https://link.springer.com/article/10.1007/s00355-007-0216-5},
  abstract={We consider 3-candidate elections under a general scoring rule and
derive precise conditions for a given voting situation to be
strategically manipulable by a given coalition of voters. We present an
algorithm that makes use of these conditions to compute the minimum size
$M$ of a manipulating coalition for a given voting situation. The
algorithm works for any voter preference model - here we present
numerical results for IC and for IAC, for a selection of scoring rules,
and for numbers of voters up to 150. A full description of the
distribution of $M$ is obtained, generalizing all previous work on the
topic. The results obtained show interesting phenomena and suggest
several conjectures. In particular we see that rules {``} between
plurality and Borda{"} behave very differently from those {``} between
Borda and antiplurality{"}.}
}



@inproceedings {Wils2005,
    AUTHOR = {Wilson, Mark C.},
     TITLE = {Asymptotics for generalized {R}iordan arrays},
 BOOKTITLE = {2005 {I}nternational {C}onference on {A}nalysis of
              {A}lgorithms},
    SERIES = {Discrete Math. Theor. Comput. Sci. Proc., AD},
     PAGES = {323-333 (electronic)},
 PUBLISHER = {Assoc. Discrete Math. Theor. Comput. Sci., Nancy},
      YEAR = {2005},
       keywords={ACSV theory},
  url_Paper={https://dmtcs.episciences.org/3389/pdf},
  abstract={The machinery of Riordan arrays has been used recently by several
authors. We show how meromorphic singularity analysis can be used to
provide uniform bivariate asymptotic expansions, in the central regime,
for a generalization of these arrays. We show how to do this
systematically, for various descriptions of the array. Several examples
from recent literature are given.}
 }



@article{pemantle2004asymptotics,
  title={Asymptotics of multivariate sequences II: multiple points of the singular variety},
  author={Pemantle, Robin and Wilson, Mark C.},
  journal={Combinatorics, Probability and Computing},
  volume={13},
  number={4-5},
  pages={735-761},
  year={2004},
  publisher={Cambridge University Press},
  keywords={ACSV theory},
  url_Paper={https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/asymptotics-of-multivariate-sequences-ii-multiple-points-of-the-singular-variety/F8B144EBED2754E43361A3BE4B0C3B01},
  abstract={Let $F(\b{z})=\sum_\b{r} a_\b{r}\b{z^r}$ be a multivariate  generating
function which is meromorphic in some neighborhood of the origin of
$\mathbb{C}^d$, and let $\mathcal{V}$ be its set of singularities.
Effective asymptotic expansions for the coefficients can be obtained by
complex contour integration near points of $\mathcal{V}$. In the first
article in this series, we treated the case of smooth points  of
$\mathcal{V}$. In this article we deal with multiple points of
$\mathcal{V}$. Our results show that the central limit
(Ornstein-Zernike) behavior typical of the smooth case does not hold in
the multiple point case. For example, when $\mathcal{V}$ has a multiple
point singularity at $(1 , \ldots , 1)$, rather than $a_\b{r}$ decaying
as $|\b{r}|^{-1/2}$ as $|\b{r}| \to \infty$, $a_\b{r}$ is very nearly
polynomial in a cone of directions.}
}



@article{dinneen2002degree,
  title={Degree-and time-constrained broadcast networks},
  author={Dinneen, Michael J. and Pritchard, Geoffrey and Wilson, Mark C.},
  journal={Networks},
  volume={39},
  number={3},
  pages={121-129},
  year={2002},
  publisher={Wiley},
  keywords={combinatorics, algorithms, graphs},
  url_Paper={DPW2002.pdf},
  abstract={We consider the problem of constructing networks with as many nodes as
possible, subject to upper bounds on the degree and broadcast time. The
paper includes the results of an extensive empirical study of
broadcasting in small regular graphs using a stochastic search algorithm
to approximate the broadcast time. Significant improvements on known
results are obtained for cubic broadcast networks.} 
}



@article{pemantle2002asymptotics,
  title={Asymptotics of multivariate sequences: I. smooth points of the singular variety},
  author={Pemantle, Robin and Wilson, Mark C.},
  journal={Journal of Combinatorial Theory, Series A},
  volume={97},
  number={1},
  pages={129-161},
  year={2002},
  publisher={Academic Press},
  keywords={ACSV theory},
  url_Paper={https://www.sciencedirect.com/science/article/pii/S0097316501932017},
  abstract={Given a multivariate generating function $F(z_1 , \ldots , z_d) = \sum
a_{r_1 , \ldots , r_d} z_1^{r_1} \cdots z_d^{r_d}$, we determine
asymptotics for the coefficients. Our approach is to use Cauchy's
integral formula near singular points of $F$, resulting in a tractable
oscillating integral. This paper treats the case where the singular
point of $F$ is a smooth point of a surface of poles. Companion papers G
treat singular points of $F$ where the local geometry is more
complicated, and for which other methods of analysis are not known.}
}



@misc{wilson2000submission,
  title={Submission to the Tertiary Education Advisory Commission},
  author={Wilson, Mark C. and Gracewood, Jolisa and Easther, Richard and Peet, Amanda and 
  Elleray, Michelle and Somerville, A.T.},
  year={2000},
  keywords={advocacy},
  url_Paper={},
  abstract={}
}



@article{bergen1999x,
  title={X-inner automorphisms of semi-commutative quantum algebras},
  author={Bergen, Jeffrey and Wilson, Mark C.},
  journal={Journal of Algebra},
  volume={220},
  number={1},
  pages={152-173},
  year={1999},
  publisher={Academic Press},
  keywords={algebra},
  url_Paper={https://www.sciencedirect.com/science/article/pii/S0021869399979279},
  abstract={Many important quantum algebras such as quantum symplectic space,
quantum euclidean space, quantum matrices, $q$-analogs of the Heisenberg
algebra and the quantum Weyl algebra are semi-commutative. In addition,
enveloping algebras $U(L_+)$ of even Lie color algebras are also
semi-commutative. In this paper, we generalize work of Montgomery and
examine the X-inner automorphisms of such algebras. The theorems and
examples in our paper show that for algebras $R$ of this type, the
non-identity X-inner automorphisms of  $R$ tend to have infinite order.
Thus if $G$ is a finite group of automorphisms of $R$, then the action
of $G$ will be X-outer and this immediately gives useful information
about crossed products  $R∗_t G$.}
}



@article{riley1999associative,
  title={Associative algebras satisfying a semigroup identity},
  author={Riley, D.M. and Wilson, Mark C.},
  journal={Glasgow Mathematical Journal},
  volume={41},
  number={3},
  pages={453-462},
  year={1999},
  publisher={Cambridge University Press},
  keywords={algebra},
  url_Paper={https://www.cambridge.org/core/journals/glasgow-mathematical-journal/article/associative-algebras-satisfying-a-semigroup-identity/89A9FE38678C0635AE59E0B3286291CA},
  abstract={Denote by $(R,\cdot)$ the multiplicative semigroup of an associative
algebra $R$ over an infinite field, and let $(R,\circ)$ represent $R$
when viewed as a semigroup via the circle operation $x\circ y=x+y+xy$.
In this paper we characterize the existence of an identity in these
semigroups in terms of the Lie structure of $R$. Namely, we prove that
the following conditions on $R$ are equivalent: the semigroup
$(R,\circ)$ satisfies an identity; the semigroup $(R,\cdot)$ satisfies a
reduced identity; and, the associated Lie algebra of $R$ satisfies the
Engel condition. When $R$ is finitely generated these conditions are
each equivalent to $R$ being upper Lie nilpotent.}
}



@article{dinneen1999construction,
  title={Construction of time-relaxed minimal broadcast networks},
  author={Dinneen, Michael J. and Ventura, Jose A. and Wilson, Mark C. and Zakeri, Golbon},
  journal={Parallel Processing Letters},
  volume={9},
  number={01},
  pages={53-68},
  year={1999},
  publisher={World Scientific Publishing Company},
  keywords={algorithms, combinatorics, graphs},
  url_Paper={https://www.worldscientific.com/doi/abs/10.1142/S0129626499000086},
  abstract={In broadcasting, or one-to-all communication, a message originally held
in one node of the network must be transmitted to all the other nodes. A
minimal broadcast network is a communication network that can transmit a
message originated at any node to all other nodes of the network in
minimum time. In this paper, we present a compound method to construct
sparse, time-relaxed, minimal broadcast networks ( $t$-mbn), in which
broadcasting can be accomplished in slightly more than the minimum time.
The proposed method generates a new network by connecting a subset of
nodes from several copies of a $t_1$-mbn using the structure of another
$t_2$-mbn. The objective is to construct a network as sparse as possible
satisfying the desired broadcasting time constraint. Computational
results illustrate the effectiveness of the proposed method.}
}



@article{riley1999group,
  title={Group algebras and enveloping algebras with nonmatrix and semigroup identities},
  author={Riley, D.M. and Wilson, Mark C.},
  journal={Communications in Algebra},
  volume={27},
  number={7},
  pages={3545-3556},
  year={1999},
  publisher={Taylor \& Francis},
  keywords={algebra},
  url_Paper={https://www.tandfonline.com/doi/abs/10.1080/00927879908826645},
  abstract={Let $K$ be a field of characteristic $p>0$.  Denote by $\omega(R)$ the
augmentation ideal of either a group algebra $R=K[G]$ or a restricted
enveloping algebra $R=u(L)$ over $K$.   We first characterize those $R$
for which $\omega(R)$ satisfies a polynomial identity not satisfied by
the algebra of all $2\times 2$ matrices over $K$. Then, we examine those
$R$ for which $\omega(R)$ satisfies a semigroup identity (that is, a
polynomial identity which can be written as the difference of two
monomials).}
}



@article{riley1999associative,
  title={Associative rings satisfying the Engel condition},
  author={Riley, D.M. and Wilson, Mark C.},
  journal={Proceedings of the American Mathematical Society},
  volume={127},
  number={4},
  pages={973-976},
  year={1999},
  keywords={algebra},
  url_Paper={https://www.ams.org/journals/proc/1999-127-04/S0002-9939-99-04643-2/S0002-9939-99-04643-2.pdf},
  abstract={Let $C$ be a commutative ring, and let $R$ be an associative $C$-algebra
generated by elements $\{x_1,\ldots,x_d\}$. We show that if $R$
satisfies the Engel condition of degree $n$ then $R$ is upper Lie
nilpotent of class bounded by a function that depends only on $d$ and
$n$. We deduce that the Engel condition in an arbitrary associative ring
is inherited by its group of units, and implies a semigroup identity.}
}



@article{dinneen1999compound,
  title={Compound constructions of broadcast networks},
  author={Dinneen, Michael J. and Ventura, Jose A. and Wilson, Mark C. and Zakeri, Golbon},
  journal={Discrete Applied Mathematics},
  volume={93},
  number={2-3},
  pages={205-232},
  year={1999},
  publisher={North-Holland},
  keywords={algorithms, combinatorics, graphs},
  url_Paper={https://www.sciencedirect.com/science/article/pii/S0166218X99000438},
  abstract={Compound methods have been shown to be very effective in the
construction of minimal broadcast networks (mbns). Compound methods
generate a large mbn by combining multiple copies of an mbn $G$ using
the structure of another mbn $H$. Node deletion is also allowed in some
of these methods. The subset of connecting nodes of $G$ has been defined
as solid  $h$-cover by Bermond, Fraigniaud and Peters, and center node
set by Weng and Ventura. This article shows that the two concepts are
equivalent. We also provide new properties for center node sets,
including bounds on the minimum size of a center node set, show how to
reduce the number of center nodes of an mbn generated by a compound
method, and propose an iterative compounding algorithm that generates
the sparsest known mbns in many cases.}
}



@article{wilson1998primitive,
  title={Primitive ideals in Hopf algebra extensions},
  author={Wilson, Mark C.},
  journal={arXiv preprint math/9808122},
  year={1998},
  keywords={algebra},
  url_Paper={https://arxiv.org/pdf/math/9808122.pdf},
  abstract={My last paper in algebra, never published formally.}
}



@article{wilson1998bell,
  title={Bell's primeness criterion and the simple Lie superalgebras},
  author={Wilson, Mark C.},
  journal={Journal of Pure and Applied Algebra},
  volume={133},
  number={1-2},
  pages={241-260},
  year={1998},
  publisher={North-Holland},
  keywords={algebra},
  url_Paper={https://www.sciencedirect.com/science/article/pii/S0022404997001990},
  abstract={We determine all finite-dimensional simple Lie superalgebras $L$ such
that $U(L)$ satisfies a primeness criterion due to Bell. Some open
problems related to primeness of enveloping algebras are listed.}
}



@article{wilson1998primeness,
  title={Primeness of the enveloping algebra of the special Lie superalgebras},
  author={Wilson, Mark C. and Pritchard, Geoffrey},
  journal={Archiv der Mathematik},
  volume={70},
  number={3},
  pages={187-196},
  year={1998},
  publisher={Birkh{\"a}user Verlag},
  keywords={algebra},
  url_Paper={https://link.springer.com/article/10.1007/s000130050183},
  abstract={A primeness criterion due to Bell is shown to apply to the universal
enveloping algebra of the Cartan type Lie superalgebras $S(V)$ and
$\widetilde{S}(V;t)$ when $\dim V$ is even. On the other hand, if $\dim
V$ is odd then $U(S(V))$ is never semiprime.}
}



@article{wilson1997crossed,
  title={Crossed products of restricted enveloping algebras},
  author={Wilson, Mark C.},
  journal={Communications in Algebra},
  volume={25},
  number={2},
  pages={487-496},
  year={1997},
  publisher={Taylor \& Francis},
  keywords={algebra},
  url_Paper={https://www.tandfonline.com/doi/abs/10.1080/00927879708825868},
  abstract={Let $K$ be a field of characteristic $p>0$, let $L$ be a restricted Lie
algebra and let $R$ be an associative $K$-algebra. It is shown that the
various constructions in the literature of crossed product of  $R$ with
$u(L)$ are equivalent. We calculate explicit formulae relating the
parameters involved and obtain a formula which hints at a noncommutative
version of the Bell polynomials.}
}



@article{wilson1997bell,
  title={Bell's primeness criterion for $W(2n+ 1)$},
  author={Wilson, Mark C. and Pritchard, Geoffrey and Wood, David H.},
  journal={Experimental Mathematics},
  volume={6},
  number={1},
  pages={77-85},
  year={1997},
  publisher={Taylor \& Francis Group},
  keywords={algebra},
  url_Paper={https://doi.org/10.1080/10586458.1997.10504352},
  abstract={On the basis of experimental work involving matrix computations, we
conjecture that a criterion due to Bell for primeness of the universal
enveloping algebra of a Lie superalgebra applies to the Cartan type Lie
superalgebras $W(n)$ for $n=3$ but does not apply for odd $n\geq 5$. The
experiments lead to a rigorous proof, which we present.}
}



@article{wilson1997primeness,
  title={Primeness of the enveloping algebra of Hamiltonian superalgebras},
  author={Wilson, Mark C.},
  journal={Bulletin of the Australian Mathematical Society},
  volume={56},
  number={3},
  pages={483-488},
  year={1997},
  publisher={Cambridge University Press},
  keywords={algebra},
  url_Paper={https://www.cambridge.org/core/journals/bulletin-of-the-australian-mathematical-society/article/primeness-of-the-enveloping-algebra-of-hamiltonian-superalgebras/A643AA62E4FAC8098924C1DE44E463C8},
  abstract={In 1990 Allen Bell presented a sufficient condition for the primeness of
the universal enveloping algebra of a Lie superalgebra. Let $Q$ be a
nonsingular bilinear form on a finite-dimensional vector space over a
field of characteristic zero. In this paper we show that Bell's
criterion applies to the Hamiltonian Cartan type superalgebras
determined by $Q$, and hence obtain some new prime noetherian rings.}
}



@article{wilson1996primeness,
  title={Primeness of the enveloping algebra of a Cartan type Lie superalgebra},
  author={Wilson, Mark C.},
  journal={Proceedings of the American Mathematical Society},
  volume={124},
  number={2},
  pages={383-387},
  year={1996},
  keywords={algebra},
  url_Paper={},
  abstract={We show that a primeness criterion for enveloping algebras of Lie
superalgebras discovered by Bell is applicable to the Cartan type Lie
superalgebras $W(n)$, $n$ even. Other algebras are considered but there
are no definitive answers in these cases.}
}





@article{wilson1995delta,
  title={Delta methods in enveloping algebras of Lie color algebras},
  author={Wilson, Mark C.},
  journal={Journal of Algebra},
  volume={175},
  number={2},
  pages={661-696},
  year={1995},
  publisher={Academic Press},
  keywords={algebra},
  url_Paper={https://www.sciencedirect.com/science/article/pii/S0021869385712070},
  abstract={In recent papers J. Bergen and D.S. Passman have applied so-called
`Delta methods' to enveloping algebras of Lie superalgebras. This paper
generalizes their results to the class of Lie colour algebras. The
methods and results in this paper are very similar to those of Bergen
and Passman, and many of their proofs generalize easily. However, at
some points there are serious difficulties to overcome. The results
obtained show that if $L$ is a Lie colour algebra then the join of all
finite-dimensional ideals of  $L$ controls certain properties of the
universal enveloping algebras  $U(L)$. Specifically, we consider
primeness, semiprimeness, constants, semi-invariants, almost constants,
faithfulness of the adjoint action, the centre, almost centralizers and
the central closure.}
}

\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fdrive.google.com%2Fuc%3Fexport%3Ddownload%26id%3D1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF&amp;jsonp=1&amp;authorFirst=1&amp;sort=-year&amp;theme=side&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fdrive.google.com%2Fuc%3Fexport%3Ddownload%26id%3D1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF&amp;jsonp=1&amp;authorFirst=1&amp;sort=-year&amp;theme=side\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fdrive.google.com%2Fuc%3Fexport%3Ddownload%26id%3D1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF&amp;jsonp=1&amp;authorFirst=1&amp;sort=-year&amp;theme=side\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2023\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2023')\"\n      onkeypress=\"toggleGroup('group_2023')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2023</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"pritchard-wilson-multidistrictpreferencemodelling-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Pritchard, G.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'pritchard-wilson-multidistrictpreferencemodelling-2023', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event);\">\n    Multi-district preference modelling.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Quality & Quantity</i>, 57(1): 587–613.  2023.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('pritchard-wilson-multidistrictpreferencemodelling-2023', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Multi-district preference modelling [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pritchard-wilson-multidistrictpreferencemodelling-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pritchard-wilson-multidistrictpreferencemodelling-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{pritchard2023multi,\n  title={Multi-district preference modelling},\n  author={Pritchard, Geoffrey and Wilson, Mark C},\n  journal={Quality \\&amp; Quantity},\n  volume={57},\n  keywords={electoral systems},\n  number={1},\n  pages={587--613},\n  year={2023},\n  url_Paper={},\n  abstract   = {Generating realistic artificial preference distributions is an important\npart of any simulation analysis of electoral systems. While this has\nbeen discussed in some detail in the context of a single electoral\ndistrict, many electoral systems of interest are based on districts.\nNeither treating preferences between districts as independent nor\nignoring the district structure yields satisfactory results. We present\na model based on an extension of the classic Eggenberger-P\\&#x27;{o}lya urn,\nin which each district is represented by an urn and there is correlation\nbetween urns. We show in detail that this procedure has a small number\nof tunable parameters, is computationally efficient, and produces\n{&#x60;&#x60;}realistic-looking{&quot;} distributions. We present applications to\nretrospective analysis and forecasting of real elections, and intend to\nuse the methodology to help set optimal parameters for electoral\nsystems. (Subsumes SocArXiv paper xpb8w from 2018)}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Generating realistic artificial preference distributions is an important part of any simulation analysis of electoral systems. While this has been discussed in some detail in the context of a single electoral district, many electoral systems of interest are based on districts. Neither treating preferences between districts as independent nor ignoring the district structure yields satisfactory results. We present a model based on an extension of the classic Eggenberger-Pólya urn, in which each district is represented by an urn and there is correlation between urns. We show in detail that this procedure has a small number of tunable parameters, is computationally efficient, and produces ``realistic-looking\" distributions. We present applications to retrospective analysis and forecasting of real elections, and intend to use the methodology to help set optimal parameters for electoral systems. (Subsumes SocArXiv paper xpb8w from 2018)\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"pritchard-wilson-asymptoticwelfareperformanceofbostonassignmentalgorithms-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Pritchard, G.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://pubsonline.informs.org/doi/abs/10.1287/stsy.2022.0104\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'pritchard-wilson-asymptoticwelfareperformanceofbostonassignmentalgorithms-2023', 'https://pubsonline.informs.org/doi/abs/10.1287/stsy.2022.0104', event);\">\n    Asymptotic welfare performance of Boston assignment algorithms.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Stochastic Systems</i>, 13(2): 247–270.  2023.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://pubsonline.informs.org/doi/abs/10.1287/stsy.2022.0104\"\n     onclick=\"log_download('pritchard-wilson-asymptoticwelfareperformanceofbostonassignmentalgorithms-2023', 'https://pubsonline.informs.org/doi/abs/10.1287/stsy.2022.0104', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Asymptotic welfare performance of Boston assignment algorithms [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://www.dropbox.com/s/1jk218g16pp8qas/Mark_Wilson.pdf?dl=0\"\n     onclick=\"log_download('pritchard-wilson-asymptoticwelfareperformanceofbostonassignmentalgorithms-2023', 'https://www.dropbox.com/s/1jk218g16pp8qas/Mark_Wilson.pdf?dl=0', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Asymptotic welfare performance of Boston assignment algorithms [link]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pritchard-wilson-asymptoticwelfareperformanceofbostonassignmentalgorithms-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pritchard-wilson-asymptoticwelfareperformanceofbostonassignmentalgorithms-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{PrWi2022,\n  author  = {Pritchard, Geoffrey and Wilson, Mark C.},\n  journal = {Stochastic Systems},\n  abstract  = {We make a detailed analysis of three key algorithms (Serial Dictatorship\nand the naive and adaptive variants of the Boston algorithm) for the housing alloca-\ntion problem, under the assumption that agent preferences are chosen iid uniformly\nfrom linear orders on the items. We compute limiting distributions (with respect to\nsome common utility functions) as $n\\to\\infty$ of both the utilitarian welfare and the or-\nder bias. To do this, we compute limiting distributions of the outcomes for an arbitrary\nagent whose initial relative position in the tiebreak order is $\\theta\\in [0, 1]$, as a function of θ.\nWe expect that these fundamental results on the stochastic processes underlying these\nmechanisms will have wider applicability in future. Overall our results show that the\ndifferences in utilitarian welfare performance of the three algorithms are fairly small,\nbut the differences in order bias are much greater. Also, Naive Boston beats Adaptive\nBoston, which beats Serial Dictatorship, on both welfare and order bias.\n},\n  title   = {Asymptotic welfare performance of Boston assignment algorithms},\n  year    = {2023},\n  number  = {2},\n  pages   = {247--270},\n  volume  = {13},\n  doi     = {},\n  keywords = {social choice,assignment},\n  url_paper = {https://pubsonline.informs.org/doi/abs/10.1287/stsy.2022.0104},\n  url_slides = {https://www.dropbox.com/s/1jk218g16pp8qas/Mark_Wilson.pdf?dl=0},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We make a detailed analysis of three key algorithms (Serial Dictatorship and the naive and adaptive variants of the Boston algorithm) for the housing alloca- tion problem, under the assumption that agent preferences are chosen iid uniformly from linear orders on the items. We compute limiting distributions (with respect to some common utility functions) as $n\\to∞$ of both the utilitarian welfare and the or- der bias. To do this, we compute limiting distributions of the outcomes for an arbitrary agent whose initial relative position in the tiebreak order is $θ∈ [0, 1]$, as a function of θ. We expect that these fundamental results on the stochastic processes underlying these mechanisms will have wider applicability in future. Overall our results show that the differences in utilitarian welfare performance of the three algorithms are fairly small, but the differences in order bias are much greater. Also, Naive Boston beats Adaptive Boston, which beats Serial Dictatorship, on both welfare and order bias. \n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ghaffari-wilson-amodelforreferencelistlengthofscholarlyarticles-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Ghaffari, F.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/pdf/2305.00089.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'ghaffari-wilson-amodelforreferencelistlengthofscholarlyarticles-2023', 'https://arxiv.org/pdf/2305.00089.pdf', event);\">\n    A model for reference list length of scholarly articles.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Scientometrics</i>, 128(9): 5335–5350.  2023.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/pdf/2305.00089.pdf\"\n     onclick=\"log_download('ghaffari-wilson-amodelforreferencelistlengthofscholarlyarticles-2023', 'https://arxiv.org/pdf/2305.00089.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A model for reference list length of scholarly articles [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('ghaffari-wilson-amodelforreferencelistlengthofscholarlyarticles-2023', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A model for reference list length of scholarly articles [link]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ghaffari-wilson-amodelforreferencelistlengthofscholarlyarticles-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>13 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ghaffari-wilson-amodelforreferencelistlengthofscholarlyarticles-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{GhWi2023,\nauthor = {Ghaffari, Fatemeh and Wilson, Mark C.},\nabstract = {We introduce and analyse a simple probabilistic model of article\nproduction and citation behavior that explicitly assumes that there is\nno decline in citability of a given article over time. It makes\npredictions about the number and age of items appearing in the reference\nlist of an article. The latter topics have been studied before, but only\nin the context of data, and to our knowledge no models have been\npresented. We then perform large-scale analyses of reference list length\nfor a variety of academic disciplines. The results show that our simple\nmodel cannot be rejected, and indeed fits the aggregated data on\nreference lists rather well. Over the last few decades, the relationship\nbetween total publications and mean reference list length is linear to a\nhigh level of accuracy. Although our model is clearly an\noversimplification, it will likely prove useful for further modeling of\nthe scholarly literature. Finally, we connect our work to the large\nliterature on &#x60;&#x60;aging&quot; or &#x60;&#x60;obsolescence&quot; of scholarly publications, and\nargue that the importance of that area of research is no longer clear,\nwhile much of the existing literature is confused and confusing.},\ntitle = {A model for reference list length of scholarly articles},\njournal = {Scientometrics},\nyear = {2023},\npages = {5335–5350},\nvolume={128},\nnumber={9},\nkeywords = {scientometrics},\nurl_paper = {https://arxiv.org/pdf/2305.00089.pdf},\nurl_slides = {},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We introduce and analyse a simple probabilistic model of article production and citation behavior that explicitly assumes that there is no decline in citability of a given article over time. It makes predictions about the number and age of items appearing in the reference list of an article. The latter topics have been studied before, but only in the context of data, and to our knowledge no models have been presented. We then perform large-scale analyses of reference list length for a variety of academic disciplines. The results show that our simple model cannot be rejected, and indeed fits the aggregated data on reference lists rather well. Over the last few decades, the relationship between total publications and mean reference list length is linear to a high level of accuracy. Although our model is clearly an oversimplification, it will likely prove useful for further modeling of the scholarly literature. Finally, we connect our work to the large literature on ``aging\" or ``obsolescence\" of scholarly publications, and argue that the importance of that area of research is no longer clear, while much of the existing literature is confused and confusing.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2022\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2022')\"\n      onkeypress=\"toggleGroup('group_2022')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2022</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"grofman-wilson-modelsofinterelectionchangeinpartisanvoteshare-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Grofman, B. N.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://markcwilson.site/Research/Outputs/GrWi2020.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'grofman-wilson-modelsofinterelectionchangeinpartisanvoteshare-2022', 'https://markcwilson.site/Research/Outputs/GrWi2020.pdf', event);\">\n    Models of inter-election change in partisan vote share.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>J. Theoretical Politics</i>, 34: 481–498.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://markcwilson.site/Research/Outputs/GrWi2020.pdf\"\n     onclick=\"log_download('grofman-wilson-modelsofinterelectionchangeinpartisanvoteshare-2022', 'https://markcwilson.site/Research/Outputs/GrWi2020.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Models of inter-election change in partisan vote share [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://www.youtube.com/watch?v=C0eIF1oAk-U\"\n     onclick=\"log_download('grofman-wilson-modelsofinterelectionchangeinpartisanvoteshare-2022', 'https://www.youtube.com/watch?v=C0eIF1oAk-U', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Models of inter-election change in partisan vote share [link]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/grofman-wilson-modelsofinterelectionchangeinpartisanvoteshare-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>10 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('grofman-wilson-modelsofinterelectionchangeinpartisanvoteshare-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{GrWi2020,\n  author     = {Grofman, Bernard N. and Wilson, Mark C.},\n  title      = {Models of inter-election change in partisan vote share},\n  pages      = {481--498},\n  volume\t = {34},\n  issue      = {4},\n  journal    = {J. Theoretical Politics},\n  abstract   = {Consider an election of a given type (say a legislative or presidential\nelection) involving some set of districts for which we have data at two\ndistinct points in time, time 1 and time 2. If there are only two\npolitical parties, A and B, we may think of the overall difference in\nthe mean party vote share of party A between the two elections as the\naggregate inter-election swing between the two parties.  If we know this\nmean inter-election swing, the question we seek to answer is: &#x60;&#x60;How do\nwe expect the aggregate swing to be distributed across the districts or\nstates (or smaller units such as counties) as a function of previous\nvote share (and perhaps, other factors)?&#x27;&#x27;\n\nIn the electoral systems and political party literatures there have been\ntwo main answers to that question: uniform swing and  proportional\nswing. Our main theoretical contributions are (a) to provide an\naxiomatic foundation  for desirable properties of a model of\ninter-election changes in vote shares in a districted legislature; (b)\nto use those axioms to demonstrate why using uniform swing or\nproportional swing is a bad idea, (c) to provide a reasonably simple\nswing model that does satisfy the axioms, and (d) to show how to\nintegrate a reversion to the mean effect into models of inter-election\nswing.\n\nOur main empirical contributions address the question of why, despite\ntheir theoretical flaws, there is strong evidence that the two standard\nmodels, especially uniform swing, provide a very good fit to empirical\ndata.  We show that these models can be expected to work well when (a)\nelections are close, or (b) when we restrict ourselves to data where\nswing is low, or  (c) when we eliminate the cases where the model is\nmost likely to go wrong. In particular, sometimes the model tested is\nnot the standard model; in that either (c1) a piecewise or truncated\nvariant of the model is being used,  or (c2) there is a correction\n(usually 75\\%) for districts that are uncontested.  As we show\nempirically with data from U.S. congressional elections, either of these\ncorrections will at least marginally  improve fit on one or more of five\nindicators: mistakes about directionality of change, mistakes in winner,\nestimates that are outside the [0..1] bounds, mean-square error, and\ncorrelation between actual and predicted values. We also show that our\nnew model provides an equal or better fit to U.S. congressional data\nthan the traditional models, while having much nicer axiomatic\nproperties.},\n  keywords   = {electoral systems},\n  url_paper  = {https://markcwilson.site/Research/Outputs/GrWi2020.pdf},\n  url_slides = {https://www.youtube.com/watch?v=C0eIF1oAk-U},\n  year       = {2022},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Consider an election of a given type (say a legislative or presidential election) involving some set of districts for which we have data at two distinct points in time, time 1 and time 2. If there are only two political parties, A and B, we may think of the overall difference in the mean party vote share of party A between the two elections as the aggregate inter-election swing between the two parties. If we know this mean inter-election swing, the question we seek to answer is: ``How do we expect the aggregate swing to be distributed across the districts or states (or smaller units such as counties) as a function of previous vote share (and perhaps, other factors)?'' In the electoral systems and political party literatures there have been two main answers to that question: uniform swing and proportional swing. Our main theoretical contributions are (a) to provide an axiomatic foundation for desirable properties of a model of inter-election changes in vote shares in a districted legislature; (b) to use those axioms to demonstrate why using uniform swing or proportional swing is a bad idea, (c) to provide a reasonably simple swing model that does satisfy the axioms, and (d) to show how to integrate a reversion to the mean effect into models of inter-election swing. Our main empirical contributions address the question of why, despite their theoretical flaws, there is strong evidence that the two standard models, especially uniform swing, provide a very good fit to empirical data. We show that these models can be expected to work well when (a) elections are close, or (b) when we restrict ourselves to data where swing is low, or (c) when we eliminate the cases where the model is most likely to go wrong. In particular, sometimes the model tested is not the standard model; in that either (c1) a piecewise or truncated variant of the model is being used, or (c2) there is a correction (usually 75%) for districts that are uncontested. As we show empirically with data from U.S. congressional elections, either of these corrections will at least marginally improve fit on one or more of five indicators: mistakes about directionality of change, mistakes in winner, estimates that are outside the [0..1] bounds, mean-square error, and correlation between actual and predicted values. We also show that our new model provides an equal or better fit to U.S. congressional data than the traditional models, while having much nicer axiomatic properties.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"greenwood-melczer-ruza-wilson-asymptoticsofcoefficientsofalgebraicseriesviaembeddingintorationalseriesextendedabstract-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Greenwood, T.; Melczer, S.; Ruza, T.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.emis.de/journals/SLC/wpapers/FPSAC2022/30.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'greenwood-melczer-ruza-wilson-asymptoticsofcoefficientsofalgebraicseriesviaembeddingintorationalseriesextendedabstract-2022', 'https://www.emis.de/journals/SLC/wpapers/FPSAC2022/30.pdf', event);\">\n    Asymptotics of coefficients of algebraic series via embedding into rational series (extended abstract).\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Séminaire Lotharingien de Combinatoire</i>, 86B: 12pp.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.emis.de/journals/SLC/wpapers/FPSAC2022/30.pdf\"\n     onclick=\"log_download('greenwood-melczer-ruza-wilson-asymptoticsofcoefficientsofalgebraicseriesviaembeddingintorationalseriesextendedabstract-2022', 'https://www.emis.de/journals/SLC/wpapers/FPSAC2022/30.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Asymptotics of coefficients of algebraic series via embedding into rational series (extended abstract) [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('greenwood-melczer-ruza-wilson-asymptoticsofcoefficientsofalgebraicseriesviaembeddingintorationalseriesextendedabstract-2022', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Asymptotics of coefficients of algebraic series via embedding into rational series (extended abstract) [link]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/greenwood-melczer-ruza-wilson-asymptoticsofcoefficientsofalgebraicseriesviaembeddingintorationalseriesextendedabstract-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('greenwood-melczer-ruza-wilson-asymptoticsofcoefficientsofalgebraicseriesviaembeddingintorationalseriesextendedabstract-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{GMRW2022,\nauthor = {Greenwood, Torin and Melczer, Stephen and Ruza, Tiadora and Wilson, Mark C.},\njournal = {S\\&#x27;{e}minaire Lotharingien de Combinatoire},\nabstract = {We present a strategy for computing asymptotics of coefficients of\n$d$-variate algebraic generating functions. Using known constructions,\nwe embed the coefficient array into an array represented by a rational\ngenerating functions in $d+1$ variables, and then apply ACSV theory to\nanalyse the latter. This method allows us to give systematic results in\nthe multivariate case, seems more promising than trying to derive\nanalogs of the rational ACSV theory for algebraic GFs, and gives the\nprospect of further improvements as embedding methods are studied in\nmore detail.},\ntitle = {Asymptotics of coefficients of algebraic series via embedding into rational series (extended abstract)},\nyear = {2022},\npages = {12pp},\nvolume = {86B}, \nkeywords={ACSV applications, ACSV theory},\nurl_paper = {https://www.emis.de/journals/SLC/wpapers/FPSAC2022/30.pdf},\nurl_slides = {},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present a strategy for computing asymptotics of coefficients of $d$-variate algebraic generating functions. Using known constructions, we embed the coefficient array into an array represented by a rational generating functions in $d+1$ variables, and then apply ACSV theory to analyse the latter. This method allows us to give systematic results in the multivariate case, seems more promising than trying to derive analogs of the rational ACSV theory for algebraic GFs, and gives the prospect of further improvements as embedding methods are studied in more detail.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2021\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2021')\"\n      onkeypress=\"toggleGroup('group_2021')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2021</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"dipilla-wilson-newalgorithmsforschoolchoice-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  DiPilla, M.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://markcwilson.site/Research/Outputs/DiWi2021.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dipilla-wilson-newalgorithmsforschoolchoice-2021', 'https://markcwilson.site/Research/Outputs/DiWi2021.pdf', event);\">\n    New algorithms for school choice.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  ,8pp.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://markcwilson.site/Research/Outputs/DiWi2021.pdf\"\n     onclick=\"log_download('dipilla-wilson-newalgorithmsforschoolchoice-2021', 'https://markcwilson.site/Research/Outputs/DiWi2021.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"New algorithms for school choice [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('dipilla-wilson-newalgorithmsforschoolchoice-2021', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"New algorithms for school choice [link]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dipilla-wilson-newalgorithmsforschoolchoice-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>12 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dipilla-wilson-newalgorithmsforschoolchoice-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{DiWi2021,\n  author     = {DiPilla, Morgan and Wilson, Mark C.},\n  title      = {New algorithms for school choice},\n  pages      = {8pp},\n  journal    = {},\n  abstract   = {Algorithms for the school choice problem have been widely studied. A\nsmall number of algorithms for producing a solution dominate the\nliterature, for example Serial Dictatorship (SD) and the Deferred\nAcceptance (DA) algorithm. One main reason for the dominance of these\nalgorithms is their good (worst-case) axiomatic behaviour with respect\nto notions of Pareto efficiency, justified envy and manipulation.\nHowever if we shift the focus to fairness, social welfare, the\ninevitable tradeoffs between incompatible axioms, and average-case\nanalysis, it is far from clear that these algorithms are the last word.\n\nWe introduce a 6-parameter family of 40 inequivalent algorithms derived\nfrom DA, most of which have not appeared (to our knowledge) in the\nliterature before. The family includes SD and the naive and adaptive\nversions of the Boston mechanism, the most commonly used school choice\nalgorithm other than SD and DA. We investigate agent welfare, order bias\nand stability via numerical simulation, under the assumption of truthful\npreferences. We find that some of the new algorithms are worthy of much\nmore study. In particular, when we consider order bias, some of the new\nalgorithms clearly outperform the classic ones, while losing almost\nnothing in stability and utilitarian welfare.}, \n  keywords   = {social choice, assignment},\n  url_paper  = {https://markcwilson.site/Research/Outputs/DiWi2021.pdf},\n  url_slides = {},\n  year       = {2021},\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Algorithms for the school choice problem have been widely studied. A small number of algorithms for producing a solution dominate the literature, for example Serial Dictatorship (SD) and the Deferred Acceptance (DA) algorithm. One main reason for the dominance of these algorithms is their good (worst-case) axiomatic behaviour with respect to notions of Pareto efficiency, justified envy and manipulation. However if we shift the focus to fairness, social welfare, the inevitable tradeoffs between incompatible axioms, and average-case analysis, it is far from clear that these algorithms are the last word. We introduce a 6-parameter family of 40 inequivalent algorithms derived from DA, most of which have not appeared (to our knowledge) in the literature before. The family includes SD and the naive and adaptive versions of the Boston mechanism, the most commonly used school choice algorithm other than SD and DA. We investigate agent welfare, order bias and stability via numerical simulation, under the assumption of truthful preferences. We find that some of the new algorithms are worthy of much more study. In particular, when we consider order bias, some of the new algorithms clearly outperform the classic ones, while losing almost nothing in stability and utilitarian welfare.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-reassemblingscholarlycommunicationshistoriesinfrastructuresandglobalpoliticsofopenaccessbymartinpauleveandjonathangray-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.3138/jsp.52.3.05\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-reassemblingscholarlycommunicationshistoriesinfrastructuresandglobalpoliticsofopenaccessbymartinpauleveandjonathangray-2021', 'https://doi.org/10.3138/jsp.52.3.05', event);\">\n    Reassembling Scholarly Communications: Histories, Infrastructures, and Global Politics of Open Access by Martin Paul Eve and Jonathan Gray.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Journal of Scholarly Publishing</i>, 52(3): 190-192.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.3138/jsp.52.3.05\"\n     onclick=\"log_download('wilson-reassemblingscholarlycommunicationshistoriesinfrastructuresandglobalpoliticsofopenaccessbymartinpauleveandjonathangray-2021', 'https://doi.org/10.3138/jsp.52.3.05', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Reassembling Scholarly Communications: Histories, Infrastructures, and Global Politics of Open Access by Martin Paul Eve and Jonathan Gray [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.3138/jsp.52.3.05\"\n     onclick=\"log_download('wilson-reassemblingscholarlycommunicationshistoriesinfrastructuresandglobalpoliticsofopenaccessbymartinpauleveandjonathangray-2021', 'http://doi.org/10.3138/jsp.52.3.05', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-reassemblingscholarlycommunicationshistoriesinfrastructuresandglobalpoliticsofopenaccessbymartinpauleveandjonathangray-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-reassemblingscholarlycommunicationshistoriesinfrastructuresandglobalpoliticsofopenaccessbymartinpauleveandjonathangray-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Wils2021,\n  author  = {Wilson, Mark C.},\n  journal = {Journal of Scholarly Publishing},\n  title   = {Reassembling Scholarly Communications: Histories, Infrastructures, and Global Politics of Open Access by Martin Paul Eve and Jonathan Gray},\n  year    = {2021},\n  number  = {3},\n  pages   = {190-192},\n  volume  = {52},\n  keywords = {publication reform,scholarly communication},\n  doi     = {10.3138/jsp.52.3.05},\n  eprint  = {https://doi.org/10.3138/jsp.52.3.05},\n  url     = {https://doi.org/10.3138/jsp.52.3.05},\n}\n\n\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"freeman-pritchard-wilson-ordersymmetryanewfairnesscriterionforassignmentalgorithms-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Freeman, R.; Pritchard, G.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://osf.io/preprints/socarxiv/xt37c/\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'freeman-pritchard-wilson-ordersymmetryanewfairnesscriterionforassignmentalgorithms-2021', 'https://osf.io/preprints/socarxiv/xt37c/', event);\">\n    Order Symmetry: a new fairness criterion for assignment algorithms.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  ,44pp.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://osf.io/preprints/socarxiv/xt37c/\"\n     onclick=\"log_download('freeman-pritchard-wilson-ordersymmetryanewfairnesscriterionforassignmentalgorithms-2021', 'https://osf.io/preprints/socarxiv/xt37c/', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Order Symmetry: a new fairness criterion for assignment algorithms [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://www.youtube.com/watch?v=qdyEspDXa90&amp;list=PLKz9ISqcKAGCKccL_XdTCfo7WBRGMS21i&amp;index=5\"\n     onclick=\"log_download('freeman-pritchard-wilson-ordersymmetryanewfairnesscriterionforassignmentalgorithms-2021', 'https://www.youtube.com/watch?v=qdyEspDXa90&amp;list=PLKz9ISqcKAGCKccL_XdTCfo7WBRGMS21i&amp;index=5', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Order Symmetry: a new fairness criterion for assignment algorithms [link]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/freeman-pritchard-wilson-ordersymmetryanewfairnesscriterionforassignmentalgorithms-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>14 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('freeman-pritchard-wilson-ordersymmetryanewfairnesscriterionforassignmentalgorithms-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{FrPW2021,\n  author  = {Freeman, Rupert and Pritchard, Geoffrey and Wilson, Mark C.},\n  journal = {},\n  abstract  = {We introduce a new fairness criterion, order symmetry, for\nassignment mechanisms that match $n$ objects to $n$ agents with ordinal\npreferences over the objects. An assignment mechanism is order symmetric\nwith respect to some probability measure over preference profiles if\nevery agent is equally likely to receive their favorite object, every\nagent is equally likely to receive their second favorite, and so on.\nWhen associated with a sufficiently symmetric probability measure, order\nsymmetry is a relaxation of anonymity that, crucially, can be satisfied\nby discrete assignment mechanisms. Furthermore, it can be achieved\nwithout sacrificing other desirable axiomatic properties satisfied by\nexisting mechanisms. In particular, we show that it can be achieved in\nconjunction with strategyproofness and ex post efficiency via the top\ntrading cycles mechanism (but not serial dictatorship). We additionally\ndesign a novel mechanism that is both order symmetric and ordinally\nefficient. The practical utility of order symmetry is substantiated by\nsimulations on Impartial Culture and Mallows-distributed preferences for \nfour common assignment mechanisms.},\n  title   = {Order Symmetry: a new fairness criterion for assignment algorithms},\n  year    = {2021},\n  number  = {},\n  pages   = {44pp},\n  volume  = {},\n  doi     = {},\n  keywords = {social choice,assignment},\n  url_paper = {https://osf.io/preprints/socarxiv/xt37c/},\n  url_slides = {https://www.youtube.com/watch?v=qdyEspDXa90&amp;list=PLKz9ISqcKAGCKccL_XdTCfo7WBRGMS21i&amp;index=5},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We introduce a new fairness criterion, order symmetry, for assignment mechanisms that match $n$ objects to $n$ agents with ordinal preferences over the objects. An assignment mechanism is order symmetric with respect to some probability measure over preference profiles if every agent is equally likely to receive their favorite object, every agent is equally likely to receive their second favorite, and so on. When associated with a sufficiently symmetric probability measure, order symmetry is a relaxation of anonymity that, crucially, can be satisfied by discrete assignment mechanisms. Furthermore, it can be achieved without sacrificing other desirable axiomatic properties satisfied by existing mechanisms. In particular, we show that it can be achieved in conjunction with strategyproofness and ex post efficiency via the top trading cycles mechanism (but not serial dictatorship). We additionally design a novel mechanism that is both order symmetric and ordinally efficient. The practical utility of order symmetry is substantiated by simulations on Impartial Culture and Mallows-distributed preferences for four common assignment mechanisms.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"ramgoolam-wilson-zahabi-quiverasymptoticsfreechiralring-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Ramgoolam, S.; <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C</a>;  and Zahabi, A.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://iopscience.iop.org/article/10.1088/1751-8121/ab6fc6/pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'ramgoolam-wilson-zahabi-quiverasymptoticsfreechiralring-2020', 'https://iopscience.iop.org/article/10.1088/1751-8121/ab6fc6/pdf', event);\">\n    Quiver asymptotics: free chiral ring.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Journal of Physics A: Mathematical and Theoretical</i>, 53(10): 105401.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://iopscience.iop.org/article/10.1088/1751-8121/ab6fc6/pdf\"\n     onclick=\"log_download('ramgoolam-wilson-zahabi-quiverasymptoticsfreechiralring-2020', 'https://iopscience.iop.org/article/10.1088/1751-8121/ab6fc6/pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Quiver asymptotics: free chiral ring [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ramgoolam-wilson-zahabi-quiverasymptoticsfreechiralring-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ramgoolam-wilson-zahabi-quiverasymptoticsfreechiralring-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ramgoolam2020quiver,\n  title={Quiver asymptotics: free chiral ring},\n  author={Ramgoolam, Sanjaye and Wilson, Mark C and Zahabi, Ali},\n  journal={Journal of Physics A: Mathematical and Theoretical},\n  volume={53},\n  number={10},\n  pages={105401},\n  year={2020},\n  publisher={IOP Publishing},\n  keywords={ACSV applications},\n  url_Paper={https://iopscience.iop.org/article/10.1088/1751-8121/ab6fc6/pdf},\n  abstract={The large N generating functions for the counting of chiral operators in\n$\\mathcal{N} = 1$, four-dimensional quiver gauge theories have\npreviously been obtained in terms of the weighted adjacency matrix of\nthe quiver diagram. We introduce the methods of multi-variate asymptotic\nanalysis to study this counting in the limit of large charges. We\ndescribe a Hagedorn phase transition associated with this asymptotics,\nwhich refines and generalizes known results on the 2-matrix harmonic\noscillator. Explicit results are obtained for two infinite classes of\nquiver theories, namely the generalized clover quivers and affine\n$\\mathbb{C}^3 \\setminus \\hat{A}_n$ orbifold quivers.}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The large N generating functions for the counting of chiral operators in $\\mathcal{N} = 1$, four-dimensional quiver gauge theories have previously been obtained in terms of the weighted adjacency matrix of the quiver diagram. We introduce the methods of multi-variate asymptotic analysis to study this counting in the limit of large charges. We describe a Hagedorn phase transition associated with this asymptotics, which refines and generalizes known results on the 2-matrix harmonic oscillator. Explicit results are obtained for two infinite classes of quiver theories, namely the generalized clover quivers and affine $ℂ^3 ∖ Â_n$ orbifold quivers.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"aref-mason-wilson-amodelingandcomputationalstudyofthefrustrationindexinsignednetworks-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Aref, S.; Mason, A. J;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/1611.09030\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'aref-mason-wilson-amodelingandcomputationalstudyofthefrustrationindexinsignednetworks-2020', 'https://arxiv.org/abs/1611.09030', event);\">\n    A modeling and computational study of the frustration index in signed networks.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Networks</i>, 75(1): 95-110.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/1611.09030\"\n     onclick=\"log_download('aref-mason-wilson-amodelingandcomputationalstudyofthefrustrationindexinsignednetworks-2020', 'https://arxiv.org/abs/1611.09030', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A modeling and computational study of the frustration index in signed networks [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/aref-mason-wilson-amodelingandcomputationalstudyofthefrustrationindexinsignednetworks-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('aref-mason-wilson-amodelingandcomputationalstudyofthefrustrationindexinsignednetworks-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{aref2020modeling,\n  author    = {Aref, Samin and Mason, Andrew J and Wilson, Mark C.},\n  title     = {A modeling and computational study of the frustration index in signed networks},\n  number    = {1},\n  pages     = {95-110},\n  volume    = {75},\n  abstract  = {Computing the frustration index of a signed graph is a key step toward\nsolving problems in many fields including social networks, political\nscience, physics, chemistry, and biology. The frustration index\ndetermines the distance of a network from a state of total structural\nbalance. Although the definition of the frustration index goes back to\nthe 1950&#x27;s, its exact algorithmic computation, which is closely related\nto classic NP-hard graph problems, has only become a focus in recent\nyears. We develop three new binary linear programming models to compute\nthe frustration index exactly and efficiently as the solution to a\nglobal optimisation problem. Solving the models with prioritised\nbranching and valid inequalities in Gurobi, we can compute the\nfrustration index of real signed networks with over 15000 edges in less\nthan a minute on inexpensive hardware. We provide extensive performance\nanalysis for both random and real signed networks and show that our\nmodels outperform all existing approaches by large factors. Based on\nsolve time, algorithm output, and effective branching factor we\nhighlight the superiority of our models to both exact and heuristic\nmethods in the literature.},\n  journal   = {Networks},\n  keywords  = {network science, computation, graphs},\n  publisher = {Wiley},\n  url_paper = {https://arxiv.org/abs/1611.09030},\n  year      = {2020},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Computing the frustration index of a signed graph is a key step toward solving problems in many fields including social networks, political science, physics, chemistry, and biology. The frustration index determines the distance of a network from a state of total structural balance. Although the definition of the frustration index goes back to the 1950's, its exact algorithmic computation, which is closely related to classic NP-hard graph problems, has only become a focus in recent years. We develop three new binary linear programming models to compute the frustration index exactly and efficiently as the solution to a global optimisation problem. Solving the models with prioritised branching and valid inequalities in Gurobi, we can compute the frustration index of real signed networks with over 15000 edges in less than a minute on inexpensive hardware. We provide extensive performance analysis for both random and real signed networks and show that our models outperform all existing approaches by large factors. Based on solve time, algorithm output, and effective branching factor we highlight the superiority of our models to both exact and heuristic methods in the literature.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sakhaee-wilson-informationextractionframeworktobuildlegislationnetwork-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Sakhaee, N.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://link.springer.com/content/pdf/10.1007/s10506-020-09263-3.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'sakhaee-wilson-informationextractionframeworktobuildlegislationnetwork-2020', 'https://link.springer.com/content/pdf/10.1007/s10506-020-09263-3.pdf', event);\">\n    Information extraction framework to build legislation network.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Artificial Intelligence and Law</i>,1-24.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://link.springer.com/content/pdf/10.1007/s10506-020-09263-3.pdf\"\n     onclick=\"log_download('sakhaee-wilson-informationextractionframeworktobuildlegislationnetwork-2020', 'https://link.springer.com/content/pdf/10.1007/s10506-020-09263-3.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Information extraction framework to build legislation network [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sakhaee-wilson-informationextractionframeworktobuildlegislationnetwork-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sakhaee-wilson-informationextractionframeworktobuildlegislationnetwork-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{sakhaee2020information,\n  title={Information extraction framework to build legislation network},\n  author={Sakhaee, Neda and Wilson, Mark C.},\n  journal={Artificial Intelligence and Law},\n  pages={1-24},\n  year={2020},\n  publisher={Springer Netherlands},\n  keywords={network science},\n  url_Paper={https://link.springer.com/content/pdf/10.1007/s10506-020-09263-3.pdf},\n  abstract={This paper concerns an Information Extraction process for building a\ndynamic Legislation Network from legal documents. Unlike supervised\nlearning approaches which require additional calculations, the idea here\nis to apply Information Extraction methodologies by identifying distinct\nexpressions in legal text and extract quality network information. The\nstudy highlights the importance of data accuracy in network analysis and\nimproves approximate string matching techniques for producing reliable\nnetwork datasets with more than 98 percent precision and recall. The\nvalues, applications, and the complexity of the created dynamic\nLegislation Network are also discussed and challenged.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper concerns an Information Extraction process for building a dynamic Legislation Network from legal documents. Unlike supervised learning approaches which require additional calculations, the idea here is to apply Information Extraction methodologies by identifying distinct expressions in legal text and extract quality network information. The study highlights the importance of data accuracy in network analysis and improves approximate string matching techniques for producing reliable network datasets with more than 98 percent precision and recall. The values, applications, and the complexity of the created dynamic Legislation Network are also discussed and challenged.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-tang-noncumulativemeasuresofresearchercitationimpact-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>;  and Tang, Z.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.mitpressjournals.org/doi/pdf/10.1162/qss_a_00074\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-tang-noncumulativemeasuresofresearchercitationimpact-2020', 'https://www.mitpressjournals.org/doi/pdf/10.1162/qss_a_00074', event);\">\n    Non-cumulative measures of researcher citation impact.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Quantitative Science Studies</i>,11pp.  2020.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.mitpressjournals.org/doi/pdf/10.1162/qss_a_00074\"\n     onclick=\"log_download('wilson-tang-noncumulativemeasuresofresearchercitationimpact-2020', 'https://www.mitpressjournals.org/doi/pdf/10.1162/qss_a_00074', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Non-cumulative measures of researcher citation impact [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://www.youtube.com/watch?v=6bmh-u9biUc\"\n     onclick=\"log_download('wilson-tang-noncumulativemeasuresofresearchercitationimpact-2020', 'https://www.youtube.com/watch?v=6bmh-u9biUc', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Non-cumulative measures of researcher citation impact [link]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-tang-noncumulativemeasuresofresearchercitationimpact-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-tang-noncumulativemeasuresofresearchercitationimpact-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{WiZh2020,\n  title={Non-cumulative measures of researcher citation impact},\n  author={Wilson, Mark C. and Tang, Zhou},\n  journal={Quantitative Science Studies},\n  volume={},\n  number={},\n  pages={11pp},\n  year={2020},\n  publisher={},\n  keywords={scientometrics},\n  url_Paper={https://www.mitpressjournals.org/doi/pdf/10.1162/qss_a_00074},\n  url_Slides={https://www.youtube.com/watch?v=6bmh-u9biUc},\n  abstract={The most commonly used publication metrics for individual researchers\nare the the total number of publications, the total number of citations,\nand Hirsch’s $h$-index. Each of these is cumulative, and hence increases\nthroughout a researcher’s career, making it less suitable for evaluation\nof junior researchers or assessing recent impact. Most other\nauthor-level measures in the literature share this cumulative property.\nBy contrast, we aim to study non-cumulative measures that answer the\nquestion “in terms of citation impact, what have you done lately?” We\nsingle out six measures from the rather sparse literature, including\nHirsch’s $m$-index, a time-scaled version of the $h$-index. We introduce\nnew measures based on the idea of “citation acceleration”. After\npresenting several axioms for non-cumulative measures, we conclude that\none of our new measures has much better theoretical justification. We\npresent a small-scale study of its performance on real data and conclude\nthat it shows substantial promise for future use.}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The most commonly used publication metrics for individual researchers are the the total number of publications, the total number of citations, and Hirsch’s $h$-index. Each of these is cumulative, and hence increases throughout a researcher’s career, making it less suitable for evaluation of junior researchers or assessing recent impact. Most other author-level measures in the literature share this cumulative property. By contrast, we aim to study non-cumulative measures that answer the question “in terms of citation impact, what have you done lately?” We single out six measures from the rather sparse literature, including Hirsch’s $m$-index, a time-scaled version of the $h$-index. We introduce new measures based on the idea of “citation acceleration”. After presenting several axioms for non-cumulative measures, we conclude that one of our new measures has much better theoretical justification. We present a small-scale study of its performance on real data and conclude that it shows substantial promise for future use.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2019\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2019')\"\n      onkeypress=\"toggleGroup('group_2019')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2019</span>\n      <span class=\"bibbase_group_count\">\n        \n        (6)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"wilson-researchpublishingforthenonexpert-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://markcwilson.site/Research/Outputs/oa_dummies.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-researchpublishingforthenonexpert-2019', 'https://markcwilson.site/Research/Outputs/oa_dummies.pdf', event);\">\n    Research publishing for the nonexpert.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>New Zealand Mathematical Society Newsletter</i>, 137: 14-18.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://markcwilson.site/Research/Outputs/oa_dummies.pdf\"\n     onclick=\"log_download('wilson-researchpublishingforthenonexpert-2019', 'https://markcwilson.site/Research/Outputs/oa_dummies.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Research publishing for the nonexpert [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-researchpublishingforthenonexpert-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>5 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-researchpublishingforthenonexpert-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson2019dummies,\n  title={Research publishing for the nonexpert},\n  author={Wilson, Mark C.},\n  journal={New Zealand Mathematical Society Newsletter},\n  year={2019},\n  volume={137},\n  pages={14-18},\n  publisher={},\n    keywords={publication reform, advocacy},\n  url_Paper={https://markcwilson.site/Research/Outputs/oa_dummies.pdf},\n  abstract={}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-inputsalgorithmsqualitymeasuresmorerealisticsimulationinsocialchoice-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://markcwilson.site/Research/Outputs/FED.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-inputsalgorithmsqualitymeasuresmorerealisticsimulationinsocialchoice-2019', 'https://markcwilson.site/Research/Outputs/FED.pdf', event);\">\n    Inputs, Algorithms, Quality Measures: More Realistic Simulation in Social Choice.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>The Future of Economic Design</i>, pages 165-171. Springer, Cham,  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://markcwilson.site/Research/Outputs/FED.pdf\"\n     onclick=\"log_download('wilson-inputsalgorithmsqualitymeasuresmorerealisticsimulationinsocialchoice-2019', 'https://markcwilson.site/Research/Outputs/FED.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Inputs, Algorithms, Quality Measures: More Realistic Simulation in Social Choice [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-inputsalgorithmsqualitymeasuresmorerealisticsimulationinsocialchoice-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-inputsalgorithmsqualitymeasuresmorerealisticsimulationinsocialchoice-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{wilson2019inputs,\n  title={Inputs, Algorithms, Quality Measures: More Realistic Simulation in Social Choice},\n  author={Wilson, Mark C.},\n  booktitle={The Future of Economic Design},\n  pages={165-171},\n  year={2019},\n  publisher={Springer, Cham},\n  keywords={social choice, simulation},\n  url_Paper={https://markcwilson.site/Research/Outputs/FED.pdf},\n  abstract={Much of my research deals with trying to evaluate the performance of\nsocial choice \\emph{algorithms} via simulations, which requires\nappropriate \\emph{inputs} and \\emph{quality measures}. All three areas\noffer substantial scope for improvement in the coming years. For\nconcreteness and because of my own limited experience, I focus on the\nallocation of indivisible goods and on voting, although many of the\nideas are more broadly applicable.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Much of my research deals with trying to evaluate the performance of social choice \\emphalgorithms via simulations, which requires appropriate \\emphinputs and \\emphquality measures. All three areas offer substantial scope for improvement in the coming years. For concreteness and because of my own limited experience, I focus on the allocation of indivisible goods and on voting, although many of the ideas are more broadly applicable.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"aref-wilson-balanceandfrustrationinsignednetworks-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Aref, S.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://academic.oup.com/comnet/article-abstract/7/2/163/5074195\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'aref-wilson-balanceandfrustrationinsignednetworks-2019', 'https://academic.oup.com/comnet/article-abstract/7/2/163/5074195', event);\">\n    Balance and frustration in signed networks.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Journal of Complex Networks</i>, 7(2): 163-189.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://academic.oup.com/comnet/article-abstract/7/2/163/5074195\"\n     onclick=\"log_download('aref-wilson-balanceandfrustrationinsignednetworks-2019', 'https://academic.oup.com/comnet/article-abstract/7/2/163/5074195', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Balance and frustration in signed networks [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/aref-wilson-balanceandfrustrationinsignednetworks-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('aref-wilson-balanceandfrustrationinsignednetworks-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{aref2019balance,\n  title={Balance and frustration in signed networks},\n  author={Aref, Samin and Wilson, Mark C.},\n  journal={Journal of Complex Networks},\n  volume={7},\n  number={2},\n  pages={163-189},\n  year={2019},\n  publisher={Oxford University Press},\n  keywords={network science, graphs},\n  url_Paper= {https://academic.oup.com/comnet/article-abstract/7/2/163/5074195},\n  abstract={The frustration index is a key measure for analysing signed networks,\nwhich has been underused due to its computational complexity. We use an\nexact optimisation-based method to analyse frustration as a global\nstructural property of signed networks coming from diverse application\nareas. In the classic friend-enemy interpretation of balance theory, a\nby-product of computing the frustration index is the partitioning of\nnodes into two internally solidary but mutually hostile groups. The main\npurpose of this paper is to present general methodology for answering\nquestions related to partial balance in signed networks, and apply it to\na range of representative examples that are now analysable because of\nadvances in computational methods. We provide exact numerical results on\nsocial and biological signed networks, networks of formal alliances and\nantagonisms between countries, and financial portfolio networks.\nMolecular graphs of carbon and Ising models are also considered. We\npoint out several mistakes in the signed networks literature caused by\ninaccurate computation, implementation errors or inappropriate\nmeasures.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The frustration index is a key measure for analysing signed networks, which has been underused due to its computational complexity. We use an exact optimisation-based method to analyse frustration as a global structural property of signed networks coming from diverse application areas. In the classic friend-enemy interpretation of balance theory, a by-product of computing the frustration index is the partitioning of nodes into two internally solidary but mutually hostile groups. The main purpose of this paper is to present general methodology for answering questions related to partial balance in signed networks, and apply it to a range of representative examples that are now analysable because of advances in computational methods. We provide exact numerical results on social and biological signed networks, networks of formal alliances and antagonisms between countries, and financial portfolio networks. Molecular graphs of carbon and Ising models are also considered. We point out several mistakes in the signed networks literature caused by inaccurate computation, implementation errors or inappropriate measures.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"melczer-wilson-higherdimensionallatticewalksconnectingcombinatorialandanalyticbehavior-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Melczer, S.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/1810.06170\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'melczer-wilson-higherdimensionallatticewalksconnectingcombinatorialandanalyticbehavior-2019', 'https://arxiv.org/abs/1810.06170', event);\">\n    Higher dimensional lattice walks: Connecting combinatorial and analytic behavior.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>SIAM Journal on Discrete Mathematics</i>, 33(4): 2140-2174.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/1810.06170\"\n     onclick=\"log_download('melczer-wilson-higherdimensionallatticewalksconnectingcombinatorialandanalyticbehavior-2019', 'https://arxiv.org/abs/1810.06170', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Higher dimensional lattice walks: Connecting combinatorial and analytic behavior [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://www.youtube.com/watch?v=o5SOHJbGO4g\"\n     onclick=\"log_download('melczer-wilson-higherdimensionallatticewalksconnectingcombinatorialandanalyticbehavior-2019', 'https://www.youtube.com/watch?v=o5SOHJbGO4g', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Higher dimensional lattice walks: Connecting combinatorial and analytic behavior [link]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/melczer-wilson-higherdimensionallatticewalksconnectingcombinatorialandanalyticbehavior-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('melczer-wilson-higherdimensionallatticewalksconnectingcombinatorialandanalyticbehavior-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{melczer2019higher,\n  author     = {Melczer, Stephen and Wilson, Mark C.},\n  title      = {Higher dimensional lattice walks: Connecting combinatorial and analytic behavior},\n  number     = {4},\n  pages      = {2140-2174},\n  volume     = {33},\n  abstract   = {We consider the enumeration of walks on the non-negative lattice\n$\\mathbb{N}^d$, with steps defined by a set $\\mathcal{S} \\subset \\{ -1,\n0, 1 \\}^d \\setminus \\{\\mathbf{0}\\}$. Previous work in this area has\nestablished asymptotics for the number of walks in certain families of\nmodels by applying the techniques of analytic combinatorics in several\nvariables (ACSV), where one encodes the generating function of a lattice\npath model as the diagonal of a multivariate rational function. Melczer\nand Mishna obtained asymptotics when the set of steps $\\mathcal{S}$ is\nsymmetric over every axis; in this setting one can always apply the\nmethods of ACSV to a multivariate rational function whose  set of\nsingularities is a smooth manifold (the simplest case). Here we go\nfurther, providing asymptotics for models with generating functions that\nmust be encoded by multivariate rational functions having non-smooth\nsingular sets.  In the process, our analysis connects past work to\ndeeper structural results in the theory of analytic combinatorics in\nseveral variables.  One application is a closed form for asymptotics of\nmodels defined by step sets that are symmetric over all but one axis. As\na special case, we apply our results when $d=2$ to give a rigorous proof\nof asymptotics conjectured by Bostan and Kauers; asymptotics for walks\nreturning to boundary axes and the origin are also given.},\n  journal    = {SIAM Journal on Discrete Mathematics},\n  keywords   = {ACSV applications},\n  publisher  = {Society for Industrial and Applied Mathematics},\n  url_paper  = {https://arxiv.org/abs/1810.06170},\n  url_slides = {https://www.youtube.com/watch?v=o5SOHJbGO4g},\n  year       = {2019},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the enumeration of walks on the non-negative lattice $ℕ^d$, with steps defined by a set $\\mathcal{S} ⊂ \\{ -1, 0, 1 \\}^d ∖ \\{\\mathbf{0}\\}$. Previous work in this area has established asymptotics for the number of walks in certain families of models by applying the techniques of analytic combinatorics in several variables (ACSV), where one encodes the generating function of a lattice path model as the diagonal of a multivariate rational function. Melczer and Mishna obtained asymptotics when the set of steps $\\mathcal{S}$ is symmetric over every axis; in this setting one can always apply the methods of ACSV to a multivariate rational function whose set of singularities is a smooth manifold (the simplest case). Here we go further, providing asymptotics for models with generating functions that must be encoded by multivariate rational functions having non-smooth singular sets. In the process, our analysis connects past work to deeper structural results in the theory of analytic combinatorics in several variables. One application is a closed form for asymptotics of models defined by step sets that are symmetric over all but one axis. As a special case, we apply our results when $d=2$ to give a rigorous proof of asymptotics conjectured by Bostan and Kauers; asymptotics for walks returning to boundary axes and the origin are also given.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"ianovski-wilson-manipulabilityofconsularelectionrules-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Ianovski, E.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/1611.07102\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'ianovski-wilson-manipulabilityofconsularelectionrules-2019', 'https://arxiv.org/abs/1611.07102', event);\">\n    Manipulability of consular election rules.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Social Choice and Welfare</i>, 52(2): 363-393.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/1611.07102\"\n     onclick=\"log_download('ianovski-wilson-manipulabilityofconsularelectionrules-2019', 'https://arxiv.org/abs/1611.07102', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Manipulability of consular election rules [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://link.springer.com/article/10.1007/s00355-018-1152-2\"\n     onclick=\"log_download('ianovski-wilson-manipulabilityofconsularelectionrules-2019', 'https://link.springer.com/article/10.1007/s00355-018-1152-2', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Manipulability of consular election rules [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ianovski-wilson-manipulabilityofconsularelectionrules-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ianovski-wilson-manipulabilityofconsularelectionrules-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ianovski2019manipulability,\n  title={Manipulability of consular election rules},\n  author={Ianovski, Egor and Wilson, Mark C.},\n  journal={Social Choice and Welfare},\n  volume={52},\n  number={2},\n  pages={363-393},\n  year={2019},\n  publisher={Springer Berlin Heidelberg},\n  keywords={social choice, voting},\n  url_Paper={https://arxiv.org/abs/1611.07102},\n  url_Link={https://link.springer.com/article/10.1007/s00355-018-1152-2},\n  abstract={The Gibbard-Satterthwaite theorem is a cornerstone of social choice\ntheory, stating that an onto social choice function cannot be both\nstrategy-proof and non-dictatorial if the number of alternatives is at\nleast three. The Duggan-Schwartz theorem proves an analogue in the case\nof set-valued elections: if the function is onto with respect to\nsingletons, and can be manipulated by neither an optimist nor a\npessimist, it must have a weak dictator. However, the assumption that\nthe function is onto with respect to singletons makes the\nDuggan-Schwartz theorem inapplicable to elections which necessarily\nselect a committee with multiple members. In this paper we make a start\non this problem by considering elections which elect a committee of size\ntwo (such as the consulship of ancient Rome). We establish that if such\na \\emph{consular election rule} cannot be expressed as the union of two\ndisjoint social choice functions, then strategy-proofness implies the\nexistence of a dictator. Although we suspect that a similar result holds\nfor larger sized committees, there appear to be many obstacles to\nproving it, which we discuss in detail.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The Gibbard-Satterthwaite theorem is a cornerstone of social choice theory, stating that an onto social choice function cannot be both strategy-proof and non-dictatorial if the number of alternatives is at least three. The Duggan-Schwartz theorem proves an analogue in the case of set-valued elections: if the function is onto with respect to singletons, and can be manipulated by neither an optimist nor a pessimist, it must have a weak dictator. However, the assumption that the function is onto with respect to singletons makes the Duggan-Schwartz theorem inapplicable to elections which necessarily select a committee with multiple members. In this paper we make a start on this problem by considering elections which elect a committee of size two (such as the consulship of ancient Rome). We establish that if such a \\emphconsular election rule cannot be expressed as the union of two disjoint social choice functions, then strategy-proofness implies the existence of a dictator. Although we suspect that a similar result holds for larger sized committees, there appear to be many obstacles to proving it, which we discuss in detail.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hadjibeyli-wilson-distancerationalizationofanonymousandhomogeneousvotingrules-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Hadjibeyli, B.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://link.springer.com/content/pdf/10.1007/s00355-018-1156-y.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hadjibeyli-wilson-distancerationalizationofanonymousandhomogeneousvotingrules-2019', 'https://link.springer.com/content/pdf/10.1007/s00355-018-1156-y.pdf', event);\">\n    Distance rationalization of anonymous and homogeneous voting rules.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Social Choice and Welfare</i>, 52(3): 559-583.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://link.springer.com/content/pdf/10.1007/s00355-018-1156-y.pdf\"\n     onclick=\"log_download('hadjibeyli-wilson-distancerationalizationofanonymousandhomogeneousvotingrules-2019', 'https://link.springer.com/content/pdf/10.1007/s00355-018-1156-y.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Distance rationalization of anonymous and homogeneous voting rules [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hadjibeyli-wilson-distancerationalizationofanonymousandhomogeneousvotingrules-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hadjibeyli-wilson-distancerationalizationofanonymousandhomogeneousvotingrules-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{hadjibeyli2019distance,\n  title={Distance rationalization of anonymous and homogeneous voting rules},\n  author={Hadjibeyli, Benjamin and Wilson, Mark C.},\n  journal={Social Choice and Welfare},\n  volume={52},\n  number={3},\n  pages={559-583},\n  year={2019},\n  publisher={Springer Berlin Heidelberg},\n  keywords={social choice, voting},\n  url_Paper={https://link.springer.com/content/pdf/10.1007/s00355-018-1156-y.pdf},\n  abstract={The concept of distance rationalizability of voting rules has been\nexplored in recent years by several authors. Most previous work has\ndealt with a definition in terms of preference profiles. However, most\nvoting rules in common use are anonymous and homogeneous. In this case\nthere is a much more succinct representation (using the voting simplex)\nof the inputs to the rule. This representation has been widely used in\nthe voting literature, but rarely in the context of distance\nrationalizability. Recently, the present authors showed, as a special\ncase of general results on quotient spaces, exactly how to connect\ndistance rationalizability on profiles for anonymous and homogeneous\nrules to geometry in the simplex. In this article we develop the\nconnection for the important special case of votewise distances,\nrecently introduced and studied by Elkind, Faliszewski and Slinko in\nseveral papers. This yields a direct interpretation in terms of\nwell-developed mathematical topics not seen before in the voting\nliterature, namely Kantorovich (also called Wasserstein) distances and\nthe geometry of Minkowski spaces. As an application of this approach, we\nprove some positive and some negative results about the decisiveness of\ndistance rationalizable anonymous and homogeneous rules. The positive\nresults connect with the recent theory of hyperplane rules, while the\nnegative ones deal with distances that are not metrics, controversial\nnotions of consensus, and the fact that the $\\ell^1$-norm is not\nstrictly convex. We expect that the above novel geometric interpretation\nwill aid the analysis of rules defined by votewise distances, and the\ndiscovery of new rules with desirable properties.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The concept of distance rationalizability of voting rules has been explored in recent years by several authors. Most previous work has dealt with a definition in terms of preference profiles. However, most voting rules in common use are anonymous and homogeneous. In this case there is a much more succinct representation (using the voting simplex) of the inputs to the rule. This representation has been widely used in the voting literature, but rarely in the context of distance rationalizability. Recently, the present authors showed, as a special case of general results on quotient spaces, exactly how to connect distance rationalizability on profiles for anonymous and homogeneous rules to geometry in the simplex. In this article we develop the connection for the important special case of votewise distances, recently introduced and studied by Elkind, Faliszewski and Slinko in several papers. This yields a direct interpretation in terms of well-developed mathematical topics not seen before in the voting literature, namely Kantorovich (also called Wasserstein) distances and the geometry of Minkowski spaces. As an application of this approach, we prove some positive and some negative results about the decisiveness of distance rationalizable anonymous and homogeneous rules. The positive results connect with the recent theory of hyperplane rules, while the negative ones deal with distances that are not metrics, controversial notions of consensus, and the fact that the $\\ell^1$-norm is not strictly convex. We expect that the above novel geometric interpretation will aid the analysis of rules defined by votewise distances, and the discovery of new rules with desirable properties.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2018\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2018')\"\n      onkeypress=\"toggleGroup('group_2018')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2018</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"wilson-freeandfairopenaccessjournalsflippingfosteringfounding-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.ams.org/journals/notices/201807/rnoti-p817.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-freeandfairopenaccessjournalsflippingfosteringfounding-2018', 'https://www.ams.org/journals/notices/201807/rnoti-p817.pdf', event);\">\n    Free and fair open access journals: Flipping, fostering, founding.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Notices of the American Mathematical Society</i>, 65: 817-820.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.ams.org/journals/notices/201807/rnoti-p817.pdf\"\n     onclick=\"log_download('wilson-freeandfairopenaccessjournalsflippingfosteringfounding-2018', 'https://www.ams.org/journals/notices/201807/rnoti-p817.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Free and fair open access journals: Flipping, fostering, founding [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-freeandfairopenaccessjournalsflippingfosteringfounding-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>4 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-freeandfairopenaccessjournalsflippingfosteringfounding-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson2018free,\n  title={Free and fair open access journals: Flipping, fostering, founding},\n  author={Wilson, Mark C.},\n  journal={Notices of the American Mathematical Society},\n  volume={65},\n  pages={817-820},\n  year={2018},\n    keywords={publication reform, advocacy},\n  url_Paper={https://www.ams.org/journals/notices/201807/rnoti-p817.pdf},\n  abstract={}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-vanmaldeghem-reiner-athanasiadis-munemasa-thomas-flippingjaco-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>; van Maldeghem, H.; Reiner, V.; Athanasiadis, C.; Munemasa, A.;  and Thomas, H.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488x&amp;vol=9&amp;iss=109&amp;rank=9\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-vanmaldeghem-reiner-athanasiadis-munemasa-thomas-flippingjaco-2018', 'http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488x&amp;vol=9&amp;iss=109&amp;rank=9', event);\">\n    Flipping JACO.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>European Mathematical Society Newsletter</i>, 9(109): 38-41.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488x&amp;vol=9&amp;iss=109&amp;rank=9\"\n     onclick=\"log_download('wilson-vanmaldeghem-reiner-athanasiadis-munemasa-thomas-flippingjaco-2018', 'http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488x&amp;vol=9&amp;iss=109&amp;rank=9', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Flipping JACO [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-vanmaldeghem-reiner-athanasiadis-munemasa-thomas-flippingjaco-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-vanmaldeghem-reiner-athanasiadis-munemasa-thomas-flippingjaco-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson2018flipping,\n  title={Flipping JACO},\n  author={Wilson, Mark C. and van Maldeghem, Hendrik and Reiner, Victor and Athanasiadis, Christos and Munemasa, Akihiro and Thomas, Hugh},\n  journal={European Mathematical Society Newsletter},\n  volume={9},\n  number={109},\n  pages={38-41},\n  year={2018},\n  keywords={publication reform},\n  url_Paper={http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488x&amp;vol=9&amp;iss=109&amp;rank=9},\n  abstract={}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"aref-mason-wilson-computingthelineindexofbalanceusingintegerprogrammingoptimisation-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Aref, S.; Mason, A. J;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/1710.09876\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'aref-mason-wilson-computingthelineindexofbalanceusingintegerprogrammingoptimisation-2018', 'https://arxiv.org/abs/1710.09876', event);\">\n    Computing the line index of balance using integer programming optimisation.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Optimization Problems in Graph Theory</i>, pages 65-84. Springer, Cham,  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/1710.09876\"\n     onclick=\"log_download('aref-mason-wilson-computingthelineindexofbalanceusingintegerprogrammingoptimisation-2018', 'https://arxiv.org/abs/1710.09876', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Computing the line index of balance using integer programming optimisation [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/aref-mason-wilson-computingthelineindexofbalanceusingintegerprogrammingoptimisation-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('aref-mason-wilson-computingthelineindexofbalanceusingintegerprogrammingoptimisation-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection{aref2018computing,\n  title={Computing the line index of balance using integer programming optimisation},\n  author={Aref, Samin and Mason, Andrew J and Wilson, Mark C.},\n  booktitle={Optimization Problems in Graph Theory},\n  pages={65-84},\n  year={2018},\n  publisher={Springer, Cham},\n  keywords={network science, computation, graphs},\n  url_Paper={https://arxiv.org/abs/1710.09876},\n  abstract={An important measure of signed graphs is the line index of balance which\nhas several applications in many fields. However, this graph-theoretic\nmeasure was underused for decades because of the inherent complexity in\nits computation which is closely related to solving NP-hard graph\noptimisation problems like MAXCUT. We develop new quadratic and linear\nprogramming models to compute the line index of balance exactly. Using\nthe Gurobi integer programming optimisation solver, we evaluate the line\nindex of balance on real-world and synthetic datasets. The synthetic\ndata involves Erd\\H{o}s-R\\&#x27;{e}nyi graphs, Barab\\&#x27;{a}si-Albert graphs,\nand specially structured random graphs. We also use well known datasets\nfrom the sociology literature, such as signed graphs inferred from\nstudents&#x27; choice and rejection as well as datasets from the biology\nliterature including gene regulatory networks. The results show that\nexact values of the line index of balance in relatively large signed\ngraphs can be efficiently computed using our suggested optimisation\nmodels. We find that most real-world social networks and some biological\nnetworks have small line index of balance which indicates that they are\nclose to balanced.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  An important measure of signed graphs is the line index of balance which has several applications in many fields. However, this graph-theoretic measure was underused for decades because of the inherent complexity in its computation which is closely related to solving NP-hard graph optimisation problems like MAXCUT. We develop new quadratic and linear programming models to compute the line index of balance exactly. Using the Gurobi integer programming optimisation solver, we evaluate the line index of balance on real-world and synthetic datasets. The synthetic data involves Erdős-Rényi graphs, Barabási-Albert graphs, and specially structured random graphs. We also use well known datasets from the sociology literature, such as signed graphs inferred from students' choice and rejection as well as datasets from the biology literature including gene regulatory networks. The results show that exact values of the line index of balance in relatively large signed graphs can be efficiently computed using our suggested optimisation models. We find that most real-world social networks and some biological networks have small line index of balance which indicates that they are close to balanced.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"aref-wilson-measuringpartialbalanceinsignednetworks-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Aref, S.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1509.04037\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'aref-wilson-measuringpartialbalanceinsignednetworks-2018', 'http://arxiv.org/abs/1509.04037', event);\">\n    Measuring partial balance in signed networks.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Journal of Complex Networks</i>, 6(4): 566-595.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1509.04037\"\n     onclick=\"log_download('aref-wilson-measuringpartialbalanceinsignednetworks-2018', 'http://arxiv.org/abs/1509.04037', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Measuring partial balance in signed networks [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/aref-wilson-measuringpartialbalanceinsignednetworks-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('aref-wilson-measuringpartialbalanceinsignednetworks-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{aref2018measuring,\n  title={Measuring partial balance in signed networks},\n  author={Aref, Samin and Wilson, Mark C.},\n  journal={Journal of Complex Networks},\n  volume={6},\n  number={4},\n  pages={566-595},\n  year={2018},\n  publisher={Oxford University Press},\n  keywords={network science, graphs},\n  url_Paper={http://arxiv.org/abs/1509.04037},\n  abstract={Is the enemy of an enemy necessarily a friend? If not, to what extent\ndoes this tend to hold? Such questions were formulated in terms of\nsigned (social) networks and necessary and sufficient conditions for a\nnetwork to be ‘balanced’ were obtained around 1960. Since then the idea\nthat signed networks tend over time to become more balanced has been\nwidely used in several application areas. However, investigation of this\nhypothesis has been complicated by the lack of a standard measure of\npartial balance, since complete balance is almost never achieved in\npractice. We formalize the concept of a measure of partial balance,\ndiscuss various measures, compare the measures on synthetic datasets and\ninvestigate their axiomatic properties. The synthetic data involves\nErd\\H{o}s-R\\&#x27;{e}nyi and specially structured random graphs. We show that\nsome measures behave better than others in terms of axioms and ability\nto differentiate between graphs. We also use well-known data sets from\nthe sociology and biology literature, such as Read&#x27;s New Guinean tribes,\ngene regulatory networks related to two organisms, and a network\ninvolving senate bill co-sponsorship. Our results show that\nsubstantially different levels of partial balance is observed under\ncycle-based, eigenvalue-based and frustration-based measures. We make\nsome recommendations for measures to be used in future work.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Is the enemy of an enemy necessarily a friend? If not, to what extent does this tend to hold? Such questions were formulated in terms of signed (social) networks and necessary and sufficient conditions for a network to be ‘balanced’ were obtained around 1960. Since then the idea that signed networks tend over time to become more balanced has been widely used in several application areas. However, investigation of this hypothesis has been complicated by the lack of a standard measure of partial balance, since complete balance is almost never achieved in practice. We formalize the concept of a measure of partial balance, discuss various measures, compare the measures on synthetic datasets and investigate their axiomatic properties. The synthetic data involves Erdős-Rényi and specially structured random graphs. We show that some measures behave better than others in terms of axioms and ability to differentiate between graphs. We also use well-known data sets from the sociology and biology literature, such as Read's New Guinean tribes, gene regulatory networks related to two organisms, and a network involving senate bill co-sponsorship. Our results show that substantially different levels of partial balance is observed under cycle-based, eigenvalue-based and frustration-based measures. We make some recommendations for measures to be used in future work.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2017\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2017')\"\n      onkeypress=\"toggleGroup('group_2017')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2017</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"wilson-universitiesspendmillionsonaccessingresultsofpubliclyfundedresearch-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-universitiesspendmillionsonaccessingresultsofpubliclyfundedresearch-2017', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event);\">\n    Universities spend millions on accessing results of publicly funded research.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n   2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('wilson-universitiesspendmillionsonaccessingresultsofpubliclyfundedresearch-2017', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Universities spend millions on accessing results of publicly funded research [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-universitiesspendmillionsonaccessingresultsofpubliclyfundedresearch-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>5 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-universitiesspendmillionsonaccessingresultsofpubliclyfundedresearch-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{wilson2017conversation,\n  title={Universities spend millions on accessing results of publicly funded research},\n  author={Wilson, Mark C.},\n  journal={New Zealand Mathematical Society Newsletter},\n  year={2017},\n  publisher={The Conversation},\n    keywords={publication reform, advocacy},\n  url_Link={},\n  abstract={}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"holcombe-wilson-fairopenaccessreturningcontrolofscholarlyjournalstotheircommunities-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Holcombe, A.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://blogs.lse.ac.uk/impactofsocialsciences/2017/10/23/fair-open-access-returning-control-of-scholarly-journals-to-their-communities/\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'holcombe-wilson-fairopenaccessreturningcontrolofscholarlyjournalstotheircommunities-2017', 'https://blogs.lse.ac.uk/impactofsocialsciences/2017/10/23/fair-open-access-returning-control-of-scholarly-journals-to-their-communities/', event);\">\n    Fair open access: returning control of scholarly journals to their communities.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n   2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://blogs.lse.ac.uk/impactofsocialsciences/2017/10/23/fair-open-access-returning-control-of-scholarly-journals-to-their-communities/\"\n     onclick=\"log_download('holcombe-wilson-fairopenaccessreturningcontrolofscholarlyjournalstotheircommunities-2017', 'https://blogs.lse.ac.uk/impactofsocialsciences/2017/10/23/fair-open-access-returning-control-of-scholarly-journals-to-their-communities/', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Fair open access: returning control of scholarly journals to their communities [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/holcombe-wilson-fairopenaccessreturningcontrolofscholarlyjournalstotheircommunities-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('holcombe-wilson-fairopenaccessreturningcontrolofscholarlyjournalstotheircommunities-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{holcombe2017fair,\n  title={Fair open access: returning control of scholarly journals to their communities},\n  author={Holcombe, Alex and Wilson, Mark C.},\n  journal={Impact of Social Sciences Blog},\n  year={2017},\n  publisher={London School of Economics and Political Science},\n    keywords={publication reform, advocacy},\n  url_Link={https://blogs.lse.ac.uk/impactofsocialsciences/2017/10/23/fair-open-access-returning-control-of-scholarly-journals-to-their-communities/},\n  abstract={}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"neylon-roberts-wilson-resultsofaworldwidesurveyofmathematiciansonjournalreform-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Neylon, C.; Roberts, D. M.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488X&amp;vol=3&amp;iss=103&amp;rank=9\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'neylon-roberts-wilson-resultsofaworldwidesurveyofmathematiciansonjournalreform-2017', 'http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488X&amp;vol=3&amp;iss=103&amp;rank=9', event);\">\n    Results of a worldwide survey of mathematicians on journal reform.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>European Mathematical Society Newsletter</i>, 3(103): 46-49.  2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488X&amp;vol=3&amp;iss=103&amp;rank=9\"\n     onclick=\"log_download('neylon-roberts-wilson-resultsofaworldwidesurveyofmathematiciansonjournalreform-2017', 'http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488X&amp;vol=3&amp;iss=103&amp;rank=9', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Results of a worldwide survey of mathematicians on journal reform [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/neylon-roberts-wilson-resultsofaworldwidesurveyofmathematiciansonjournalreform-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>8 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('neylon-roberts-wilson-resultsofaworldwidesurveyofmathematiciansonjournalreform-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{neylon2017results,\n  title={Results of a worldwide survey of mathematicians on journal reform},\n  author={Neylon, Cameron and Roberts, David M. and Wilson, Mark C.},\n  journal={European Mathematical Society Newsletter},\n  volume={3},\n  number={103},\n  pages={46-49},\n  year={2017},\n  keywords={publication reform},\n  url_Paper={http://www.ems-ph.org/journals/show_pdf.php?issn=1027-488X&amp;vol=3&amp;iss=103&amp;rank=9},\n  abstract={}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"lo-wilson-newalgorithmsformatchingproblems-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Lo, J.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1703.04225\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'lo-wilson-newalgorithmsformatchingproblems-2017', 'http://arxiv.org/abs/1703.04225', event);\">\n    New algorithms for matching problems.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>arXiv preprint arXiv:1703.04225</i>.  2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1703.04225\"\n     onclick=\"log_download('lo-wilson-newalgorithmsformatchingproblems-2017', 'http://arxiv.org/abs/1703.04225', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"New algorithms for matching problems [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/lo-wilson-newalgorithmsformatchingproblems-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>10 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('lo-wilson-newalgorithmsformatchingproblems-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{lo2017new,\n  title={New algorithms for matching problems},\n  author={Lo, Jacky and Wilson, Mark C.},\n  journal={arXiv preprint arXiv:1703.04225},\n  year={2017},\n  keywords={social choice, allocation, algorithms},\n  url_Paper={http://arxiv.org/abs/1703.04225},\n  abstract={The standard two-sided and one-sided matching problems, and the closely\nrelated school choice problem, have been widely studied from an\naxiomatic viewpoint. A small number of algorithms dominate the\nliterature. For two-sided matching, the Gale-Shapley algorithm; for\none-sided matching, (random) Serial Dictatorship and Probabilistic\nSerial rule; for school choice, Gale-Shapley and the Boston mechanisms.\nThe main reason for the dominance of these algorithms is their good\n(worst-case) axiomatic behaviour with respect to notions of efficiency\nand strategyproofness. However if we shift the focus to fairness, social\nwelfare, tradeoffs between incompatible axioms, and average-case\nanalysis, it is far from clear that these algorithms are optimal. We\ninvestigate new algorithms several of which have not appeared (to our\nknowledge) in the literature before. We give a unified presentation in\nwhich algorithms for 2-sided matching yield 1-sided matching algorithms\nin a systematic way. In addition to axiomatic properties, we investigate\nagent welfare using both theoretical and computational approaches. We\nfind that some of the new algorithms are worthy of consideration for\ncertain applications. In particular, when considering welfare under\ntruthful preferences, some of the new algorithms outperform the classic\nones.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The standard two-sided and one-sided matching problems, and the closely related school choice problem, have been widely studied from an axiomatic viewpoint. A small number of algorithms dominate the literature. For two-sided matching, the Gale-Shapley algorithm; for one-sided matching, (random) Serial Dictatorship and Probabilistic Serial rule; for school choice, Gale-Shapley and the Boston mechanisms. The main reason for the dominance of these algorithms is their good (worst-case) axiomatic behaviour with respect to notions of efficiency and strategyproofness. However if we shift the focus to fairness, social welfare, tradeoffs between incompatible axioms, and average-case analysis, it is far from clear that these algorithms are optimal. We investigate new algorithms several of which have not appeared (to our knowledge) in the literature before. We give a unified presentation in which algorithms for 2-sided matching yield 1-sided matching algorithms in a systematic way. In addition to axiomatic properties, we investigate agent welfare using both theoretical and computational approaches. We find that some of the new algorithms are worthy of consideration for certain applications. In particular, when considering welfare under truthful preferences, some of the new algorithms outperform the classic ones.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sakhaee-wilson-hendy-zakeri-networkanalysisofnewzealandlegislation-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Sakhaee, N.; <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>; Hendy, S.;  and Zakeri, G.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'sakhaee-wilson-hendy-zakeri-networkanalysisofnewzealandlegislation-2017', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event);\">\n    Network analysis of New Zealand legislation.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>New Zealand Law Journal</i>,332-337.  2017.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('sakhaee-wilson-hendy-zakeri-networkanalysisofnewzealandlegislation-2017', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Network analysis of New Zealand legislation [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sakhaee-wilson-hendy-zakeri-networkanalysisofnewzealandlegislation-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sakhaee-wilson-hendy-zakeri-networkanalysisofnewzealandlegislation-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{sakhaee2017network,\n  title={Network analysis of New Zealand legislation},\n  author={Sakhaee, Neda and Wilson, Mark C. and Hendy, Shaun and Zakeri, Golbon},\n  journal={New Zealand Law Journal},\n  pages={332-337},\n  year={2017},\n  publisher={},\n  keywords={network science},\n  url_Paper={},\n  abstract={A summary for a legal audience of the basic early findings in Neda&#x27;s PhD\nwork about citation networks derived from legislation.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A summary for a legal audience of the basic early findings in Neda's PhD work about citation networks derived from legislation.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2016\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2016')\"\n      onkeypress=\"toggleGroup('group_2016')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2016</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"girard-pavlov-wilson-networkedcrowdsanswertrickyquestionspoorly-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Girard, P.; Pavlov, V.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'girard-pavlov-wilson-networkedcrowdsanswertrickyquestionspoorly-2016', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event);\">\n    Networked crowds answer tricky questions poorly.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  ,8pp.  2016.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('girard-pavlov-wilson-networkedcrowdsanswertrickyquestionspoorly-2016', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Networked crowds answer tricky questions poorly [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/girard-pavlov-wilson-networkedcrowdsanswertrickyquestionspoorly-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('girard-pavlov-wilson-networkedcrowdsanswertrickyquestionspoorly-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{GPW2016,\n  title={Networked crowds answer tricky questions poorly},\n  author={Girard, Patrick and Pavlov, Valery and Wilson, Mark C.},\n  journal={},\n  volume={},\n  number={},\n  pages={8pp},\n  year={2016},\n  publisher={},\n  keywords={network science},\n  url_Paper={},\n  abstract={We focus on the following basic group decision situation, which we call\niterative distributed jury (IDJ), a variant of the Delphi technique.\nGroup members seek to answer truthfully a question having a welldefined\nobjectively correct answer; they revise answers iteratively; only\nsummary feedback on group members&#x27; answers is available at each\niteration; individual estimates are aggregated to form a group answer.\nExperimental studies of the effectiveness of Delphi-like methods have\nyielded mixed results. To investigate further, we designed a laboratory\nmultiple choice IDJ experiment having some novel features. One novelty\nwas that we incentivized participants to reveal their ignorance; another\nis the use of both logical and factual questions. We find that, perhaps\nsurprisingly, substantial social influence occurs even in this highly\nanonymized and information-restricted setting, and even for purely\nlogical questions. Eventual group accuracy is strongly dependent on the\ntrickiness (likelihood of being answered confidently but wrongly, a\nconcept distinct from difficulty) of the question. Also, the bulk of\nlearning occurs by those who were willing to admit to being undecided.\nWe find that question factors are more important than participant\ncharacteristics.  In addition to consequences for the practical use of\nthis group decision method, our quantitative results suggest specific\nnew models of opinion dynamics that deserve detailed study.} \n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We focus on the following basic group decision situation, which we call iterative distributed jury (IDJ), a variant of the Delphi technique. Group members seek to answer truthfully a question having a welldefined objectively correct answer; they revise answers iteratively; only summary feedback on group members' answers is available at each iteration; individual estimates are aggregated to form a group answer. Experimental studies of the effectiveness of Delphi-like methods have yielded mixed results. To investigate further, we designed a laboratory multiple choice IDJ experiment having some novel features. One novelty was that we incentivized participants to reveal their ignorance; another is the use of both logical and factual questions. We find that, perhaps surprisingly, substantial social influence occurs even in this highly anonymized and information-restricted setting, and even for purely logical questions. Eventual group accuracy is strongly dependent on the trickiness (likelihood of being answered confidently but wrongly, a concept distinct from difficulty) of the question. Also, the bulk of learning occurs by those who were willing to admit to being undecided. We find that question factors are more important than participant characteristics. In addition to consequences for the practical use of this group decision method, our quantitative results suggest specific new models of opinion dynamics that deserve detailed study.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sakhaee-wilson-zakeri-newzealandlegislationnetwork-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Sakhaee, N.; <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>;  and Zakeri, G.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drive.google.com/SWZ2016.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'sakhaee-wilson-zakeri-newzealandlegislationnetwork-2016', 'https://drive.google.com/SWZ2016.pdf', event);\">\n    New Zealand Legislation Network.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>JURIX</i>, pages 199-202,  2016. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drive.google.com/SWZ2016.pdf\"\n     onclick=\"log_download('sakhaee-wilson-zakeri-newzealandlegislationnetwork-2016', 'https://drive.google.com/SWZ2016.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"New Zealand Legislation Network. [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sakhaee-wilson-zakeri-newzealandlegislationnetwork-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sakhaee-wilson-zakeri-newzealandlegislationnetwork-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{sakhaee2016new,\n  title={New Zealand Legislation Network.},\n  author={Sakhaee, Neda and Wilson, Mark C. and Zakeri, Golbon},\n  booktitle={JURIX},\n  pages={199-202},\n  year={2016},\n  keywords={network science},\n  url_Paper={SWZ2016.pdf},\n  abstract={This paper concerns the recently introduced concept of Legislation\nNetworks, with an application focus on the New Zealand legislation\nnetwork. Legislation networks have some novel features which make them\nan excellent test case for new network science tools. They involve legal\ndocuments, but differ substantially from citation networks involving\ncase-law, Supreme Court opinions, etc. We develop several such networks,\ncompute relevant centrality measures, and apply community detection\nalgorithms. We study the relationship between the legislation network\nmeasures and legal/political factors. The intention is to follow-up with\nmore detailed studies in network science (link prediction, node\nattribute prediction, generative models and time evolution) and legal\nand political analyses.}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper concerns the recently introduced concept of Legislation Networks, with an application focus on the New Zealand legislation network. Legislation networks have some novel features which make them an excellent test case for new network science tools. They involve legal documents, but differ substantially from citation networks involving case-law, Supreme Court opinions, etc. We develop several such networks, compute relevant centrality measures, and apply community detection algorithms. We study the relationship between the legislation network measures and legal/political factors. The intention is to follow-up with more detailed studies in network science (link prediction, node attribute prediction, generative models and time evolution) and legal and political analyses.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hadjibeyli-wilson-distancerationalizationofsocialrules-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Hadjibeyli, B.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://arxiv.org/abs/1610.01902\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'hadjibeyli-wilson-distancerationalizationofsocialrules-2016', 'http://arxiv.org/abs/1610.01902', event);\">\n    Distance rationalization of social rules.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>arXiv preprint arXiv:1610.01902</i>.  2016.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://arxiv.org/abs/1610.01902\"\n     onclick=\"log_download('hadjibeyli-wilson-distancerationalizationofsocialrules-2016', 'http://arxiv.org/abs/1610.01902', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Distance rationalization of social rules [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hadjibeyli-wilson-distancerationalizationofsocialrules-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hadjibeyli-wilson-distancerationalizationofsocialrules-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{hadjibeyli2016distance,\n  title={Distance rationalization of social rules},\n  author={Hadjibeyli, Benjamin and Wilson, Mark C.},\n  journal={arXiv preprint arXiv:1610.01902},\n  year={2016},\n  keywords={social choice, voting},\n  url_Paper={http://arxiv.org/abs/1610.01902},\n  abstract={The concept of distance rationalizability of social choice rules has\nbeen explored in recent years by several authors. We deal here with\nseveral foundational questions, and unify, correct, and generalize\nprevious work. For example, we study a new question involving uniqueness\nof representation in the distance rationalizability framework, and\npresent a counterexample. For rules satisfying various axiomatic\nproperties such as anonymity, neutrality and homogeneity, the standard\nprofile representation of input can be compressed substantially. We\nexplain in detail using quotient constructions how distance\nrationalizability is interpreted in this situation. This enables us to\nconnect the theory of distance rationalizability with geometric concepts\nsuch as Earth Mover distance and optimal transportation. We give\nimproved sufficient conditions for distance rationalizable rules to\nsatisfy anonymity, neutrality, homogeneity, consistency and continuity.}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The concept of distance rationalizability of social choice rules has been explored in recent years by several authors. We deal here with several foundational questions, and unify, correct, and generalize previous work. For example, we study a new question involving uniqueness of representation in the distance rationalizability framework, and present a counterexample. For rules satisfying various axiomatic properties such as anonymity, neutrality and homogeneity, the standard profile representation of input can be compressed substantially. We explain in detail using quotient constructions how distance rationalizability is interpreted in this situation. This enables us to connect the theory of distance rationalizability with geometric concepts such as Earth Mover distance and optimal transportation. We give improved sufficient conditions for distance rationalizable rules to satisfy anonymity, neutrality, homogeneity, consistency and continuity.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"melczer-wilson-asymptoticsoflatticewalksviaanalyticcombinatoricsinseveralvariables-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Melczer, S.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://dmtcs.episciences.org/6390/pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'melczer-wilson-asymptoticsoflatticewalksviaanalyticcombinatoricsinseveralvariables-2016', 'https://dmtcs.episciences.org/6390/pdf', event);\">\n    Asymptotics of lattice walks via analytic combinatorics in several variables.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2016 Conference on Formal Power Series and Algebraic Combinatorics, FPSAC2016</i>, of <i>Discrete Math. Theor. Comput. Sci. Proc., AH</i>, pages 863-874,  2016. Assoc. Discrete Math. Theor. Comput. Sci., Nancy\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://dmtcs.episciences.org/6390/pdf\"\n     onclick=\"log_download('melczer-wilson-asymptoticsoflatticewalksviaanalyticcombinatoricsinseveralvariables-2016', 'https://dmtcs.episciences.org/6390/pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Asymptotics of lattice walks via analytic combinatorics in several variables [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/melczer-wilson-asymptoticsoflatticewalksviaanalyticcombinatoricsinseveralvariables-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('melczer-wilson-asymptoticsoflatticewalksviaanalyticcombinatoricsinseveralvariables-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings {MeWi2016, \nAUTHOR = {Stephen Melczer and Wilson, Mark C.},\n     TITLE = {Asymptotics of lattice walks via analytic combinatorics in several variables},\n BOOKTITLE = {2016 {C}onference on {F}ormal {P}ower {S}eries and {A}lgebraic {C}ombinatorics, FPSAC2016},\n    SERIES = {Discrete Math. Theor. Comput. Sci. Proc., AH},\n     PAGES = {863-874},\n PUBLISHER = {Assoc. Discrete Math. Theor. Comput. Sci., Nancy},\n      YEAR = {2016},\n  keywords={ACSV applications},\n  url_Paper={https://dmtcs.episciences.org/6390/pdf},\n  abstract={We consider the enumeration of walks on the two dimensional non-negative\ninteger lattice with short steps. Up to isomorphism there are 79 unique\ntwo dimensional models to consider, and previous work in this area has\nused the kernel method, along with a rigorous computer algebra approach,\nto show that 23 of the 79 models admit D-finite generating functions. In\n2009, Bostan and Kauers used Pad\\&#x27;{e}-Hermite approximants to guess\ndifferential equations which these 23 generating functions satisfy, in\nthe process guessing asymptotics of their coefficient sequences. In this\narticle we provide, for the first time, a complete rigorous verification\nof these guesses. Our technique is to use the kernel method to express\n19 of the 23 generating functions as diagonals of tri-variate rational\nfunctions and apply the methods of analytic combinatorics in several\nvariables (the remaining 4 models have algebraic generating functions\nand can thus be handled by univariate techniques). This approach also\nshows the link between combinatorial properties of the models and\nfeatures of its asymptotics such as asymptotic and polynomial growth\nfactors. In addition, we give expressions for the number of walks\nreturning to the x-axis, the y-axis, and the origin, proving recently\nconjectured asymptotics of Bostan, Chyzak, van Hoeij, Kauers, and Pech.}\n  \n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method, along with a rigorous computer algebra approach, to show that 23 of the 79 models admit D-finite generating functions. In 2009, Bostan and Kauers used Padé-Hermite approximants to guess differential equations which these 23 generating functions satisfy, in the process guessing asymptotics of their coefficient sequences. In this article we provide, for the first time, a complete rigorous verification of these guesses. Our technique is to use the kernel method to express 19 of the 23 generating functions as diagonals of tri-variate rational functions and apply the methods of analytic combinatorics in several variables (the remaining 4 models have algebraic generating functions and can thus be handled by univariate techniques). This approach also shows the link between combinatorial properties of the models and features of its asymptotics such as asymptotic and polynomial growth factors. In addition, we give expressions for the number of walks returning to the x-axis, the y-axis, and the origin, proving recently conjectured asymptotics of Bostan, Chyzak, van Hoeij, Kauers, and Pech.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2015\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2015')\"\n      onkeypress=\"toggleGroup('group_2015')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2015</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"wilson-diagonalasymptoticsforproductsofcombinatorialclasses-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/diagonal-asymptotics-for-products-of-combinatorial-classes/DE65A4AA078A6161905DD6CEFBEDC85E\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-diagonalasymptoticsforproductsofcombinatorialclasses-2015', 'https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/diagonal-asymptotics-for-products-of-combinatorial-classes/DE65A4AA078A6161905DD6CEFBEDC85E', event);\">\n    Diagonal asymptotics for products of combinatorial classes.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Combinatorics, Probability and Computing</i>, 24(1): 354-372.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/diagonal-asymptotics-for-products-of-combinatorial-classes/DE65A4AA078A6161905DD6CEFBEDC85E\"\n     onclick=\"log_download('wilson-diagonalasymptoticsforproductsofcombinatorialclasses-2015', 'https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/diagonal-asymptotics-for-products-of-combinatorial-classes/DE65A4AA078A6161905DD6CEFBEDC85E', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Diagonal asymptotics for products of combinatorial classes [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-diagonalasymptoticsforproductsofcombinatorialclasses-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-diagonalasymptoticsforproductsofcombinatorialclasses-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson2015diagonal,\n  title={Diagonal asymptotics for products of combinatorial classes},\n  author={Wilson, Mark C.},\n  journal={Combinatorics, Probability and Computing},\n  volume={24},\n  number={1},\n  pages={354-372},\n  year={2015},\n  publisher={Cambridge University Press},\n  keywords={ACSV theory},\n  url_Paper={https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/diagonal-asymptotics-for-products-of-combinatorial-classes/DE65A4AA078A6161905DD6CEFBEDC85E},\n  abstract={We generalize and improve recent results by B\\&#x27;{o}na and Knopfmacher and\nby Banderier and Hitczenko concerning the joint distribution of the sum\nand number of parts in tuples of restricted compositions. Specifically,\nwe generalize the problem to general combinatorial classes and relax the\nrequirement that the sizes of the compositions be equal. We extend the\nmain explicit results to enumeration problems whose counting sequences\nare Riordan arrays.  In this framework, we give an alternative method\nfor computing asymptotics in the supercritical case, which avoids\nexplicit diagonal extraction and seems likely to be computationally more\nefficient.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We generalize and improve recent results by Bóna and Knopfmacher and by Banderier and Hitczenko concerning the joint distribution of the sum and number of parts in tuples of restricted compositions. Specifically, we generalize the problem to general combinatorial classes and relax the requirement that the sizes of the compositions be equal. We extend the main explicit results to enumeration problems whose counting sequences are Riordan arrays. In this framework, we give an alternative method for computing asymptotics in the supercritical case, which avoids explicit diagonal extraction and seems likely to be computationally more efficient.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2014\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2014')\"\n      onkeypress=\"toggleGroup('group_2014')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2014</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"mansour-shattuck-wilson-congruencesuccessionsincompositions-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Mansour, T.; Shattuck, M.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://dmtcs.episciences.org/1252\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'mansour-shattuck-wilson-congruencesuccessionsincompositions-2014', 'http://dmtcs.episciences.org/1252', event);\">\n    Congruence successions in compositions.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Discret. Math. Theor. Comput. Sci.</i>, 16(1): 327-338.  2014.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://dmtcs.episciences.org/1252\"\n     onclick=\"log_download('mansour-shattuck-wilson-congruencesuccessionsincompositions-2014', 'http://dmtcs.episciences.org/1252', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Congruence successions in compositions [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mansour-shattuck-wilson-congruencesuccessionsincompositions-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mansour-shattuck-wilson-congruencesuccessionsincompositions-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{MSW2014,\n  author    = {Toufik Mansour and\n               Mark Shattuck and\n               Mark C. Wilson},\n  title     = {Congruence successions in compositions},\n  journal   = {Discret. Math. Theor. Comput. Sci.},\n  volume    = {16},\n  number    = {1},\n  pages     = {327-338},\n  year      = {2014},\n  keywords={combinatorics},\n  url       = {http://dmtcs.episciences.org/1252},\n  abstract={A \\emph{composition} is a sequence of positive integers, called\n\\emph{parts}, having a fixed sum.  By an \\emph{$m$-congruence\nsuccession}, we will mean a pair of adjacent parts $x$ and $y$ within a\ncomposition such that $x\\equiv y~(\\text{mod}~m)$.  Here, we consider the\nproblem of counting the compositions of size $n$ according to the number\nof $m$-congruence successions, extending recent results concerning\nsuccessions on subsets and permutations.  A general formula is obtained,\nwhich reduces in the limiting case to the known generating function\nformula for the number of Carlitz compositions.  Special attention is\npaid to the case $m=2$, where further enumerative results may be\nobtained by means of combinatorial arguments.  Finally, an asymptotic\nestimate is provided for the number of compositions of size $n$ having\nno $m$-congruence successions.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A \\emphcomposition is a sequence of positive integers, called \\emphparts, having a fixed sum. By an \\emph$m$-congruence succession, we will mean a pair of adjacent parts $x$ and $y$ within a composition such that $x≡ y (\\text{mod} m)$. Here, we consider the problem of counting the compositions of size $n$ according to the number of $m$-congruence successions, extending recent results concerning successions on subsets and permutations. A general formula is obtained, which reduces in the limiting case to the known generating function formula for the number of Carlitz compositions. Special attention is paid to the case $m=2$, where further enumerative results may be obtained by means of combinatorial arguments. Finally, an asymptotic estimate is provided for the number of compositions of size $n$ having no $m$-congruence successions.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"emery-wilson-iteratedregretminimizationinvotinggames-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Emery, M.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.cs.cmu.edu/~arielpro/comsoc-14/papers/EmeryWilson2014.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'emery-wilson-iteratedregretminimizationinvotinggames-2014', 'http://www.cs.cmu.edu/~arielpro/comsoc-14/papers/EmeryWilson2014.pdf', event);\">\n    Iterated Regret Minimization in Voting Games.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>COMSOC 2014, Pittsburgh, June 23-25, 2014</i>, pages 12pp,  2014. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.cs.cmu.edu/~arielpro/comsoc-14/papers/EmeryWilson2014.pdf\"\n     onclick=\"log_download('emery-wilson-iteratedregretminimizationinvotinggames-2014', 'http://www.cs.cmu.edu/~arielpro/comsoc-14/papers/EmeryWilson2014.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Iterated Regret Minimization in Voting Games [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/emery-wilson-iteratedregretminimizationinvotinggames-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('emery-wilson-iteratedregretminimizationinvotinggames-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{EmWi2014,\n  author    = {Miranda Emery and\n               Mark C. Wilson},\n  title     = {Iterated Regret Minimization in Voting Games},\n  booktitle = {COMSOC 2014, Pittsburgh, June 23-25, 2014},\n  pages     = {12pp},\n  year      = {2014},\n  keywords={social choice, voting, game theory},\n url   = {http://www.cs.cmu.edu/~arielpro/comsoc-14/papers/EmeryWilson2014.pdf},\n  abstract={The game-theoretic solution concept Iterated Regret Minimization (IRM)\nwas introduced recently by Halpern and Pass. We give the first\napplication of IRM to simultaneous voting games. We study positional\nscoring rules in detail and give theoretical results demonstrating the\nbias of IRM toward sincere voting. We present comprehensive simulation\nresults of the effect on social welfare of IRM compared to both sincere\nand optimal voting. The results fit into a broader research theme of the\nwelfare consequences of strategic voting.}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The game-theoretic solution concept Iterated Regret Minimization (IRM) was introduced recently by Halpern and Pass. We give the first application of IRM to simultaneous voting games. We study positional scoring rules in detail and give theoretical results demonstrating the bias of IRM toward sincere voting. We present comprehensive simulation results of the effect on social welfare of IRM compared to both sincere and optimal voting. The results fit into a broader research theme of the welfare consequences of strategic voting.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-pritchard-simulatingthe2011referenduminnewzealand-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>;  and Pritchard, G.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://markcwilson.site/Research/Outputs/PrWi2013.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-pritchard-simulatingthe2011referenduminnewzealand-2014', 'https://markcwilson.site/Research/Outputs/PrWi2013.pdf', event);\">\n    Simulating the 2011 Referendum in New Zealand.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Parliamentary Affairs</i>, 67(4): 969-980.  2014.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://markcwilson.site/Research/Outputs/PrWi2013.pdf\"\n     onclick=\"log_download('wilson-pritchard-simulatingthe2011referenduminnewzealand-2014', 'https://markcwilson.site/Research/Outputs/PrWi2013.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Simulating the 2011 Referendum in New Zealand [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://www.stat.auckland.ac.nz/~geoff/voting/\"\n     onclick=\"log_download('wilson-pritchard-simulatingthe2011referenduminnewzealand-2014', 'https://www.stat.auckland.ac.nz/~geoff/voting/', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Simulating the 2011 Referendum in New Zealand [link]\"\n       title=\" slides\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> slides</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-pritchard-simulatingthe2011referenduminnewzealand-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>7 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-pritchard-simulatingthe2011referenduminnewzealand-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson2014simulating,\n  title={Simulating the 2011 Referendum in New Zealand},\n  author={Wilson, Mark C. and Pritchard, Geoffrey},\n  journal={Parliamentary Affairs},\n  volume={67},\n  number={4},\n  pages={969-980},\n  year={2014},\n  publisher={Oxford University Press},\n  keywords={electoral systems, simulation},\n  url_Paper={https://markcwilson.site/Research/Outputs/PrWi2013.pdf},\n  url_Slides={https://www.stat.auckland.ac.nz/~geoff/voting/},\n  abstract={On 26 November 2011, an indicative referendum was held in New Zealand\nwith the aim of gauging public support for a change from the current\nparliamentary electoral system (Mixed Member Proportional) to one of\nfour alternatives. In order to understand the consequences (in terms of\nthe seat distribution of parties in Parliament) of a change in electoral\nsystem, we created an online simulator several months before the\nreferendum date. Several interesting research issues arose in this work,\nwhich in our opinion deserve greater analysis. We describe the\nassumptions made in order to create such a simulator, and their\nconsequences.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  On 26 November 2011, an indicative referendum was held in New Zealand with the aim of gauging public support for a change from the current parliamentary electoral system (Mixed Member Proportional) to one of four alternatives. In order to understand the consequences (in terms of the seat distribution of parties in Parliament) of a change in electoral system, we created an online simulator several months before the referendum date. Several interesting research issues arose in this work, which in our opinion deserve greater analysis. We describe the assumptions made in order to create such a simulator, and their consequences.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2013\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2013')\"\n      onkeypress=\"toggleGroup('group_2013')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2013</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"wilson-reviewofmodelsofconflictandcooperationbyrickgillmananddavidhousman-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-reviewofmodelsofconflictandcooperationbyrickgillmananddavidhousman-2013', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event);\">\n    Review of Models of Conflict and Cooperation by Rick Gillman and David Housman.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ACM SIGACT News</i>, 44(1): 34-35.  2013.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('wilson-reviewofmodelsofconflictandcooperationbyrickgillmananddavidhousman-2013', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Review of Models of Conflict and Cooperation by Rick Gillman and David Housman [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-reviewofmodelsofconflictandcooperationbyrickgillmananddavidhousman-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-reviewofmodelsofconflictandcooperationbyrickgillmananddavidhousman-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson2013review,\n  title={Review of Models of Conflict and Cooperation by Rick Gillman and David Housman},\n  author={Wilson, Mark C.},\n  journal={ACM SIGACT News},\n  volume={44},\n  number={1},\n  pages={34-35},\n  year={2013},\n  publisher={ACM New York, NY, USA},\n  keywords={review},\n  url_Paper={},\n  abstract={}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"pemantle-wilson-analyticcombinatoricsinseveralvariables-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Pemantle, R.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'pemantle-wilson-analyticcombinatoricsinseveralvariables-2013', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event);\">\n    Analytic combinatorics in several variables.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  Cambridge University Press,  2013.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('pemantle-wilson-analyticcombinatoricsinseveralvariables-2013', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Analytic combinatorics in several variables [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pemantle-wilson-analyticcombinatoricsinseveralvariables-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pemantle-wilson-analyticcombinatoricsinseveralvariables-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@book{pemantle2013analytic,\n  title={Analytic combinatorics in several variables},\n  author={Pemantle, Robin and Wilson, Mark C.},\n  year={2013},\n  publisher={Cambridge University Press},\n  keywords={ACSV theory},\n  url_Paper={},\n  abstract={}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"pritchard-reyhani-wilson-powermeasuresderivedfromthesequentialqueryprocess-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Pritchard, G.; Reyhani, R.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0165489612001096?casa_token=4x3gmLGuiPIAAAAA:9crEC8R6F3yj1ut1S482WqW3UPlxOvAyL6-gzldpHWnpp7qYgbMYugOhgwxefm-mB6TFBETE_Q\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'pritchard-reyhani-wilson-powermeasuresderivedfromthesequentialqueryprocess-2013', 'https://www.sciencedirect.com/science/article/pii/S0165489612001096?casa_token=4x3gmLGuiPIAAAAA:9crEC8R6F3yj1ut1S482WqW3UPlxOvAyL6-gzldpHWnpp7qYgbMYugOhgwxefm-mB6TFBETE_Q', event);\">\n    Power measures derived from the sequential query process.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Mathematical Social Sciences</i>, 65(3): 174-180.  2013.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0165489612001096?casa_token=4x3gmLGuiPIAAAAA:9crEC8R6F3yj1ut1S482WqW3UPlxOvAyL6-gzldpHWnpp7qYgbMYugOhgwxefm-mB6TFBETE_Q\"\n     onclick=\"log_download('pritchard-reyhani-wilson-powermeasuresderivedfromthesequentialqueryprocess-2013', 'https://www.sciencedirect.com/science/article/pii/S0165489612001096?casa_token=4x3gmLGuiPIAAAAA:9crEC8R6F3yj1ut1S482WqW3UPlxOvAyL6-gzldpHWnpp7qYgbMYugOhgwxefm-mB6TFBETE_Q', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Power measures derived from the sequential query process [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pritchard-reyhani-wilson-powermeasuresderivedfromthesequentialqueryprocess-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pritchard-reyhani-wilson-powermeasuresderivedfromthesequentialqueryprocess-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{pritchard2013power,\n  title={Power measures derived from the sequential query process},\n  author={Pritchard, Geoffrey and Reyhani, Reyhaneh and Wilson, Mark C.},\n  journal={Mathematical Social Sciences},\n  volume={65},\n  number={3},\n  pages={174-180},\n  year={2013},\n  publisher={North-Holland},\n  keywords={social choice, cooperative games},\n  url_Paper={https://www.sciencedirect.com/science/article/pii/S0165489612001096?casa_token=4x3gmLGuiPIAAAAA:9crEC8R6F3yj1ut1S482WqW3UPlxOvAyL6-gzldpHWnpp7qYgbMYugOhgwxefm-mB6TFBETE_Q},\n  abstract={We study a basic sequential model for the discovery of winning\ncoalitions in a simple game, well known from its use in defining the\nShapley-Shubik power index. We derive in a uniform way a family of\nmeasures of collective and individual power in simple games, and show\nthat, as for the Shapley-Shubik index, they extend naturally to measures\nfor TU-games. In particular, the individual measures include all\nweighted semivalues. We single out the simplest measure in our family\nfor more investigation, as it is new to the literature as far as we\nknow. Although it is very different from the Shapley value, it is\nclosely related in several ways, and is the natural analogue of the\nShapley value under a nonstandard, but natural, definition of simple\ngame. We illustrate this new measure by calculating its values on some\nstandard examples.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We study a basic sequential model for the discovery of winning coalitions in a simple game, well known from its use in defining the Shapley-Shubik power index. We derive in a uniform way a family of measures of collective and individual power in simple games, and show that, as for the Shapley-Shubik index, they extend naturally to measures for TU-games. In particular, the individual measures include all weighted semivalues. We single out the simplest measure in our family for more investigation, as it is new to the literature as far as we know. Although it is very different from the Shapley value, it is closely related in several ways, and is the natural analogue of the Shapley value under a nonstandard, but natural, definition of simple game. We illustrate this new measure by calculating its values on some standard examples.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2012\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2012')\"\n      onkeypress=\"toggleGroup('group_2012')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2012</span>\n      <span class=\"bibbase_group_count\">\n        \n        (6)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"wilson-fowlie-submissiontotheelectoralcommissionreviewofmmp-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>;  and Fowlie, M.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://elections.nz/assets/2012-report-of-the-Electoral-Commission-on-the-review-of-mmp.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-fowlie-submissiontotheelectoralcommissionreviewofmmp-2012', 'https://elections.nz/assets/2012-report-of-the-Electoral-Commission-on-the-review-of-mmp.pdf', event);\">\n    Submission to the Electoral Commission review of MMP.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n   2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://elections.nz/assets/2012-report-of-the-Electoral-Commission-on-the-review-of-mmp.pdf\"\n     onclick=\"log_download('wilson-fowlie-submissiontotheelectoralcommissionreviewofmmp-2012', 'https://elections.nz/assets/2012-report-of-the-Electoral-Commission-on-the-review-of-mmp.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Submission to the Electoral Commission review of MMP [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-fowlie-submissiontotheelectoralcommissionreviewofmmp-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-fowlie-submissiontotheelectoralcommissionreviewofmmp-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{WiFo2012,\n  title={Submission to the Electoral Commission review of MMP},\n  author={Wilson, Mark C. and Fowlie, Michael},\n  year={2012},\n  publisher={Electoral Commission of New Zealand},\n   keywords={electoral systems},\n  url_Paper={https://elections.nz/assets/2012-report-of-the-Electoral-Commission-on-the-review-of-mmp.pdf},\n  abstract={},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-theelsevierboycottandbeyond-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://markcwilson.site/Research/Outputs/elsevier-nzms.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-theelsevierboycottandbeyond-2012', 'https://markcwilson.site/Research/Outputs/elsevier-nzms.pdf', event);\">\n    The Elsevier boycott and beyond.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n   2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://markcwilson.site/Research/Outputs/elsevier-nzms.pdf\"\n     onclick=\"log_download('wilson-theelsevierboycottandbeyond-2012', 'https://markcwilson.site/Research/Outputs/elsevier-nzms.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Elsevier boycott and beyond [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-theelsevierboycottandbeyond-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>2 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-theelsevierboycottandbeyond-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{wilson2012elsevier,\n  title={The Elsevier boycott and beyond},\n  author={Wilson, Mark C.},\n  journal={New Zealand Mathematical Society Newsletter},\n  year={2012},\n  publisher={},\n    keywords={publication reform, advocacy},\n  url_Paper={https://markcwilson.site/Research/Outputs/elsevier-nzms.pdf},\n  abstract={}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-ir-potonik-lladser-randomcayleydigraphsofdiameter2andgivendegree-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>; Širáň, J.; Potočnik, P.;  and Lladser, M. E.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://dmtcs.episciences.org/588/pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-ir-potonik-lladser-randomcayleydigraphsofdiameter2andgivendegree-2012', 'https://dmtcs.episciences.org/588/pdf', event);\">\n    Random Cayley digraphs of diameter 2 and given degree.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Discrete Mathematics & Theoretical Computer Science</i>, 14.  2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://dmtcs.episciences.org/588/pdf\"\n     onclick=\"log_download('wilson-ir-potonik-lladser-randomcayleydigraphsofdiameter2andgivendegree-2012', 'https://dmtcs.episciences.org/588/pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Random Cayley digraphs of diameter 2 and given degree [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-ir-potonik-lladser-randomcayleydigraphsofdiameter2andgivendegree-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-ir-potonik-lladser-randomcayleydigraphsofdiameter2andgivendegree-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson2012random,\n  title={Random Cayley digraphs of diameter 2 and given degree},\n  author={Wilson, Mark C. and {\\v{S}}ir{\\&#x27;a}{\\v{n}}, Jozef and Poto{\\v{c}}nik, Primo{\\v{z}} and Lladser, Manuel E.},\n  journal={Discrete Mathematics \\&amp; Theoretical Computer Science},\n  volume={14},\n  year={2012},\n  publisher={Episciences. org},\n  keywords={combinatorics},\n  url_Paper={https://dmtcs.episciences.org/588/pdf},\n  abstract={}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"reyhani-wilson-bestreplydynamicsforscoringrules-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Reyhani, R.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://ebooks.iospress.nl/doi/10.3233/978-1-61499-098-7-672\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'reyhani-wilson-bestreplydynamicsforscoringrules-2012', 'https://ebooks.iospress.nl/doi/10.3233/978-1-61499-098-7-672', event);\">\n    Best reply dynamics for scoring rules.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 20th European Conference on Artificial Intelligence</i>, pages 672-677,  2012. IOS Press\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://ebooks.iospress.nl/doi/10.3233/978-1-61499-098-7-672\"\n     onclick=\"log_download('reyhani-wilson-bestreplydynamicsforscoringrules-2012', 'https://ebooks.iospress.nl/doi/10.3233/978-1-61499-098-7-672', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Best reply dynamics for scoring rules [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/reyhani-wilson-bestreplydynamicsforscoringrules-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('reyhani-wilson-bestreplydynamicsforscoringrules-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{reyhani2012best,\n  title={Best reply dynamics for scoring rules},\n  author={Reyhani, Reyhaneh and Wilson, Mark C.},\n  booktitle={Proceedings of the 20th European Conference on Artificial Intelligence},\n  pages={672-677},\n  year={2012},\n  organization={IOS Press},\n  keywords={social choice, voting},\n  url_Paper={https://ebooks.iospress.nl/doi/10.3233/978-1-61499-098-7-672},\n  abstract={We consider best-reply dynamics for voting games in which all players\nare strategic and no coalitions are formed. We study the class of\nscoring rules, show convergence of a suitably restricted version for the\nplurality and veto rules, and failure of convergence for other rules\nincluding $k$-approval and Borda. In particular, for 3 candidates\nconvergence fails for all rules other than plurality and veto. We give a\nunified proof for the convergence of these two rules. Our proofs in the\ncase of plurality improve the known bound on convergence, and the other\nconvergence results are new.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider best-reply dynamics for voting games in which all players are strategic and no coalitions are formed. We study the class of scoring rules, show convergence of a suitably restricted version for the plurality and veto rules, and failure of convergence for other rules including $k$-approval and Borda. In particular, for 3 candidates convergence fails for all rules other than plurality and veto. We give a unified proof for the convergence of these two rules. Our proofs in the case of plurality improve the known bound on convergence, and the other convergence results are new.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"reyhani-wilson-khazaei-coordinationviapollinginpluralityvotinggamesunderinertia-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Reyhani, R.; <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>;  and Khazaei, J.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://home.agh.edu.pl/~faliszew/COMSOC-2012/proceedings/paper_52.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'reyhani-wilson-khazaei-coordinationviapollinginpluralityvotinggamesunderinertia-2012', 'http://home.agh.edu.pl/~faliszew/COMSOC-2012/proceedings/paper_52.pdf', event);\">\n    Coordination via Polling in Plurality Voting Games under Inertia.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>COMSOC 2012, Krakow, September 11-13, 2012</i>, pages 359-370,  2012. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://home.agh.edu.pl/~faliszew/COMSOC-2012/proceedings/paper_52.pdf\"\n     onclick=\"log_download('reyhani-wilson-khazaei-coordinationviapollinginpluralityvotinggamesunderinertia-2012', 'http://home.agh.edu.pl/~faliszew/COMSOC-2012/proceedings/paper_52.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Coordination via Polling in Plurality Voting Games under Inertia [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/reyhani-wilson-khazaei-coordinationviapollinginpluralityvotinggamesunderinertia-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('reyhani-wilson-khazaei-coordinationviapollinginpluralityvotinggamesunderinertia-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{RWK2012,\n  author    = {Reyhaneh Reyhani and\n               Mark C. Wilson and Javad Khazaei},\n  title     = {Coordination via Polling in Plurality Voting Games\nunder Inertia},\n  booktitle = {COMSOC 2012, Krakow, September 11-13, 2012},\n  pages     = {359-370},\n  year      = {2012},\n  keywords={social choice, voting, game theory},\n  url       = {http://home.agh.edu.pl/~faliszew/COMSOC-2012/proceedings/paper_52.pdf},\n  abstract={We discuss a general model for strategic voting in plurality elections\nunder uncertainty, using the concept of inertia to deal with information\nand risk attitude of agents. The model is flexible enough to be used for\nhuman societies and artificially designed multiagent systems. Under some\nfurther assumptions we show that a sequence of pre-election polls can\nhelp agents to coordinate on an equilibrium outcome. This mechanism is\nclosely related to the STV voting rule and gives insight into the\npolitical science principle known as Duverger&#x27;s law.}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We discuss a general model for strategic voting in plurality elections under uncertainty, using the concept of inertia to deal with information and risk attitude of agents. The model is flexible enough to be used for human societies and artificially designed multiagent systems. Under some further assumptions we show that a sequence of pre-election polls can help agents to coordinate on an equilibrium outcome. This mechanism is closely related to the STV voting rule and gives insight into the political science principle known as Duverger's law.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"raichev-wilson-anewapproachtoasymptoticsofmaclaurincoefficientsofalgebraicfunctions-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Raichev, A.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/pdf/1202.3826.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'raichev-wilson-anewapproachtoasymptoticsofmaclaurincoefficientsofalgebraicfunctions-2012', 'https://arxiv.org/pdf/1202.3826.pdf', event);\">\n    A new approach to asymptotics of Maclaurin coefficients of algebraic functions.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>arXiv preprint arXiv:1202.3826</i>.  2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/pdf/1202.3826.pdf\"\n     onclick=\"log_download('raichev-wilson-anewapproachtoasymptoticsofmaclaurincoefficientsofalgebraicfunctions-2012', 'https://arxiv.org/pdf/1202.3826.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"A new approach to asymptotics of Maclaurin coefficients of algebraic functions [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/raichev-wilson-anewapproachtoasymptoticsofmaclaurincoefficientsofalgebraicfunctions-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('raichev-wilson-anewapproachtoasymptoticsofmaclaurincoefficientsofalgebraicfunctions-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{raichev2012new,\n  title={A new approach to asymptotics of Maclaurin coefficients of algebraic functions},\n  author={Raichev, Alexander and Wilson, Mark C.},\n  journal={arXiv preprint arXiv:1202.3826},\n  year={2012},\n  keywords={ACSV theory},\n  url_Paper={https://arxiv.org/pdf/1202.3826.pdf},\n  abstract={We propose a general method for deriving asymptotics of the Maclaurin\nseries coefficients of algebraic functions that is based on a procedure of K. V. Safonov\nand multivariate singularity analysis. We test the feasibility of this this approach by\nexperimenting on several examples.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We propose a general method for deriving asymptotics of the Maclaurin series coefficients of algebraic functions that is based on a procedure of K. V. Safonov and multivariate singularity analysis. We test the feasibility of this this approach by experimenting on several examples.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2011\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2011')\"\n      onkeypress=\"toggleGroup('group_2011')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2011</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"ianovski-yu-elkind-wilson-thecomplexityofsafemanipulationunderscoringrules-2011\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Ianovski, E.; Yu, L.; Elkind, E.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://ijcai.org/papers11/Papers/IJCAI11-052.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'ianovski-yu-elkind-wilson-thecomplexityofsafemanipulationunderscoringrules-2011', 'http://ijcai.org/papers11/Papers/IJCAI11-052.pdf', event);\">\n    The Complexity of Safe Manipulation under Scoring Rules.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011</i>, pages 246-251,  2011. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://ijcai.org/papers11/Papers/IJCAI11-052.pdf\"\n     onclick=\"log_download('ianovski-yu-elkind-wilson-thecomplexityofsafemanipulationunderscoringrules-2011', 'http://ijcai.org/papers11/Papers/IJCAI11-052.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Complexity of Safe Manipulation under Scoring Rules [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/ianovski-yu-elkind-wilson-thecomplexityofsafemanipulationunderscoringrules-2011\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('ianovski-yu-elkind-wilson-thecomplexityofsafemanipulationunderscoringrules-2011')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{IYEW2011,\n  author    = {Egor Ianovski and\n               Lan Yu and\n               Edith Elkind and\n               Mark C. Wilson},\n  title     = {The Complexity of Safe Manipulation under Scoring Rules},\n  booktitle = {{IJCAI} 2011, Proceedings of the 22nd International Joint Conference\n               on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22,\n               2011},\n  pages     = {246-251},\n  year      = {2011},\n keywords={social choice, voting, algorithms},\n url       = {http://ijcai.org/papers11/Papers/IJCAI11-052.pdf},\n abstract={Slinko and White have recently introduced a new model of coalitional\nmanipulation of voting rules under limited communication, which they\ncall safe strategic voting&quot;. The computational aspects of this model\nwere first studied by Hazon and Elkind, who provide polynomial-time\nalgorithms for finding a safe strategic vote under $k$-approval and the\nBucklin rule. In this paper, we answer an open question of Hazon and\nElkind by presenting a polynomial-time algorithm for finding a safe\nstrategic vote under the Borda rule. Our results for Borda generalize to\nseveral interesting classes of scoring rules.}\n }\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Slinko and White have recently introduced a new model of coalitional manipulation of voting rules under limited communication, which they call safe strategic voting\". The computational aspects of this model were first studied by Hazon and Elkind, who provide polynomial-time algorithms for finding a safe strategic vote under $k$-approval and the Bucklin rule. In this paper, we answer an open question of Hazon and Elkind by presenting a polynomial-time algorithm for finding a safe strategic vote under the Borda rule. Our results for Borda generalize to several interesting classes of scoring rules.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2010\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2010')\"\n      onkeypress=\"toggleGroup('group_2010')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2010</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"reyhani-wilson-theprobabilityofsafemanipulation-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Reyhani, R.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/papers/comsoc2010.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'reyhani-wilson-theprobabilityofsafemanipulation-2010', 'http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/papers/comsoc2010.pdf', event);\">\n    The Probability of Safe Manipulation.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>COMSOC 2010, Düsseldorf, September 13-16, 2010</i>, pages 423-430,  2010. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/papers/comsoc2010.pdf\"\n     onclick=\"log_download('reyhani-wilson-theprobabilityofsafemanipulation-2010', 'http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/papers/comsoc2010.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"The Probability of Safe Manipulation [pdf]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/reyhani-wilson-theprobabilityofsafemanipulation-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('reyhani-wilson-theprobabilityofsafemanipulation-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{ReWi2010,\n  author    = {Reyhaneh Reyhani and\n               Mark C. Wilson},\n  title     = {The Probability of Safe Manipulation},\n  booktitle = {COMSOC 2010, D\\&quot;{u}sseldorf, September 13-16, 2010},\n  pages     = {423-430},\n  year      = {2010},\n  keywords={social choice, voting},\n  url       = {http://ccc.cs.uni-duesseldorf.de/COMSOC-2010/papers/comsoc2010.pdf},\n  abstract={The concept of safe manipulation has recently been introduced by Slinko\nand White. We show how to compute the asymptotic probability that a safe\nmanipulation exists for a given scoring rule under the uniform\ndistribution on voting situations (the so- called Impartial Anonymous\nCulture). The technique used is computation of volumes of convex\npolytopes. We present explicit numerical results in the 3-candidate\ncase.}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The concept of safe manipulation has recently been introduced by Slinko and White. We show how to compute the asymptotic probability that a safe manipulation exists for a given scoring rule under the uniform distribution on voting situations (the so- called Impartial Anonymous Culture). The technique used is computation of volumes of convex polytopes. We present explicit numerical results in the 3-candidate case.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-reviewofthemathematicsofvotingandelectionsahandsonapproachbyjonathankhodgeandrichardeklimaamericanmathematicalsocietymathematicalworldseriesvolume22226xivpages-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-reviewofthemathematicsofvotingandelectionsahandsonapproachbyjonathankhodgeandrichardeklimaamericanmathematicalsocietymathematicalworldseriesvolume22226xivpages-2010', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event);\">\n    Review of The mathematics of voting and elections: a hands-on approach by Jonathan K. Hodge and Richard E. Klima american mathematical society (mathematical world series, volume 22) 226+ xiv pages.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>ACM SIGACT News</i>, 41(3): 34-36.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('wilson-reviewofthemathematicsofvotingandelectionsahandsonapproachbyjonathankhodgeandrichardeklimaamericanmathematicalsocietymathematicalworldseriesvolume22226xivpages-2010', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Review of The mathematics of voting and elections: a hands-on approach by Jonathan K. Hodge and Richard E. Klima american mathematical society (mathematical world series, volume 22) 226+ xiv pages [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-reviewofthemathematicsofvotingandelectionsahandsonapproachbyjonathankhodgeandrichardeklimaamericanmathematicalsocietymathematicalworldseriesvolume22226xivpages-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-reviewofthemathematicsofvotingandelectionsahandsonapproachbyjonathankhodgeandrichardeklimaamericanmathematicalsocietymathematicalworldseriesvolume22226xivpages-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson2010mathematics,\n  title={Review of The mathematics of voting and elections: a hands-on approach by Jonathan K. Hodge and Richard E. Klima american mathematical society (mathematical world series, volume 22) 226+ xiv pages},\n  author={Wilson, Mark C.},\n  journal={ACM SIGACT News},\n  volume={41},\n  number={3},\n  pages={34-36},\n  year={2010},\n  publisher={ACM New York, NY, USA},\n  keywords={review},\n  url_Paper={},\n  abstract={}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"raichev-wilson-asymptoticsofcoefficientsofmultivariategeneratingfunctionsimprovementsformultiplepoints-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Raichev, A.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'raichev-wilson-asymptoticsofcoefficientsofmultivariategeneratingfunctionsimprovementsformultiplepoints-2010', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event);\">\n    Asymptotics of coefficients of multivariate generating functions: improvements for multiple points.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>arXiv preprint arXiv:1009.5715</i>.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('raichev-wilson-asymptoticsofcoefficientsofmultivariategeneratingfunctionsimprovementsformultiplepoints-2010', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Asymptotics of coefficients of multivariate generating functions: improvements for multiple points [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/raichev-wilson-asymptoticsofcoefficientsofmultivariategeneratingfunctionsimprovementsformultiplepoints-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('raichev-wilson-asymptoticsofcoefficientsofmultivariategeneratingfunctionsimprovementsformultiplepoints-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{raichev2010asymptotics,\n  title={Asymptotics of coefficients of multivariate generating functions: improvements for multiple points},\n  author={Raichev, Alexander and Wilson, Mark C.},\n  journal={arXiv preprint arXiv:1009.5715},\n  year={2010},\n  keywords={ACSV theory},\n  url_Paper={},\n  abstract={Let $F(x)= \\sum_{\\nu\\in\\mathbb{N}^d} F_\\nu x^\\nu$ be a multivariate\npower series with complex coefficients that converges in a neighborhood\nof the origin. Assume $F=G/H$ for some functions $G$ and $H$ holomorphic\nin a neighborhood of the origin. We derive asymptotics for the\ncoefficients $F_{r\\alpha}$ as $r \\to \\infty$ with $r\\alpha \\in\n\\mathbb{N}^d$ for $\\alpha$ in a permissible subset of $d$-tuples of\npositive reals. More specifically, we give an algorithm for computing\narbitrary terms of the asymptotic expansion for $F_{r\\alpha}$ when the\nasymptotics are controlled by a transverse multiple point of the\nanalytic variety $H = 0$. This improves upon earlier work  by R.\nPemantle and M. C. Wilson. We have implemented our algorithm in Sage and\napply it to obtain accurate numerical results for several rational\ncombinatorial generating functions.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Let $F(x)= ∑_{ν∈ℕ^d} F_ν x^ν$ be a multivariate power series with complex coefficients that converges in a neighborhood of the origin. Assume $F=G/H$ for some functions $G$ and $H$ holomorphic in a neighborhood of the origin. We derive asymptotics for the coefficients $F_{rα}$ as $r \\to ∞$ with $rα ∈ ℕ^d$ for $α$ in a permissible subset of $d$-tuples of positive reals. More specifically, we give an algorithm for computing arbitrary terms of the asymptotic expansion for $F_{rα}$ when the asymptotics are controlled by a transverse multiple point of the analytic variety $H = 0$. This improves upon earlier work by R. Pemantle and M. C. Wilson. We have implemented our algorithm in Sage and apply it to obtain accurate numerical results for several rational combinatorial generating functions.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-aninterestingnewmahonianpermutationstatistic-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r147/pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-aninterestingnewmahonianpermutationstatistic-2010', 'https://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r147/pdf', event);\">\n    An interesting new Mahonian permutation statistic.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Electronic Journal of Combinatorics</i>,R147.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r147/pdf\"\n     onclick=\"log_download('wilson-aninterestingnewmahonianpermutationstatistic-2010', 'https://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r147/pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"An interesting new Mahonian permutation statistic [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-aninterestingnewmahonianpermutationstatistic-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>3 downloads</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-aninterestingnewmahonianpermutationstatistic-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson2010interesting,\n  title={An interesting new Mahonian permutation statistic},\n  author={Wilson, Mark C.},\n  journal={Electronic Journal of Combinatorics},\n  pages={R147},\n  year={2010},\n  keywords={combinatorics},\n  url_Paper={https://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r147/pdf},\n  abstract={The standard algorithm for generating a random permutation gives rise to\nan obvious permutation statistic DIS that is readily seen to be\nMahonian. We give evidence showing that it is not equal to any\npreviously published statistic. Nor does its joint distribution with the\nstandard Eulerian statistics des and exc appear to coincide with any\nknown Euler-Mahonian pair.\n\nA general construction of Skandera yields an Eulerian partner eul such\nthat (eul, DIS) is equidistributed with (des, MAJ). However eul itself\nappears not to be a known Eulerian statistic.\n\nSeveral ideas for further research on this topic are listed.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The standard algorithm for generating a random permutation gives rise to an obvious permutation statistic DIS that is readily seen to be Mahonian. We give evidence showing that it is not equal to any previously published statistic. Nor does its joint distribution with the standard Eulerian statistics des and exc appear to coincide with any known Euler-Mahonian pair. A general construction of Skandera yields an Eulerian partner eul such that (eul, DIS) is equidistributed with (des, MAJ). However eul itself appears not to be a known Eulerian statistic. Several ideas for further research on this topic are listed.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"pemantle-wilson-asymptoticexpansionsofoscillatoryintegralswithcomplexphase-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Pemantle, R.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/pdf/0903.3585.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'pemantle-wilson-asymptoticexpansionsofoscillatoryintegralswithcomplexphase-2010', 'https://arxiv.org/pdf/0903.3585.pdf', event);\">\n    Asymptotic expansions of oscillatory integrals with complex phase.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>Algorithmic probability and combinatorics</i>, volume 520, of Contemp. Math., pages 221-240. Amer. Math. Soc., Providence, RI,  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/pdf/0903.3585.pdf\"\n     onclick=\"log_download('pemantle-wilson-asymptoticexpansionsofoscillatoryintegralswithcomplexphase-2010', 'https://arxiv.org/pdf/0903.3585.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Asymptotic expansions of oscillatory integrals with complex phase [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pemantle-wilson-asymptoticexpansionsofoscillatoryintegralswithcomplexphase-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pemantle-wilson-asymptoticexpansionsofoscillatoryintegralswithcomplexphase-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@incollection {PeWi2010,\n    AUTHOR = {Pemantle, Robin and Wilson, Mark C.},\n     TITLE = {Asymptotic expansions of oscillatory integrals with complex\n              phase},\n BOOKTITLE = {Algorithmic probability and combinatorics},\n    SERIES = {Contemp. Math.},\n    VOLUME = {520},\n     PAGES = {221-240},\n PUBLISHER = {Amer. Math. Soc., Providence, RI},\n      YEAR = {2010},\n       keywords={ACSV theory},\n  url_Paper={https://arxiv.org/pdf/0903.3585.pdf},\n  abstract={We consider saddle point integrals in $d$ variables whose phase function\nis neither real nor purely imaginary. Results analogous to those for\nLaplace (real phase) and Fourier (imaginary phase) integrals hold\nwhenever the phase function is analytic and nondegenerate. These results\ngeneralize what is well known for integrals of Laplace and Fourier type.\nThe method is via contour shifting in complex $d$-space. This work is\nmotivated by applications to asymptotic enumeration.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider saddle point integrals in $d$ variables whose phase function is neither real nor purely imaginary. Results analogous to those for Laplace (real phase) and Fourier (imaginary phase) integrals hold whenever the phase function is analytic and nondegenerate. These results generalize what is well known for integrals of Laplace and Fourier type. The method is via contour shifting in complex $d$-space. This work is motivated by applications to asymptotic enumeration.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2009\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2009')\"\n      onkeypress=\"toggleGroup('group_2009')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2009</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"dinneen-gimelfarb-wilson-introductiontoalgorithmsdatastructuresandformallanguages-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Dinneen, M. J.; Gimel'farb, G. L.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dinneen-gimelfarb-wilson-introductiontoalgorithmsdatastructuresandformallanguages-2009', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event);\">\n    Introduction to Algorithms, Data Structures and Formal Languages.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  Pearson Education New Zealand,  2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('dinneen-gimelfarb-wilson-introductiontoalgorithmsdatastructuresandformallanguages-2009', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Introduction to Algorithms, Data Structures and Formal Languages [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dinneen-gimelfarb-wilson-introductiontoalgorithmsdatastructuresandformallanguages-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dinneen-gimelfarb-wilson-introductiontoalgorithmsdatastructuresandformallanguages-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@book{dinneen2009introduction,\n  title={Introduction to Algorithms, Data Structures and Formal Languages},\n  author={Dinneen, Michael J. and Gimel&#x27;farb, Georgi{\\u\\i} L&#x27;vovich and Wilson, Mark C.},\n  year={2009},\n  publisher={Pearson Education New Zealand},\n  keywords={algorithms, teaching},\n  url_Paper={},\n  abstract={}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"pritchard-wilson-asymptoticsoftheminimummanipulatingcoalitionsizeforpositionalvotingrulesunderimpartialculturebehaviour-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Pritchard, G.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/abs/pii/S0165489609000225\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'pritchard-wilson-asymptoticsoftheminimummanipulatingcoalitionsizeforpositionalvotingrulesunderimpartialculturebehaviour-2009', 'https://www.sciencedirect.com/science/article/abs/pii/S0165489609000225', event);\">\n    Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Mathematical Social Sciences</i>, 58(1): 35-57.  2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/abs/pii/S0165489609000225\"\n     onclick=\"log_download('pritchard-wilson-asymptoticsoftheminimummanipulatingcoalitionsizeforpositionalvotingrulesunderimpartialculturebehaviour-2009', 'https://www.sciencedirect.com/science/article/abs/pii/S0165489609000225', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pritchard-wilson-asymptoticsoftheminimummanipulatingcoalitionsizeforpositionalvotingrulesunderimpartialculturebehaviour-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pritchard-wilson-asymptoticsoftheminimummanipulatingcoalitionsizeforpositionalvotingrulesunderimpartialculturebehaviour-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{pritchard2009asymptotics,\n  title={Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour},\n  author={Pritchard, Geoffrey and Wilson, Mark C.},\n  journal={Mathematical Social Sciences},\n  volume={58},\n  number={1},\n  pages={35-57},\n  year={2009},\n  publisher={North-Holland},\n  keywords={social choice, voting, computation},\n  url_Paper={https://www.sciencedirect.com/science/article/abs/pii/S0165489609000225},\n  abstract={We consider the problem of manipulation of elections using positional\nvoting rules under Impartial Culture voter behaviour. We consider both\nthe logical possibility of coalitional manipulation, and the number of\nvoters that must be recruited to form a manipulating coalition. It is\nshown that the manipulation problem may be well approximated by a very\nsimple linear program in two variables. This permits a comparative\nanalysis of the asymptotic (large-population) manipulability of the\nvarious rules. It is seen that the manipulation resistance of positional\nrules with 5 or 6 (or more) candidates is quite different from the more\ncommonly analyzed 3- and 4-candidate cases.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the problem of manipulation of elections using positional voting rules under Impartial Culture voter behaviour. We consider both the logical possibility of coalitional manipulation, and the number of voters that must be recruited to form a manipulating coalition. It is shown that the manipulation problem may be well approximated by a very simple linear program in two variables. This permits a comparative analysis of the asymptotic (large-population) manipulability of the various rules. It is seen that the manipulation resistance of positional rules with 5 or 6 (or more) candidates is quite different from the more commonly analyzed 3- and 4-candidate cases.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-randomandexhaustivegenerationofpermutationsandcycles-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://link.springer.com/content/pdf/10.1007/s00026-009-0003-3.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-randomandexhaustivegenerationofpermutationsandcycles-2009', 'https://link.springer.com/content/pdf/10.1007/s00026-009-0003-3.pdf', event);\">\n    Random and exhaustive generation of permutations and cycles.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Annals of Combinatorics</i>, 12(4): 509-520.  2009.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://link.springer.com/content/pdf/10.1007/s00026-009-0003-3.pdf\"\n     onclick=\"log_download('wilson-randomandexhaustivegenerationofpermutationsandcycles-2009', 'https://link.springer.com/content/pdf/10.1007/s00026-009-0003-3.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Random and exhaustive generation of permutations and cycles [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-randomandexhaustivegenerationofpermutationsandcycles-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-randomandexhaustivegenerationofpermutationsandcycles-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson2009random,\n  title={Random and exhaustive generation of permutations and cycles},\n  author={Wilson, Mark C.},\n  journal={Annals of Combinatorics},\n  volume={12},\n  number={4},\n  pages={509-520},\n  year={2009},\n  publisher={SP Birkh{\\&quot;a}user Verlag Basel},\n  keywords={algorithms, combinatorics},\n  url_Paper={https://link.springer.com/content/pdf/10.1007/s00026-009-0003-3.pdf},\n  abstract={In 1986 S. Sattolo introduced a simple algorithm for uniform random\ngeneration of cyclic permutations on a fixed number of symbols. This\nalgorithm is very similar to the standard method for generating a random\npermutation, but is less well known. We consider both methods in a\nunified way, and discuss their relation with exhaustive generation\nmethods. We analyse several random variables associated with the\nalgorithms and find their grand probability generating functions, which\ngives easy access to moments and limit laws.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. This algorithm is very similar to the standard method for generating a random permutation, but is less well known. We consider both methods in a unified way, and discuss their relation with exhaustive generation methods. We analyse several random variables associated with the algorithms and find their grand probability generating functions, which gives easy access to moments and limit laws.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2008\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2008')\"\n      onkeypress=\"toggleGroup('group_2008')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2008</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"pemantle-wilson-twentycombinatorialexamplesofasymptoticsderivedfrommultivariategeneratingfunctions-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Pemantle, R.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://epubs.siam.org/doi/epdf/10.1137/050643866\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'pemantle-wilson-twentycombinatorialexamplesofasymptoticsderivedfrommultivariategeneratingfunctions-2008', 'https://epubs.siam.org/doi/epdf/10.1137/050643866', event);\">\n    Twenty combinatorial examples of asymptotics derived from multivariate generating functions.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>SIAM Review</i>, 50(2): 199-272.  2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://epubs.siam.org/doi/epdf/10.1137/050643866\"\n     onclick=\"log_download('pemantle-wilson-twentycombinatorialexamplesofasymptoticsderivedfrommultivariategeneratingfunctions-2008', 'https://epubs.siam.org/doi/epdf/10.1137/050643866', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Twenty combinatorial examples of asymptotics derived from multivariate generating functions [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pemantle-wilson-twentycombinatorialexamplesofasymptoticsderivedfrommultivariategeneratingfunctions-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pemantle-wilson-twentycombinatorialexamplesofasymptoticsderivedfrommultivariategeneratingfunctions-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{pemantle2008twenty,\n  title={Twenty combinatorial examples of asymptotics derived from multivariate generating functions},\n  author={Pemantle, Robin and Wilson, Mark C.},\n  journal={SIAM Review},\n  volume={50},\n  number={2},\n  pages={199-272},\n  year={2008},\n  publisher={Society for Industrial and Applied Mathematics},\n  keywords={ACSV theory},\n  url_Paper={https://epubs.siam.org/doi/epdf/10.1137/050643866},\n  abstract={Let $F$ be a power series in at least two variables that defines a\nmeromorphic function in a neighbourhood of the origin; for example, $F$\nmay be a rational multivariate generating function. We discuss recent\nresults that allow the effective computation of asymptotic expansions\nfor the coefficients of  $F$, uniform in certain explicitly defined\ncones of directions.\n\nThe purpose of this article is to illustrate the use of these techniques\non a variety of problems of combinatorial interest. The first part\nreviews the Morse-theoretic underpinnings of these techniques, and then\nsummarizes the necessary results so that only elementary analyses are\nneeded to check hypotheses and carry out computations. The remainder\nfocuses on combinatorial applications. Specific examples deal with\nenumeration of words with forbidden substrings, edges and cycles in\ngraphs, polyominoes, descents and solutions to integer equations. After\nthe individual examples, we discuss three broad classes of examples,\nnamely functions derived via the transfer matrix method, those derived\nvia the kernel method, and those derived via the method of Lagrange\ninversion. Generating functions derived in these three ways are amenable\nto our asymptotic analyses, and we state some further general results\nthat apply to these cases.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Let $F$ be a power series in at least two variables that defines a meromorphic function in a neighbourhood of the origin; for example, $F$ may be a rational multivariate generating function. We discuss recent results that allow the effective computation of asymptotic expansions for the coefficients of $F$, uniform in certain explicitly defined cones of directions. The purpose of this article is to illustrate the use of these techniques on a variety of problems of combinatorial interest. The first part reviews the Morse-theoretic underpinnings of these techniques, and then summarizes the necessary results so that only elementary analyses are needed to check hypotheses and carry out computations. The remainder focuses on combinatorial applications. Specific examples deal with enumeration of words with forbidden substrings, edges and cycles in graphs, polyominoes, descents and solutions to integer equations. After the individual examples, we discuss three broad classes of examples, namely functions derived via the transfer matrix method, those derived via the kernel method, and those derived via the method of Lagrange inversion. Generating functions derived in these three ways are amenable to our asymptotic analyses, and we state some further general results that apply to these cases.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"raichev-wilson-asymptoticsofcoefficientsofmultivariategeneratingfunctionsimprovementsforsmoothpoints-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Raichev, A.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r89/pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'raichev-wilson-asymptoticsofcoefficientsofmultivariategeneratingfunctionsimprovementsforsmoothpoints-2008', 'https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r89/pdf', event);\">\n    Asymptotics of coefficients of multivariate generating functions: improvements for smooth points.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Electronic Journal of Combinatorics</i>,R89-R89.  2008.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r89/pdf\"\n     onclick=\"log_download('raichev-wilson-asymptoticsofcoefficientsofmultivariategeneratingfunctionsimprovementsforsmoothpoints-2008', 'https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r89/pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Asymptotics of coefficients of multivariate generating functions: improvements for smooth points [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/raichev-wilson-asymptoticsofcoefficientsofmultivariategeneratingfunctionsimprovementsforsmoothpoints-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('raichev-wilson-asymptoticsofcoefficientsofmultivariategeneratingfunctionsimprovementsforsmoothpoints-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{raichev2008asymptotics,\n  title={Asymptotics of coefficients of multivariate generating functions: improvements for smooth points},\n  author={Raichev, Alexander and Wilson, Mark C.},\n  journal={Electronic Journal of Combinatorics},\n  pages={R89-R89},\n  year={2008},\n  keywords={ACSV theory},\n  url_Paper={https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r89/pdf},\n  abstract={Let $\\sum_{\\beta\\in\\mathbb{N}^d} F_\\beta x^\\beta$ be a multivariate\npower series, a generating function for a combinatorial class perhaps.\nAssume that in a neighborhood of the origin this series represents a\nnonentire function $F=G/H^p$ where $G$ and $H$ are holomorphic and $p$\nis a positive integer. Given a direction $\\alpha\\in\\mathbb{N}_+^d$ for\nwhich asymptotics are controlled by a smooth point of the singular\nvariety $H = 0$, we compute the asymptotics of $F_{n\\alpha}$ as\n$n\\to\\infty$. We do this via multivariate singularity analysis and give\nan explicit formula for the full asymptotic expansion. This improves on\nearlier work of R. Pemantle and the second author, and allows for much\nmore accurate numerical approximation, as demonstrated in our examples.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Let $∑_{β∈ℕ^d} F_β x^β$ be a multivariate power series, a generating function for a combinatorial class perhaps. Assume that in a neighborhood of the origin this series represents a nonentire function $F=G/H^p$ where $G$ and $H$ are holomorphic and $p$ is a positive integer. Given a direction $α∈ℕ_+^d$ for which asymptotics are controlled by a smooth point of the singular variety $H = 0$, we compute the asymptotics of $F_{nα}$ as $n\\to∞$. We do this via multivariate singularity analysis and give an explicit formula for the full asymptotic expansion. This improves on earlier work of R. Pemantle and the second author, and allows for much more accurate numerical approximation, as demonstrated in our examples.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2007\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2007')\"\n      onkeypress=\"toggleGroup('group_2007')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2007</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"raichev-wilson-anewmethodforcomputingasymptoticsofdiagonalcoefficientsofmultivariategeneratingfunctions-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Raichev, A.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://dmtcs.episciences.org/3531/pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'raichev-wilson-anewmethodforcomputingasymptoticsofdiagonalcoefficientsofmultivariategeneratingfunctions-2007', 'https://dmtcs.episciences.org/3531/pdf', event);\">\n    A new method for computing asymptotics of diagonal coefficients of multivariate generating functions.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2007 Conference on Analysis of Algorithms, AofA 07</i>, of <i>Discrete Math. Theor. Comput. Sci. Proc., AH</i>, pages 439-449,  2007. Assoc. Discrete Math. Theor. Comput. Sci., Nancy\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://dmtcs.episciences.org/3531/pdf\"\n     onclick=\"log_download('raichev-wilson-anewmethodforcomputingasymptoticsofdiagonalcoefficientsofmultivariategeneratingfunctions-2007', 'https://dmtcs.episciences.org/3531/pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A new method for computing asymptotics of diagonal coefficients of multivariate generating functions [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/raichev-wilson-anewmethodforcomputingasymptoticsofdiagonalcoefficientsofmultivariategeneratingfunctions-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('raichev-wilson-anewmethodforcomputingasymptoticsofdiagonalcoefficientsofmultivariategeneratingfunctions-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{RaWi2007,\n  author    = {Raichev, Alexander and Wilson, Mark C.},\n  booktitle = {2007 {C}onference on {A}nalysis of {A}lgorithms, {A}of{A} 07},\n  title     = {A new method for computing asymptotics of diagonal coefficients of multivariate generating functions},\n  pages     = {439-449},\n  publisher = {Assoc. Discrete Math. Theor. Comput. Sci., Nancy},\n  series    = {Discrete Math. Theor. Comput. Sci. Proc., AH},\n  abstract  = {Let $\\sum_{\\mathbf{n}\\in\\mathbb{N}^d} F_\\mathbf{n}\n\\mathbf{x}^\\mathbf{n}$ be a multivariate generating function that\nconverges in a neighborhood of the origin of $\\mathbb{C}^d$. We present\na new, multivariate method for computing the asymptotics of the diagonal\ncoefficients $F_{a_1n,\\ldots,a_dn}$ and show its superiority over the\nstandard, univariate diagonal method. Several examples are given in\ndetail.},\n  keywords  = {ACSV theory},\n  url_link  = {https://dmtcs.episciences.org/3531/pdf},\n  year      = {2007},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Let $∑_{\\mathbf{n}∈ℕ^d} F_\\mathbf{n} \\mathbf{x}^\\mathbf{n}$ be a multivariate generating function that converges in a neighborhood of the origin of $ℂ^d$. We present a new, multivariate method for computing the asymptotics of the diagonal coefficients $F_{a_1n,…,a_dn}$ and show its superiority over the standard, univariate diagonal method. Several examples are given in detail.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-pritchard-probabilitycalculationsundertheiachypothesis-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>;  and Pritchard, G.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/abs/pii/S0165489607000443\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-pritchard-probabilitycalculationsundertheiachypothesis-2007', 'https://www.sciencedirect.com/science/article/abs/pii/S0165489607000443', event);\">\n    Probability calculations under the IAC hypothesis.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Mathematical Social Sciences</i>, 54(3): 244-256.  2007.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/abs/pii/S0165489607000443\"\n     onclick=\"log_download('wilson-pritchard-probabilitycalculationsundertheiachypothesis-2007', 'https://www.sciencedirect.com/science/article/abs/pii/S0165489607000443', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Probability calculations under the IAC hypothesis [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-pritchard-probabilitycalculationsundertheiachypothesis-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-pritchard-probabilitycalculationsundertheiachypothesis-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson2007probability,\n  title={Probability calculations under the IAC hypothesis},\n  author={Wilson, Mark C. and Pritchard, Geoffrey},\n  journal={Mathematical Social Sciences},\n  volume={54},\n  number={3},\n  pages={244-256},\n  year={2007},\n  publisher={North-Holland},\n  keywords={social choice, voting, computation},\n  url_Paper={https://www.sciencedirect.com/science/article/abs/pii/S0165489607000443},\n  abstract={We show how powerful algorithms recently developed for counting lattice\npoints and computing volumes of convex polyhedra can be used to compute\nprobabilities of a wide variety of events of interest in social choice\ntheory. Several illustrative examples are given.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We show how powerful algorithms recently developed for counting lattice points and computing volumes of convex polyhedra can be used to compute probabilities of a wide variety of events of interest in social choice theory. Several illustrative examples are given.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"pritchard-wilson-exactresultsonmanipulabilityofpositionalvotingrules-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Pritchard, G.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://link.springer.com/content/pdf/10.1007/s00355-007-0216-5.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'pritchard-wilson-exactresultsonmanipulabilityofpositionalvotingrules-2007', 'https://link.springer.com/content/pdf/10.1007/s00355-007-0216-5.pdf', event);\">\n    Exact results on manipulability of positional voting rules.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Social Choice and Welfare</i>, 29(3): 487-513.  2007.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://link.springer.com/content/pdf/10.1007/s00355-007-0216-5.pdf\"\n     onclick=\"log_download('pritchard-wilson-exactresultsonmanipulabilityofpositionalvotingrules-2007', 'https://link.springer.com/content/pdf/10.1007/s00355-007-0216-5.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Exact results on manipulability of positional voting rules [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://link.springer.com/article/10.1007/s00355-007-0216-5\"\n     onclick=\"log_download('pritchard-wilson-exactresultsonmanipulabilityofpositionalvotingrules-2007', 'https://link.springer.com/article/10.1007/s00355-007-0216-5', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Exact results on manipulability of positional voting rules [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pritchard-wilson-exactresultsonmanipulabilityofpositionalvotingrules-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n  &nbsp;\n  <span class=\"bibbase_stats_paper\" style=\"color: #777;\">\n    <span>1 download</span>\n  </span>\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pritchard-wilson-exactresultsonmanipulabilityofpositionalvotingrules-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{pritchard2007exact,\n  title={Exact results on manipulability of positional voting rules},\n  author={Pritchard, Geoffrey and Wilson, Mark C.},\n  journal={Social Choice and Welfare},\n  volume={29},\n  number={3},\n  pages={487-513},\n  year={2007},\n  publisher={Springer-Verlag},\n  keywords={social choice, voting},\n  url_Paper={https://link.springer.com/content/pdf/10.1007/s00355-007-0216-5.pdf},\n  url_Link={https://link.springer.com/article/10.1007/s00355-007-0216-5},\n  abstract={We consider 3-candidate elections under a general scoring rule and\nderive precise conditions for a given voting situation to be\nstrategically manipulable by a given coalition of voters. We present an\nalgorithm that makes use of these conditions to compute the minimum size\n$M$ of a manipulating coalition for a given voting situation. The\nalgorithm works for any voter preference model - here we present\nnumerical results for IC and for IAC, for a selection of scoring rules,\nand for numbers of voters up to 150. A full description of the\ndistribution of $M$ is obtained, generalizing all previous work on the\ntopic. The results obtained show interesting phenomena and suggest\nseveral conjectures. In particular we see that rules {&#x60;&#x60;} between\nplurality and Borda{&quot;} behave very differently from those {&#x60;&#x60;} between\nBorda and antiplurality{&quot;}.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider 3-candidate elections under a general scoring rule and derive precise conditions for a given voting situation to be strategically manipulable by a given coalition of voters. We present an algorithm that makes use of these conditions to compute the minimum size $M$ of a manipulating coalition for a given voting situation. The algorithm works for any voter preference model - here we present numerical results for IC and for IAC, for a selection of scoring rules, and for numbers of voters up to 150. A full description of the distribution of $M$ is obtained, generalizing all previous work on the topic. The results obtained show interesting phenomena and suggest several conjectures. In particular we see that rules `` between plurality and Borda\" behave very differently from those `` between Borda and antiplurality\".\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2005\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2005')\"\n      onkeypress=\"toggleGroup('group_2005')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2005</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"wilson-asymptoticsforgeneralizedriordanarrays-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://dmtcs.episciences.org/3389/pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-asymptoticsforgeneralizedriordanarrays-2005', 'https://dmtcs.episciences.org/3389/pdf', event);\">\n    Asymptotics for generalized Riordan arrays.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>2005 International Conference on Analysis of Algorithms</i>, of <i>Discrete Math. Theor. Comput. Sci. Proc., AD</i>, pages 323-333 (electronic),  2005. Assoc. Discrete Math. Theor. Comput. Sci., Nancy\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://dmtcs.episciences.org/3389/pdf\"\n     onclick=\"log_download('wilson-asymptoticsforgeneralizedriordanarrays-2005', 'https://dmtcs.episciences.org/3389/pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Asymptotics for generalized Riordan arrays [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-asymptoticsforgeneralizedriordanarrays-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-asymptoticsforgeneralizedriordanarrays-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings {Wils2005,\n    AUTHOR = {Wilson, Mark C.},\n     TITLE = {Asymptotics for generalized {R}iordan arrays},\n BOOKTITLE = {2005 {I}nternational {C}onference on {A}nalysis of\n              {A}lgorithms},\n    SERIES = {Discrete Math. Theor. Comput. Sci. Proc., AD},\n     PAGES = {323-333 (electronic)},\n PUBLISHER = {Assoc. Discrete Math. Theor. Comput. Sci., Nancy},\n      YEAR = {2005},\n       keywords={ACSV theory},\n  url_Paper={https://dmtcs.episciences.org/3389/pdf},\n  abstract={The machinery of Riordan arrays has been used recently by several\nauthors. We show how meromorphic singularity analysis can be used to\nprovide uniform bivariate asymptotic expansions, in the central regime,\nfor a generalization of these arrays. We show how to do this\nsystematically, for various descriptions of the array. Several examples\nfrom recent literature are given.}\n }\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The machinery of Riordan arrays has been used recently by several authors. We show how meromorphic singularity analysis can be used to provide uniform bivariate asymptotic expansions, in the central regime, for a generalization of these arrays. We show how to do this systematically, for various descriptions of the array. Several examples from recent literature are given.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2004\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2004')\"\n      onkeypress=\"toggleGroup('group_2004')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2004</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"pemantle-wilson-asymptoticsofmultivariatesequencesiimultiplepointsofthesingularvariety-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Pemantle, R.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/asymptotics-of-multivariate-sequences-ii-multiple-points-of-the-singular-variety/F8B144EBED2754E43361A3BE4B0C3B01\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'pemantle-wilson-asymptoticsofmultivariatesequencesiimultiplepointsofthesingularvariety-2004', 'https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/asymptotics-of-multivariate-sequences-ii-multiple-points-of-the-singular-variety/F8B144EBED2754E43361A3BE4B0C3B01', event);\">\n    Asymptotics of multivariate sequences II: multiple points of the singular variety.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Combinatorics, Probability and Computing</i>, 13(4-5): 735-761.  2004.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/asymptotics-of-multivariate-sequences-ii-multiple-points-of-the-singular-variety/F8B144EBED2754E43361A3BE4B0C3B01\"\n     onclick=\"log_download('pemantle-wilson-asymptoticsofmultivariatesequencesiimultiplepointsofthesingularvariety-2004', 'https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/asymptotics-of-multivariate-sequences-ii-multiple-points-of-the-singular-variety/F8B144EBED2754E43361A3BE4B0C3B01', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Asymptotics of multivariate sequences II: multiple points of the singular variety [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pemantle-wilson-asymptoticsofmultivariatesequencesiimultiplepointsofthesingularvariety-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pemantle-wilson-asymptoticsofmultivariatesequencesiimultiplepointsofthesingularvariety-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{pemantle2004asymptotics,\n  title={Asymptotics of multivariate sequences II: multiple points of the singular variety},\n  author={Pemantle, Robin and Wilson, Mark C.},\n  journal={Combinatorics, Probability and Computing},\n  volume={13},\n  number={4-5},\n  pages={735-761},\n  year={2004},\n  publisher={Cambridge University Press},\n  keywords={ACSV theory},\n  url_Paper={https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/asymptotics-of-multivariate-sequences-ii-multiple-points-of-the-singular-variety/F8B144EBED2754E43361A3BE4B0C3B01},\n  abstract={Let $F(\\b{z})=\\sum_\\b{r} a_\\b{r}\\b{z^r}$ be a multivariate  generating\nfunction which is meromorphic in some neighborhood of the origin of\n$\\mathbb{C}^d$, and let $\\mathcal{V}$ be its set of singularities.\nEffective asymptotic expansions for the coefficients can be obtained by\ncomplex contour integration near points of $\\mathcal{V}$. In the first\narticle in this series, we treated the case of smooth points  of\n$\\mathcal{V}$. In this article we deal with multiple points of\n$\\mathcal{V}$. Our results show that the central limit\n(Ornstein-Zernike) behavior typical of the smooth case does not hold in\nthe multiple point case. For example, when $\\mathcal{V}$ has a multiple\npoint singularity at $(1 , \\ldots , 1)$, rather than $a_\\b{r}$ decaying\nas $|\\b{r}|^{-1/2}$ as $|\\b{r}| \\to \\infty$, $a_\\b{r}$ is very nearly\npolynomial in a cone of directions.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Let $F(\\b{z})=∑_\\b{r} a_\\b{r}\\b{z^r}$ be a multivariate generating function which is meromorphic in some neighborhood of the origin of $ℂ^d$, and let $\\mathcal{V}$ be its set of singularities. Effective asymptotic expansions for the coefficients can be obtained by complex contour integration near points of $\\mathcal{V}$. In the first article in this series, we treated the case of smooth points of $\\mathcal{V}$. In this article we deal with multiple points of $\\mathcal{V}$. Our results show that the central limit (Ornstein-Zernike) behavior typical of the smooth case does not hold in the multiple point case. For example, when $\\mathcal{V}$ has a multiple point singularity at $(1 , … , 1)$, rather than $a_\\b{r}$ decaying as $|\\b{r}|^{-1/2}$ as $|\\b{r}| \\to ∞$, $a_\\b{r}$ is very nearly polynomial in a cone of directions.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2002\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2002')\"\n      onkeypress=\"toggleGroup('group_2002')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2002</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"dinneen-pritchard-wilson-degreeandtimeconstrainedbroadcastnetworks-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Dinneen, M. J.; Pritchard, G.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drive.google.com/DPW2002.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dinneen-pritchard-wilson-degreeandtimeconstrainedbroadcastnetworks-2002', 'https://drive.google.com/DPW2002.pdf', event);\">\n    Degree-and time-constrained broadcast networks.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Networks</i>, 39(3): 121-129.  2002.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drive.google.com/DPW2002.pdf\"\n     onclick=\"log_download('dinneen-pritchard-wilson-degreeandtimeconstrainedbroadcastnetworks-2002', 'https://drive.google.com/DPW2002.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Degree-and time-constrained broadcast networks [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dinneen-pritchard-wilson-degreeandtimeconstrainedbroadcastnetworks-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dinneen-pritchard-wilson-degreeandtimeconstrainedbroadcastnetworks-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{dinneen2002degree,\n  title={Degree-and time-constrained broadcast networks},\n  author={Dinneen, Michael J. and Pritchard, Geoffrey and Wilson, Mark C.},\n  journal={Networks},\n  volume={39},\n  number={3},\n  pages={121-129},\n  year={2002},\n  publisher={Wiley},\n  keywords={combinatorics, algorithms, graphs},\n  url_Paper={DPW2002.pdf},\n  abstract={We consider the problem of constructing networks with as many nodes as\npossible, subject to upper bounds on the degree and broadcast time. The\npaper includes the results of an extensive empirical study of\nbroadcasting in small regular graphs using a stochastic search algorithm\nto approximate the broadcast time. Significant improvements on known\nresults are obtained for cubic broadcast networks.} \n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We consider the problem of constructing networks with as many nodes as possible, subject to upper bounds on the degree and broadcast time. The paper includes the results of an extensive empirical study of broadcasting in small regular graphs using a stochastic search algorithm to approximate the broadcast time. Significant improvements on known results are obtained for cubic broadcast networks.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"pemantle-wilson-asymptoticsofmultivariatesequencesismoothpointsofthesingularvariety-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Pemantle, R.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0097316501932017\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'pemantle-wilson-asymptoticsofmultivariatesequencesismoothpointsofthesingularvariety-2002', 'https://www.sciencedirect.com/science/article/pii/S0097316501932017', event);\">\n    Asymptotics of multivariate sequences: I. smooth points of the singular variety.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Journal of Combinatorial Theory, Series A</i>, 97(1): 129-161.  2002.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0097316501932017\"\n     onclick=\"log_download('pemantle-wilson-asymptoticsofmultivariatesequencesismoothpointsofthesingularvariety-2002', 'https://www.sciencedirect.com/science/article/pii/S0097316501932017', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Asymptotics of multivariate sequences: I. smooth points of the singular variety [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/pemantle-wilson-asymptoticsofmultivariatesequencesismoothpointsofthesingularvariety-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('pemantle-wilson-asymptoticsofmultivariatesequencesismoothpointsofthesingularvariety-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{pemantle2002asymptotics,\n  title={Asymptotics of multivariate sequences: I. smooth points of the singular variety},\n  author={Pemantle, Robin and Wilson, Mark C.},\n  journal={Journal of Combinatorial Theory, Series A},\n  volume={97},\n  number={1},\n  pages={129-161},\n  year={2002},\n  publisher={Academic Press},\n  keywords={ACSV theory},\n  url_Paper={https://www.sciencedirect.com/science/article/pii/S0097316501932017},\n  abstract={Given a multivariate generating function $F(z_1 , \\ldots , z_d) = \\sum\na_{r_1 , \\ldots , r_d} z_1^{r_1} \\cdots z_d^{r_d}$, we determine\nasymptotics for the coefficients. Our approach is to use Cauchy&#x27;s\nintegral formula near singular points of $F$, resulting in a tractable\noscillating integral. This paper treats the case where the singular\npoint of $F$ is a smooth point of a surface of poles. Companion papers G\ntreat singular points of $F$ where the local geometry is more\ncomplicated, and for which other methods of analysis are not known.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Given a multivariate generating function $F(z_1 , … , z_d) = ∑ a_{r_1 , … , r_d} z_1^{r_1} ⋯ z_d^{r_d}$, we determine asymptotics for the coefficients. Our approach is to use Cauchy's integral formula near singular points of $F$, resulting in a tractable oscillating integral. This paper treats the case where the singular point of $F$ is a smooth point of a surface of poles. Companion papers G treat singular points of $F$ where the local geometry is more complicated, and for which other methods of analysis are not known.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2000\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2000')\"\n      onkeypress=\"toggleGroup('group_2000')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2000</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"wilson-gracewood-easther-peet-elleray-somerville-submissiontothetertiaryeducationadvisorycommission-2000\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>; Gracewood, J.; Easther, R.; Peet, A.; Elleray, M.;  and Somerville, A.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-gracewood-easther-peet-elleray-somerville-submissiontothetertiaryeducationadvisorycommission-2000', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event);\">\n    Submission to the Tertiary Education Advisory Commission.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n   2000.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('wilson-gracewood-easther-peet-elleray-somerville-submissiontothetertiaryeducationadvisorycommission-2000', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Submission to the Tertiary Education Advisory Commission [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-gracewood-easther-peet-elleray-somerville-submissiontothetertiaryeducationadvisorycommission-2000\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-gracewood-easther-peet-elleray-somerville-submissiontothetertiaryeducationadvisorycommission-2000')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{wilson2000submission,\n  title={Submission to the Tertiary Education Advisory Commission},\n  author={Wilson, Mark C. and Gracewood, Jolisa and Easther, Richard and Peet, Amanda and \n  Elleray, Michelle and Somerville, A.T.},\n  year={2000},\n  keywords={advocacy},\n  url_Paper={},\n  abstract={}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1999\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1999')\"\n      onkeypress=\"toggleGroup('group_1999')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1999</span>\n      <span class=\"bibbase_group_count\">\n        \n        (6)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bergen-wilson-xinnerautomorphismsofsemicommutativequantumalgebras-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Bergen, J.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0021869399979279\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'bergen-wilson-xinnerautomorphismsofsemicommutativequantumalgebras-1999', 'https://www.sciencedirect.com/science/article/pii/S0021869399979279', event);\">\n    X-inner automorphisms of semi-commutative quantum algebras.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Journal of Algebra</i>, 220(1): 152-173.  1999.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0021869399979279\"\n     onclick=\"log_download('bergen-wilson-xinnerautomorphismsofsemicommutativequantumalgebras-1999', 'https://www.sciencedirect.com/science/article/pii/S0021869399979279', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"X-inner automorphisms of semi-commutative quantum algebras [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bergen-wilson-xinnerautomorphismsofsemicommutativequantumalgebras-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bergen-wilson-xinnerautomorphismsofsemicommutativequantumalgebras-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{bergen1999x,\n  title={X-inner automorphisms of semi-commutative quantum algebras},\n  author={Bergen, Jeffrey and Wilson, Mark C.},\n  journal={Journal of Algebra},\n  volume={220},\n  number={1},\n  pages={152-173},\n  year={1999},\n  publisher={Academic Press},\n  keywords={algebra},\n  url_Paper={https://www.sciencedirect.com/science/article/pii/S0021869399979279},\n  abstract={Many important quantum algebras such as quantum symplectic space,\nquantum euclidean space, quantum matrices, $q$-analogs of the Heisenberg\nalgebra and the quantum Weyl algebra are semi-commutative. In addition,\nenveloping algebras $U(L_+)$ of even Lie color algebras are also\nsemi-commutative. In this paper, we generalize work of Montgomery and\nexamine the X-inner automorphisms of such algebras. The theorems and\nexamples in our paper show that for algebras $R$ of this type, the\nnon-identity X-inner automorphisms of  $R$ tend to have infinite order.\nThus if $G$ is a finite group of automorphisms of $R$, then the action\nof $G$ will be X-outer and this immediately gives useful information\nabout crossed products  $R∗_t G$.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Many important quantum algebras such as quantum symplectic space, quantum euclidean space, quantum matrices, $q$-analogs of the Heisenberg algebra and the quantum Weyl algebra are semi-commutative. In addition, enveloping algebras $U(L_+)$ of even Lie color algebras are also semi-commutative. In this paper, we generalize work of Montgomery and examine the X-inner automorphisms of such algebras. The theorems and examples in our paper show that for algebras $R$ of this type, the non-identity X-inner automorphisms of $R$ tend to have infinite order. Thus if $G$ is a finite group of automorphisms of $R$, then the action of $G$ will be X-outer and this immediately gives useful information about crossed products $R∗_t G$.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"riley-wilson-associativealgebrassatisfyingasemigroupidentity-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Riley, D.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.cambridge.org/core/journals/glasgow-mathematical-journal/article/associative-algebras-satisfying-a-semigroup-identity/89A9FE38678C0635AE59E0B3286291CA\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'riley-wilson-associativealgebrassatisfyingasemigroupidentity-1999', 'https://www.cambridge.org/core/journals/glasgow-mathematical-journal/article/associative-algebras-satisfying-a-semigroup-identity/89A9FE38678C0635AE59E0B3286291CA', event);\">\n    Associative algebras satisfying a semigroup identity.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Glasgow Mathematical Journal</i>, 41(3): 453-462.  1999.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.cambridge.org/core/journals/glasgow-mathematical-journal/article/associative-algebras-satisfying-a-semigroup-identity/89A9FE38678C0635AE59E0B3286291CA\"\n     onclick=\"log_download('riley-wilson-associativealgebrassatisfyingasemigroupidentity-1999', 'https://www.cambridge.org/core/journals/glasgow-mathematical-journal/article/associative-algebras-satisfying-a-semigroup-identity/89A9FE38678C0635AE59E0B3286291CA', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Associative algebras satisfying a semigroup identity [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/riley-wilson-associativealgebrassatisfyingasemigroupidentity-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('riley-wilson-associativealgebrassatisfyingasemigroupidentity-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{riley1999associative,\n  title={Associative algebras satisfying a semigroup identity},\n  author={Riley, D.M. and Wilson, Mark C.},\n  journal={Glasgow Mathematical Journal},\n  volume={41},\n  number={3},\n  pages={453-462},\n  year={1999},\n  publisher={Cambridge University Press},\n  keywords={algebra},\n  url_Paper={https://www.cambridge.org/core/journals/glasgow-mathematical-journal/article/associative-algebras-satisfying-a-semigroup-identity/89A9FE38678C0635AE59E0B3286291CA},\n  abstract={Denote by $(R,\\cdot)$ the multiplicative semigroup of an associative\nalgebra $R$ over an infinite field, and let $(R,\\circ)$ represent $R$\nwhen viewed as a semigroup via the circle operation $x\\circ y=x+y+xy$.\nIn this paper we characterize the existence of an identity in these\nsemigroups in terms of the Lie structure of $R$. Namely, we prove that\nthe following conditions on $R$ are equivalent: the semigroup\n$(R,\\circ)$ satisfies an identity; the semigroup $(R,\\cdot)$ satisfies a\nreduced identity; and, the associated Lie algebra of $R$ satisfies the\nEngel condition. When $R$ is finitely generated these conditions are\neach equivalent to $R$ being upper Lie nilpotent.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Denote by $(R,·)$ the multiplicative semigroup of an associative algebra $R$ over an infinite field, and let $(R,∘)$ represent $R$ when viewed as a semigroup via the circle operation $x∘ y=x+y+xy$. In this paper we characterize the existence of an identity in these semigroups in terms of the Lie structure of $R$. Namely, we prove that the following conditions on $R$ are equivalent: the semigroup $(R,∘)$ satisfies an identity; the semigroup $(R,·)$ satisfies a reduced identity; and, the associated Lie algebra of $R$ satisfies the Engel condition. When $R$ is finitely generated these conditions are each equivalent to $R$ being upper Lie nilpotent.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dinneen-ventura-wilson-zakeri-constructionoftimerelaxedminimalbroadcastnetworks-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Dinneen, M. J.; Ventura, J. A.; <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>;  and Zakeri, G.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.worldscientific.com/doi/abs/10.1142/S0129626499000086\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dinneen-ventura-wilson-zakeri-constructionoftimerelaxedminimalbroadcastnetworks-1999', 'https://www.worldscientific.com/doi/abs/10.1142/S0129626499000086', event);\">\n    Construction of time-relaxed minimal broadcast networks.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Parallel Processing Letters</i>, 9(01): 53-68.  1999.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.worldscientific.com/doi/abs/10.1142/S0129626499000086\"\n     onclick=\"log_download('dinneen-ventura-wilson-zakeri-constructionoftimerelaxedminimalbroadcastnetworks-1999', 'https://www.worldscientific.com/doi/abs/10.1142/S0129626499000086', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Construction of time-relaxed minimal broadcast networks [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dinneen-ventura-wilson-zakeri-constructionoftimerelaxedminimalbroadcastnetworks-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dinneen-ventura-wilson-zakeri-constructionoftimerelaxedminimalbroadcastnetworks-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{dinneen1999construction,\n  title={Construction of time-relaxed minimal broadcast networks},\n  author={Dinneen, Michael J. and Ventura, Jose A. and Wilson, Mark C. and Zakeri, Golbon},\n  journal={Parallel Processing Letters},\n  volume={9},\n  number={01},\n  pages={53-68},\n  year={1999},\n  publisher={World Scientific Publishing Company},\n  keywords={algorithms, combinatorics, graphs},\n  url_Paper={https://www.worldscientific.com/doi/abs/10.1142/S0129626499000086},\n  abstract={In broadcasting, or one-to-all communication, a message originally held\nin one node of the network must be transmitted to all the other nodes. A\nminimal broadcast network is a communication network that can transmit a\nmessage originated at any node to all other nodes of the network in\nminimum time. In this paper, we present a compound method to construct\nsparse, time-relaxed, minimal broadcast networks ( $t$-mbn), in which\nbroadcasting can be accomplished in slightly more than the minimum time.\nThe proposed method generates a new network by connecting a subset of\nnodes from several copies of a $t_1$-mbn using the structure of another\n$t_2$-mbn. The objective is to construct a network as sparse as possible\nsatisfying the desired broadcasting time constraint. Computational\nresults illustrate the effectiveness of the proposed method.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In broadcasting, or one-to-all communication, a message originally held in one node of the network must be transmitted to all the other nodes. A minimal broadcast network is a communication network that can transmit a message originated at any node to all other nodes of the network in minimum time. In this paper, we present a compound method to construct sparse, time-relaxed, minimal broadcast networks ( $t$-mbn), in which broadcasting can be accomplished in slightly more than the minimum time. The proposed method generates a new network by connecting a subset of nodes from several copies of a $t_1$-mbn using the structure of another $t_2$-mbn. The objective is to construct a network as sparse as possible satisfying the desired broadcasting time constraint. Computational results illustrate the effectiveness of the proposed method.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"riley-wilson-groupalgebrasandenvelopingalgebraswithnonmatrixandsemigroupidentities-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Riley, D.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.tandfonline.com/doi/abs/10.1080/00927879908826645\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'riley-wilson-groupalgebrasandenvelopingalgebraswithnonmatrixandsemigroupidentities-1999', 'https://www.tandfonline.com/doi/abs/10.1080/00927879908826645', event);\">\n    Group algebras and enveloping algebras with nonmatrix and semigroup identities.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Communications in Algebra</i>, 27(7): 3545-3556.  1999.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.tandfonline.com/doi/abs/10.1080/00927879908826645\"\n     onclick=\"log_download('riley-wilson-groupalgebrasandenvelopingalgebraswithnonmatrixandsemigroupidentities-1999', 'https://www.tandfonline.com/doi/abs/10.1080/00927879908826645', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Group algebras and enveloping algebras with nonmatrix and semigroup identities [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/riley-wilson-groupalgebrasandenvelopingalgebraswithnonmatrixandsemigroupidentities-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('riley-wilson-groupalgebrasandenvelopingalgebraswithnonmatrixandsemigroupidentities-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{riley1999group,\n  title={Group algebras and enveloping algebras with nonmatrix and semigroup identities},\n  author={Riley, D.M. and Wilson, Mark C.},\n  journal={Communications in Algebra},\n  volume={27},\n  number={7},\n  pages={3545-3556},\n  year={1999},\n  publisher={Taylor \\&amp; Francis},\n  keywords={algebra},\n  url_Paper={https://www.tandfonline.com/doi/abs/10.1080/00927879908826645},\n  abstract={Let $K$ be a field of characteristic $p&gt;0$.  Denote by $\\omega(R)$ the\naugmentation ideal of either a group algebra $R=K[G]$ or a restricted\nenveloping algebra $R=u(L)$ over $K$.   We first characterize those $R$\nfor which $\\omega(R)$ satisfies a polynomial identity not satisfied by\nthe algebra of all $2\\times 2$ matrices over $K$. Then, we examine those\n$R$ for which $\\omega(R)$ satisfies a semigroup identity (that is, a\npolynomial identity which can be written as the difference of two\nmonomials).}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Let $K$ be a field of characteristic $p>0$. Denote by $ω(R)$ the augmentation ideal of either a group algebra $R=K[G]$ or a restricted enveloping algebra $R=u(L)$ over $K$. We first characterize those $R$ for which $ω(R)$ satisfies a polynomial identity not satisfied by the algebra of all $2× 2$ matrices over $K$. Then, we examine those $R$ for which $ω(R)$ satisfies a semigroup identity (that is, a polynomial identity which can be written as the difference of two monomials).\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"riley-wilson-associativeringssatisfyingtheengelcondition-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Riley, D.;  and <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.ams.org/journals/proc/1999-127-04/S0002-9939-99-04643-2/S0002-9939-99-04643-2.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'riley-wilson-associativeringssatisfyingtheengelcondition-1999', 'https://www.ams.org/journals/proc/1999-127-04/S0002-9939-99-04643-2/S0002-9939-99-04643-2.pdf', event);\">\n    Associative rings satisfying the Engel condition.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Proceedings of the American Mathematical Society</i>, 127(4): 973-976.  1999.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.ams.org/journals/proc/1999-127-04/S0002-9939-99-04643-2/S0002-9939-99-04643-2.pdf\"\n     onclick=\"log_download('riley-wilson-associativeringssatisfyingtheengelcondition-1999', 'https://www.ams.org/journals/proc/1999-127-04/S0002-9939-99-04643-2/S0002-9939-99-04643-2.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Associative rings satisfying the Engel condition [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/riley-wilson-associativeringssatisfyingtheengelcondition-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('riley-wilson-associativeringssatisfyingtheengelcondition-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{riley1999associative,\n  title={Associative rings satisfying the Engel condition},\n  author={Riley, D.M. and Wilson, Mark C.},\n  journal={Proceedings of the American Mathematical Society},\n  volume={127},\n  number={4},\n  pages={973-976},\n  year={1999},\n  keywords={algebra},\n  url_Paper={https://www.ams.org/journals/proc/1999-127-04/S0002-9939-99-04643-2/S0002-9939-99-04643-2.pdf},\n  abstract={Let $C$ be a commutative ring, and let $R$ be an associative $C$-algebra\ngenerated by elements $\\{x_1,\\ldots,x_d\\}$. We show that if $R$\nsatisfies the Engel condition of degree $n$ then $R$ is upper Lie\nnilpotent of class bounded by a function that depends only on $d$ and\n$n$. We deduce that the Engel condition in an arbitrary associative ring\nis inherited by its group of units, and implies a semigroup identity.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Let $C$ be a commutative ring, and let $R$ be an associative $C$-algebra generated by elements $\\{x_1,…,x_d\\}$. We show that if $R$ satisfies the Engel condition of degree $n$ then $R$ is upper Lie nilpotent of class bounded by a function that depends only on $d$ and $n$. We deduce that the Engel condition in an arbitrary associative ring is inherited by its group of units, and implies a semigroup identity.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"dinneen-ventura-wilson-zakeri-compoundconstructionsofbroadcastnetworks-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  Dinneen, M. J.; Ventura, J. A.; <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>;  and Zakeri, G.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0166218X99000438\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'dinneen-ventura-wilson-zakeri-compoundconstructionsofbroadcastnetworks-1999', 'https://www.sciencedirect.com/science/article/pii/S0166218X99000438', event);\">\n    Compound constructions of broadcast networks.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Discrete Applied Mathematics</i>, 93(2-3): 205-232.  1999.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0166218X99000438\"\n     onclick=\"log_download('dinneen-ventura-wilson-zakeri-compoundconstructionsofbroadcastnetworks-1999', 'https://www.sciencedirect.com/science/article/pii/S0166218X99000438', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Compound constructions of broadcast networks [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/dinneen-ventura-wilson-zakeri-compoundconstructionsofbroadcastnetworks-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('dinneen-ventura-wilson-zakeri-compoundconstructionsofbroadcastnetworks-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{dinneen1999compound,\n  title={Compound constructions of broadcast networks},\n  author={Dinneen, Michael J. and Ventura, Jose A. and Wilson, Mark C. and Zakeri, Golbon},\n  journal={Discrete Applied Mathematics},\n  volume={93},\n  number={2-3},\n  pages={205-232},\n  year={1999},\n  publisher={North-Holland},\n  keywords={algorithms, combinatorics, graphs},\n  url_Paper={https://www.sciencedirect.com/science/article/pii/S0166218X99000438},\n  abstract={Compound methods have been shown to be very effective in the\nconstruction of minimal broadcast networks (mbns). Compound methods\ngenerate a large mbn by combining multiple copies of an mbn $G$ using\nthe structure of another mbn $H$. Node deletion is also allowed in some\nof these methods. The subset of connecting nodes of $G$ has been defined\nas solid  $h$-cover by Bermond, Fraigniaud and Peters, and center node\nset by Weng and Ventura. This article shows that the two concepts are\nequivalent. We also provide new properties for center node sets,\nincluding bounds on the minimum size of a center node set, show how to\nreduce the number of center nodes of an mbn generated by a compound\nmethod, and propose an iterative compounding algorithm that generates\nthe sparsest known mbns in many cases.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Compound methods have been shown to be very effective in the construction of minimal broadcast networks (mbns). Compound methods generate a large mbn by combining multiple copies of an mbn $G$ using the structure of another mbn $H$. Node deletion is also allowed in some of these methods. The subset of connecting nodes of $G$ has been defined as solid $h$-cover by Bermond, Fraigniaud and Peters, and center node set by Weng and Ventura. This article shows that the two concepts are equivalent. We also provide new properties for center node sets, including bounds on the minimum size of a center node set, show how to reduce the number of center nodes of an mbn generated by a compound method, and propose an iterative compounding algorithm that generates the sparsest known mbns in many cases.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1998\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1998')\"\n      onkeypress=\"toggleGroup('group_1998')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1998</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"wilson-primitiveidealsinhopfalgebraextensions-1998\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/pdf/math/9808122.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-primitiveidealsinhopfalgebraextensions-1998', 'https://arxiv.org/pdf/math/9808122.pdf', event);\">\n    Primitive ideals in Hopf algebra extensions.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>arXiv preprint math/9808122</i>.  1998.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/pdf/math/9808122.pdf\"\n     onclick=\"log_download('wilson-primitiveidealsinhopfalgebraextensions-1998', 'https://arxiv.org/pdf/math/9808122.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Primitive ideals in Hopf algebra extensions [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-primitiveidealsinhopfalgebraextensions-1998\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-primitiveidealsinhopfalgebraextensions-1998')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson1998primitive,\n  title={Primitive ideals in Hopf algebra extensions},\n  author={Wilson, Mark C.},\n  journal={arXiv preprint math/9808122},\n  year={1998},\n  keywords={algebra},\n  url_Paper={https://arxiv.org/pdf/math/9808122.pdf},\n  abstract={My last paper in algebra, never published formally.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  My last paper in algebra, never published formally.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-bellsprimenesscriterionandthesimpleliesuperalgebras-1998\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0022404997001990\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-bellsprimenesscriterionandthesimpleliesuperalgebras-1998', 'https://www.sciencedirect.com/science/article/pii/S0022404997001990', event);\">\n    Bell's primeness criterion and the simple Lie superalgebras.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Journal of Pure and Applied Algebra</i>, 133(1-2): 241-260.  1998.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0022404997001990\"\n     onclick=\"log_download('wilson-bellsprimenesscriterionandthesimpleliesuperalgebras-1998', 'https://www.sciencedirect.com/science/article/pii/S0022404997001990', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Bell&#x27;s primeness criterion and the simple Lie superalgebras [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-bellsprimenesscriterionandthesimpleliesuperalgebras-1998\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-bellsprimenesscriterionandthesimpleliesuperalgebras-1998')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson1998bell,\n  title={Bell&#x27;s primeness criterion and the simple Lie superalgebras},\n  author={Wilson, Mark C.},\n  journal={Journal of Pure and Applied Algebra},\n  volume={133},\n  number={1-2},\n  pages={241-260},\n  year={1998},\n  publisher={North-Holland},\n  keywords={algebra},\n  url_Paper={https://www.sciencedirect.com/science/article/pii/S0022404997001990},\n  abstract={We determine all finite-dimensional simple Lie superalgebras $L$ such\nthat $U(L)$ satisfies a primeness criterion due to Bell. Some open\nproblems related to primeness of enveloping algebras are listed.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We determine all finite-dimensional simple Lie superalgebras $L$ such that $U(L)$ satisfies a primeness criterion due to Bell. Some open problems related to primeness of enveloping algebras are listed.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-pritchard-primenessoftheenvelopingalgebraofthespecialliesuperalgebras-1998\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>;  and Pritchard, G.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://link.springer.com/article/10.1007/s000130050183\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-pritchard-primenessoftheenvelopingalgebraofthespecialliesuperalgebras-1998', 'https://link.springer.com/article/10.1007/s000130050183', event);\">\n    Primeness of the enveloping algebra of the special Lie superalgebras.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Archiv der Mathematik</i>, 70(3): 187-196.  1998.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://link.springer.com/article/10.1007/s000130050183\"\n     onclick=\"log_download('wilson-pritchard-primenessoftheenvelopingalgebraofthespecialliesuperalgebras-1998', 'https://link.springer.com/article/10.1007/s000130050183', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Primeness of the enveloping algebra of the special Lie superalgebras [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-pritchard-primenessoftheenvelopingalgebraofthespecialliesuperalgebras-1998\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-pritchard-primenessoftheenvelopingalgebraofthespecialliesuperalgebras-1998')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson1998primeness,\n  title={Primeness of the enveloping algebra of the special Lie superalgebras},\n  author={Wilson, Mark C. and Pritchard, Geoffrey},\n  journal={Archiv der Mathematik},\n  volume={70},\n  number={3},\n  pages={187-196},\n  year={1998},\n  publisher={Birkh{\\&quot;a}user Verlag},\n  keywords={algebra},\n  url_Paper={https://link.springer.com/article/10.1007/s000130050183},\n  abstract={A primeness criterion due to Bell is shown to apply to the universal\nenveloping algebra of the Cartan type Lie superalgebras $S(V)$ and\n$\\widetilde{S}(V;t)$ when $\\dim V$ is even. On the other hand, if $\\dim\nV$ is odd then $U(S(V))$ is never semiprime.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A primeness criterion due to Bell is shown to apply to the universal enveloping algebra of the Cartan type Lie superalgebras $S(V)$ and $\\widetilde{S}(V;t)$ when $\\dim V$ is even. On the other hand, if $\\dim V$ is odd then $U(S(V))$ is never semiprime.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1997\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1997')\"\n      onkeypress=\"toggleGroup('group_1997')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1997</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"wilson-crossedproductsofrestrictedenvelopingalgebras-1997\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.tandfonline.com/doi/abs/10.1080/00927879708825868\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-crossedproductsofrestrictedenvelopingalgebras-1997', 'https://www.tandfonline.com/doi/abs/10.1080/00927879708825868', event);\">\n    Crossed products of restricted enveloping algebras.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Communications in Algebra</i>, 25(2): 487-496.  1997.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.tandfonline.com/doi/abs/10.1080/00927879708825868\"\n     onclick=\"log_download('wilson-crossedproductsofrestrictedenvelopingalgebras-1997', 'https://www.tandfonline.com/doi/abs/10.1080/00927879708825868', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Crossed products of restricted enveloping algebras [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-crossedproductsofrestrictedenvelopingalgebras-1997\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-crossedproductsofrestrictedenvelopingalgebras-1997')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson1997crossed,\n  title={Crossed products of restricted enveloping algebras},\n  author={Wilson, Mark C.},\n  journal={Communications in Algebra},\n  volume={25},\n  number={2},\n  pages={487-496},\n  year={1997},\n  publisher={Taylor \\&amp; Francis},\n  keywords={algebra},\n  url_Paper={https://www.tandfonline.com/doi/abs/10.1080/00927879708825868},\n  abstract={Let $K$ be a field of characteristic $p&gt;0$, let $L$ be a restricted Lie\nalgebra and let $R$ be an associative $K$-algebra. It is shown that the\nvarious constructions in the literature of crossed product of  $R$ with\n$u(L)$ are equivalent. We calculate explicit formulae relating the\nparameters involved and obtain a formula which hints at a noncommutative\nversion of the Bell polynomials.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Let $K$ be a field of characteristic $p>0$, let $L$ be a restricted Lie algebra and let $R$ be an associative $K$-algebra. It is shown that the various constructions in the literature of crossed product of $R$ with $u(L)$ are equivalent. We calculate explicit formulae relating the parameters involved and obtain a formula which hints at a noncommutative version of the Bell polynomials.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-pritchard-wood-bellsprimenesscriterionforw2n1-1997\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>; Pritchard, G.;  and Wood, D. H.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://doi.org/10.1080/10586458.1997.10504352\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-pritchard-wood-bellsprimenesscriterionforw2n1-1997', 'https://doi.org/10.1080/10586458.1997.10504352', event);\">\n    Bell's primeness criterion for $W(2n+ 1)$.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Experimental Mathematics</i>, 6(1): 77-85.  1997.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://doi.org/10.1080/10586458.1997.10504352\"\n     onclick=\"log_download('wilson-pritchard-wood-bellsprimenesscriterionforw2n1-1997', 'https://doi.org/10.1080/10586458.1997.10504352', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Bell&#x27;s primeness criterion for $W(2n+ 1)$ [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-pritchard-wood-bellsprimenesscriterionforw2n1-1997\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-pritchard-wood-bellsprimenesscriterionforw2n1-1997')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson1997bell,\n  title={Bell&#x27;s primeness criterion for $W(2n+ 1)$},\n  author={Wilson, Mark C. and Pritchard, Geoffrey and Wood, David H.},\n  journal={Experimental Mathematics},\n  volume={6},\n  number={1},\n  pages={77-85},\n  year={1997},\n  publisher={Taylor \\&amp; Francis Group},\n  keywords={algebra},\n  url_Paper={https://doi.org/10.1080/10586458.1997.10504352},\n  abstract={On the basis of experimental work involving matrix computations, we\nconjecture that a criterion due to Bell for primeness of the universal\nenveloping algebra of a Lie superalgebra applies to the Cartan type Lie\nsuperalgebras $W(n)$ for $n=3$ but does not apply for odd $n\\geq 5$. The\nexperiments lead to a rigorous proof, which we present.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  On the basis of experimental work involving matrix computations, we conjecture that a criterion due to Bell for primeness of the universal enveloping algebra of a Lie superalgebra applies to the Cartan type Lie superalgebras $W(n)$ for $n=3$ but does not apply for odd $n≥ 5$. The experiments lead to a rigorous proof, which we present.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wilson-primenessoftheenvelopingalgebraofhamiltoniansuperalgebras-1997\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.cambridge.org/core/journals/bulletin-of-the-australian-mathematical-society/article/primeness-of-the-enveloping-algebra-of-hamiltonian-superalgebras/A643AA62E4FAC8098924C1DE44E463C8\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-primenessoftheenvelopingalgebraofhamiltoniansuperalgebras-1997', 'https://www.cambridge.org/core/journals/bulletin-of-the-australian-mathematical-society/article/primeness-of-the-enveloping-algebra-of-hamiltonian-superalgebras/A643AA62E4FAC8098924C1DE44E463C8', event);\">\n    Primeness of the enveloping algebra of Hamiltonian superalgebras.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Bulletin of the Australian Mathematical Society</i>, 56(3): 483-488.  1997.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.cambridge.org/core/journals/bulletin-of-the-australian-mathematical-society/article/primeness-of-the-enveloping-algebra-of-hamiltonian-superalgebras/A643AA62E4FAC8098924C1DE44E463C8\"\n     onclick=\"log_download('wilson-primenessoftheenvelopingalgebraofhamiltoniansuperalgebras-1997', 'https://www.cambridge.org/core/journals/bulletin-of-the-australian-mathematical-society/article/primeness-of-the-enveloping-algebra-of-hamiltonian-superalgebras/A643AA62E4FAC8098924C1DE44E463C8', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Primeness of the enveloping algebra of Hamiltonian superalgebras [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-primenessoftheenvelopingalgebraofhamiltoniansuperalgebras-1997\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-primenessoftheenvelopingalgebraofhamiltoniansuperalgebras-1997')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson1997primeness,\n  title={Primeness of the enveloping algebra of Hamiltonian superalgebras},\n  author={Wilson, Mark C.},\n  journal={Bulletin of the Australian Mathematical Society},\n  volume={56},\n  number={3},\n  pages={483-488},\n  year={1997},\n  publisher={Cambridge University Press},\n  keywords={algebra},\n  url_Paper={https://www.cambridge.org/core/journals/bulletin-of-the-australian-mathematical-society/article/primeness-of-the-enveloping-algebra-of-hamiltonian-superalgebras/A643AA62E4FAC8098924C1DE44E463C8},\n  abstract={In 1990 Allen Bell presented a sufficient condition for the primeness of\nthe universal enveloping algebra of a Lie superalgebra. Let $Q$ be a\nnonsingular bilinear form on a finite-dimensional vector space over a\nfield of characteristic zero. In this paper we show that Bell&#x27;s\ncriterion applies to the Hamiltonian Cartan type superalgebras\ndetermined by $Q$, and hence obtain some new prime noetherian rings.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In 1990 Allen Bell presented a sufficient condition for the primeness of the universal enveloping algebra of a Lie superalgebra. Let $Q$ be a nonsingular bilinear form on a finite-dimensional vector space over a field of characteristic zero. In this paper we show that Bell's criterion applies to the Hamiltonian Cartan type superalgebras determined by $Q$, and hence obtain some new prime noetherian rings.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1996\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1996')\"\n      onkeypress=\"toggleGroup('group_1996')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1996</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"wilson-primenessoftheenvelopingalgebraofacartantypeliesuperalgebra-1996\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-primenessoftheenvelopingalgebraofacartantypeliesuperalgebra-1996', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event);\">\n    Primeness of the enveloping algebra of a Cartan type Lie superalgebra.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Proceedings of the American Mathematical Society</i>, 124(2): 383-387.  1996.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF\"\n     onclick=\"log_download('wilson-primenessoftheenvelopingalgebraofacartantypeliesuperalgebra-1996', 'https://drive.google.com/uc?export=download&amp;id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Primeness of the enveloping algebra of a Cartan type Lie superalgebra [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-primenessoftheenvelopingalgebraofacartantypeliesuperalgebra-1996\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-primenessoftheenvelopingalgebraofacartantypeliesuperalgebra-1996')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson1996primeness,\n  title={Primeness of the enveloping algebra of a Cartan type Lie superalgebra},\n  author={Wilson, Mark C.},\n  journal={Proceedings of the American Mathematical Society},\n  volume={124},\n  number={2},\n  pages={383-387},\n  year={1996},\n  keywords={algebra},\n  url_Paper={},\n  abstract={We show that a primeness criterion for enveloping algebras of Lie\nsuperalgebras discovered by Bell is applicable to the Cartan type Lie\nsuperalgebras $W(n)$, $n$ even. Other algebras are considered but there\nare no definitive answers in these cases.}\n}\n\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We show that a primeness criterion for enveloping algebras of Lie superalgebras discovered by Bell is applicable to the Cartan type Lie superalgebras $W(n)$, $n$ even. Other algebras are considered but there are no definitive answers in these cases.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1995\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1995')\"\n      onkeypress=\"toggleGroup('group_1995')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1995</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"wilson-deltamethodsinenvelopingalgebrasofliecoloralgebras-1995\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://markcwilson.site/Research/social_choice/index.html\">Wilson, M. C.</a>\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0021869385712070\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'wilson-deltamethodsinenvelopingalgebrasofliecoloralgebras-1995', 'https://www.sciencedirect.com/science/article/pii/S0021869385712070', event);\">\n    Delta methods in enveloping algebras of Lie color algebras.\n  </a>\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>Journal of Algebra</i>, 175(2): 661-696.  1995.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.sciencedirect.com/science/article/pii/S0021869385712070\"\n     onclick=\"log_download('wilson-deltamethodsinenvelopingalgebrasofliecoloralgebras-1995', 'https://www.sciencedirect.com/science/article/pii/S0021869385712070', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Delta methods in enveloping algebras of Lie color algebras [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wilson-deltamethodsinenvelopingalgebrasofliecoloralgebras-1995\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wilson-deltamethodsinenvelopingalgebrasofliecoloralgebras-1995')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{wilson1995delta,\n  title={Delta methods in enveloping algebras of Lie color algebras},\n  author={Wilson, Mark C.},\n  journal={Journal of Algebra},\n  volume={175},\n  number={2},\n  pages={661-696},\n  year={1995},\n  publisher={Academic Press},\n  keywords={algebra},\n  url_Paper={https://www.sciencedirect.com/science/article/pii/S0021869385712070},\n  abstract={In recent papers J. Bergen and D.S. Passman have applied so-called\n&#x60;Delta methods&#x27; to enveloping algebras of Lie superalgebras. This paper\ngeneralizes their results to the class of Lie colour algebras. The\nmethods and results in this paper are very similar to those of Bergen\nand Passman, and many of their proofs generalize easily. However, at\nsome points there are serious difficulties to overcome. The results\nobtained show that if $L$ is a Lie colour algebra then the join of all\nfinite-dimensional ideals of  $L$ controls certain properties of the\nuniversal enveloping algebras  $U(L)$. Specifically, we consider\nprimeness, semiprimeness, constants, semi-invariants, almost constants,\nfaithfulness of the adjoint action, the centre, almost centralizers and\nthe central closure.}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In recent papers J. Bergen and D.S. Passman have applied so-called `Delta methods' to enveloping algebras of Lie superalgebras. This paper generalizes their results to the class of Lie colour algebras. The methods and results in this paper are very similar to those of Bergen and Passman, and many of their proofs generalize easily. However, at some points there are serious difficulties to overcome. The results obtained show that if $L$ is a Lie colour algebra then the join of all finite-dimensional ideals of $L$ controls certain properties of the universal enveloping algebras $U(L)$. Specifically, we consider primeness, semiprimeness, constants, semi-invariants, almost constants, faithfulness of the adjoint action, the centre, almost centralizers and the central closure.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);