{"title":"Output uncertainty mitigation in competitive markets","authors":"Bingbing Li , Yan Long","doi":"10.1016/j.mathsocsci.2024.05.001","DOIUrl":"https://doi.org/10.1016/j.mathsocsci.2024.05.001","url":null,"abstract":"<div><p>Output uncertainty is a major concern for industries prone to exogenous, persistent and large fluctuations in output, such as agriculture, wind and solar power generation, while technology adoption aimed at mitigating output uncertainty can improve social welfare. This paper constructs a competitive market model with random output fluctuations to examine the scale of technology adoption at the long-term equilibrium and its comparison with the social optimum. We show that the First Welfare Theorem no longer holds in general, and depending on the characteristics of the demand function, the scale of technology adoption in the competitive market may be greater or less than the socially optimal scale.</p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"130 ","pages":"Pages 4-9"},"PeriodicalIF":0.6,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140914010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Trade-off between manipulability and dictatorial power: A proof of the Gibbard–Satterthwaite Theorem","authors":"Agustín G. Bonifacio","doi":"10.1016/j.mathsocsci.2024.04.003","DOIUrl":"https://doi.org/10.1016/j.mathsocsci.2024.04.003","url":null,"abstract":"<div><p>By endowing the class of <em>tops-only</em> and <em>efficient</em> social choice rules with a dual order structure that exploits the trade-off between different degrees of manipulability and dictatorial power rules allow agents to have, we provide a proof of the Gibbard–Satterthwaite Theorem.</p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"130 ","pages":"Pages 1-3"},"PeriodicalIF":0.6,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140905831","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cost allocation and airport problems","authors":"William Thomson","doi":"10.1016/j.mathsocsci.2024.03.007","DOIUrl":"10.1016/j.mathsocsci.2024.03.007","url":null,"abstract":"<div><p>We consider the problem of dividing the cost of a facility when agents can be ordered in terms of the needs they have for it, and accommodating an agent with a certain need allows accommodating all agents with lower needs at no extra cost. This problem is known as the “airport problem”, the facility being the runway. We review the literature devoted to its study, and formulate a number of open questions.</p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"131 ","pages":"Pages 17-31"},"PeriodicalIF":0.5,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141728590","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the difficulty of characterizing network formation with endogenous behavior","authors":"Benjamin Golub , Yu-Chi Hsieh , Evan Sadler","doi":"10.1016/j.mathsocsci.2023.10.006","DOIUrl":"10.1016/j.mathsocsci.2023.10.006","url":null,"abstract":"<div><p><span>Bolletta (2021)</span> studies a model in which a network is strategically formed and then agents play a linear best-response investment game in it. The model is motivated by an application in which people choose both their study partners and their levels of educational effort. Agents have different one-dimensional types – private returns to effort. A main result claims that (pairwise Nash) stable networks have a <em>locally complete</em><span><span> structure consisting of possibly overlapping cliques: if two agents are linked, they are part of a clique composed of all agents with types between theirs. A </span>counterexample shows that the claimed characterization is incorrect. We specify where the analysis errs and discuss implications for network formation models.</span></p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"129 ","pages":"Pages 107-110"},"PeriodicalIF":0.6,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138527408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rawlsian Matching","authors":"Mustafa Oğuz Afacan , Umut Dur","doi":"10.1016/j.mathsocsci.2024.04.002","DOIUrl":"https://doi.org/10.1016/j.mathsocsci.2024.04.002","url":null,"abstract":"<div><p>We apply the Rawlsian principle to a canonical discrete object allocation problem. A matching is Rawlsian if it is impossible to improve the ranking of assignment for the worst-off agent or reduce the cardinality of the set of the worst-off agent-body. None of the well-known mechanisms are Rawlsian. We introduce an efficient and Rawlsian class of mechanisms. Strategy-proofness is incompatible with Rawlsianism; therefore, no Rawlsian mechanism is strategy-proof.</p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"129 ","pages":"Pages 101-106"},"PeriodicalIF":0.6,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140621877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Implementing direct democracy via representation","authors":"Guadalupe Correa-Lopera","doi":"10.1016/j.mathsocsci.2024.04.001","DOIUrl":"https://doi.org/10.1016/j.mathsocsci.2024.04.001","url":null,"abstract":"<div><p>Today, several social movements in western democracies argue that traditional representative democracy has failed to adequately represent the will of the “people”, and instead support direct democracy as the only political system to restore the will of the majority. We analyze under what conditions the policy – a vector of decisions on every issue – implemented by the winner of a bipartisan electoral competition coincides with the policy that citizens would choose by means of direct democracy. We find necessary and sufficient conditions for this equivalence to hold, implying that, as long as at least one of them is not fulfilled, a divergence of outcomes between direct and representative democracy arises. The first condition requires that the outcome of majority voting issue-by-issue is the Condorcet winner relative to the voters’ preference profile over the set of policies. The second requires that either that outcome is the preferred policy for at least one of the candidates, or that candidates’ preferred policies differ on every single issue. We reinterpret some findings in the literature in the light of our model and present them as potential reasons why the equivalence between direct and representative democracy may fail.</p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"129 ","pages":"Pages 85-92"},"PeriodicalIF":0.6,"publicationDate":"2024-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0165489624000404/pdfft?md5=a473f41645fc7bc91cd195e4d3525110&pid=1-s2.0-S0165489624000404-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140558734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A characterization of the top trading cycles mechanism for the school choice problem","authors":"Umut Dur, Scott Paiement","doi":"10.1016/j.mathsocsci.2024.03.006","DOIUrl":"https://doi.org/10.1016/j.mathsocsci.2024.03.006","url":null,"abstract":"<div><p>This paper characterizes the Top Trading Cycles (TTC) mechanism for the school choice problem where schools may have multiple available seats to be assigned to students. We first define weaker forms of fairness, consistency, and resource monotonicity. We show that the TTC mechanism is the unique Pareto efficient and strategy-proof mechanism that satisfies these weaker forms of fairness, consistency and resource monotonicity. We also show that in a well-defined sense TTC is the “most stable” Pareto efficient mechanism.</p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"129 ","pages":"Pages 93-100"},"PeriodicalIF":0.6,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140605862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Aggregative games with discontinuous payoffs at the origin","authors":"Pierre von Mouche , Ferenc Szidarovszky","doi":"10.1016/j.mathsocsci.2024.03.008","DOIUrl":"https://doi.org/10.1016/j.mathsocsci.2024.03.008","url":null,"abstract":"<div><p>Recently a framework was developed for aggregative variational inequalities by means of the Selten–Szidarovszky technique. By referring to this framework, a powerful Nash equilibrium uniqueness theorem for sum-aggregative games is derived. Payoff functions are strictly quasi-concave in own strategies but may be discontinuous at the origin. Its power is illustrated by reproducing and generalising in a few lines an equilibrium uniqueness result in Corchón and Torregrosa (2020) for Cournot oligopolies with the Bulow–Pfleiderer price function. Another illustration addresses an asymmetric contest with endogenous valuations in Hirai and Szidarovszky (2013).</p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"129 ","pages":"Pages 77-84"},"PeriodicalIF":0.6,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140543858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the continuity of the Walras correspondence in distributional economies with an infinite-dimensional commodity space","authors":"Sebastián Cea-Echenique , Matías Fuentes","doi":"10.1016/j.mathsocsci.2024.03.005","DOIUrl":"https://doi.org/10.1016/j.mathsocsci.2024.03.005","url":null,"abstract":"<div><p>Distributional economies are defined by a probability distribution in the space of characteristics where the commodity space is an ordered separable Banach space. We characterize the continuity of the equilibrium correspondence and an associated stability concept which allows us to give a positive answer to an open question about the continuity of the Walras correspondence in infinite-dimensional spaces. As a byproduct, we study a stability concept where differentiability assumptions are not required, as is usual in the literature on regularity. Moreover, since distributional economies do not specify a space of agents, our setting encompasses several results in the literature on large economies.</p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"129 ","pages":"Pages 61-69"},"PeriodicalIF":0.6,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140290329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Exploring the constraints on artificial general intelligence: A game-theoretic model of human vs machine interaction","authors":"Mehmet S. Ismail","doi":"10.1016/j.mathsocsci.2024.03.004","DOIUrl":"10.1016/j.mathsocsci.2024.03.004","url":null,"abstract":"<div><p>The potential emergence of artificial general intelligence (AGI) systems has sparked intense debate among researchers, policymakers, and the public due to their potential to surpass human intelligence in all domains. This note argues that for an AI to be considered “general”, it should achieve superhuman performance not only in zero-sum games but also in general-sum games, where winning or losing is not clearly defined. In this note, I propose a game-theoretic framework that captures the strategic interactions between a representative human agent and a potential superhuman machine agent. Four assumptions underpin this framework: Superhuman Machine, Machine Strategy, Rationality, and Strategic Unpredictability. The main result is an impossibility theorem, establishing that these assumptions are inconsistent when taken together, but relaxing any one of them results in a consistent set of assumptions. This note contributes to a better understanding of the theoretical context that can shape the development of superhuman AI.</p></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"129 ","pages":"Pages 70-76"},"PeriodicalIF":0.6,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0165489624000350/pdfft?md5=d91abed3d66e2e1fea4feb7ce1a16259&pid=1-s2.0-S0165489624000350-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140281660","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}