<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Nash equilibrium &#8211; Science</title>
	<atom:link href="https://scienmag.com/tag/nash-equilibrium/feed/" rel="self" type="application/rss+xml" />
	<link>https://scienmag.com</link>
	<description></description>
	<lastBuildDate>Fri, 23 Oct 2026 21:28:07 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.1.3</generator>

<image>
	<url>https://scienmag.com/wp-content/uploads/2024/07/cropped-scienmag_ico-32x32.jpg</url>
	<title>Nash equilibrium &#8211; Science</title>
	<link>https://scienmag.com</link>
	<width>32</width>
	<height>32</height>
</image> 
<site xmlns="com-wordpress:feed-additions:1">73899611</site>	<item>
		<title>Quantum Entanglement Can Stabilize a Game Strategy, but Only If You Count Strategies Carefully</title>
		<link>https://scienmag.com/quantum-entanglement-can-stabilize-a-game-strategy-but-only-if-you-count-strategies-carefully/</link>
		
		<dc:creator><![CDATA[Katie Riggs]]></dc:creator>
		<pubDate>Fri, 23 Oct 2026 21:28:07 +0000</pubDate>
				<category><![CDATA[Technology and Engineering]]></category>
		<category><![CDATA[Benjamin-Hayden]]></category>
		<category><![CDATA[Bloch sphere]]></category>
		<category><![CDATA[coordination game]]></category>
		<category><![CDATA[Eisert-Wilkens-Lewenstein scheme]]></category>
		<category><![CDATA[entanglement]]></category>
		<category><![CDATA[evolutionarily stable strategies in quantum settings]]></category>
		<category><![CDATA[evolutionarily stable strategy]]></category>
		<category><![CDATA[EWL quantization scheme]]></category>
		<category><![CDATA[fragility of quantum strategy stability]]></category>
		<category><![CDATA[impact of entanglement on game strategies]]></category>
		<category><![CDATA[local unitary operations in quantum games]]></category>
		<category><![CDATA[measurement outcomes in quantum payoff determination]]></category>
		<category><![CDATA[Nash equilibrium]]></category>
		<category><![CDATA[Nash equilibrium in quantum games]]></category>
		<category><![CDATA[payoff equivalence]]></category>
		<category><![CDATA[quantum entanglement in strategic stability]]></category>
		<category><![CDATA[quantum game theory]]></category>
		<category><![CDATA[quantum information]]></category>
		<category><![CDATA[quantum strategy space and stability]]></category>
		<category><![CDATA[replicator dynamics]]></category>
		<category><![CDATA[role of strategy space expansion in quantum games]]></category>
		<category><![CDATA[SU(2) strategy space]]></category>
		<category><![CDATA[two-player quantum coordination game]]></category>
		<guid isPermaLink="false">https://scienmag.com/?p=335475</guid>

					<description><![CDATA[A new analysis shows entanglement makes a quantum coordination strategy evolutionarily stable only under a restricted strategy space and an exact payoff symmetry, revealing how strategy identity shapes stability in quantum games.]]></description>
										<content:encoded><![CDATA[<p>It is a Nash equilibrium, but it is not evolutionarily stable. A new theoretical analysis of a quantized version of that game shows that quantum entanglement can flip this verdict: with any nonzero amount of entanglement, the quantum counterpart of the fifty-fifty strategy becomes a strict equilibrium that no rare mutant can invade. But the study also reveals that this stability is fragile in an unexpected way—it depends entirely on which quantum operations the game admits as distinct strategies, and it vanishes the moment the strategy space is enlarged, without any payoff changing at all.</p>
<p>The work, by Azhar Iqbal and Derek Abbott, published in Quantum Information Processing, examines the well-known Eisert–Wilkens–Lewenstein (EWL) scheme, a principal formulation for quantizing two-player, two-strategy games. In this framework, each player applies a local unitary operation to their qubit, a shared entangling gate links the two qubits before the moves and disentangles them after, and the final measurement probabilities determine the payoffs. The authors study a symmetric coordination game in which both players earn a reward r for agreeing and a smaller penalty t for mismatching, and they ask a question that goes beyond Nash equilibrium: which strategies are evolutionarily stable?</p>
<p>An evolutionarily stable strategy, or ESS, is a strategy that, once adopted by an entire population, cannot be invaded by any sufficiently rare alternative. It is a stricter requirement than Nash equilibrium: if a mutant earns exactly the same payoff against the resident as the resident earns against itself, the resident must also do better than the mutant against the mutant&#x27;s own population. Every strict Nash equilibrium is automatically an ESS, but the converse fails.</p>
<p>Evolutionary stability matters when a game is played repeatedly by randomly matched members of a large adaptive population, rather than once between two perfectly rational players, and it is the concept underlying claims that entanglement changes which strategies can persist. In the restricted two-parameter version of the EWL strategy space, the quantum strategy corresponding to the classical fifty-fifty mix is the two-parameter choice (π/2, π/4). The authors prove that at zero entanglement this strategy is a Nash equilibrium but not an ESS, exactly mirroring the classical result.</p>
<p>But for any positive entanglement strength γ, no matter how small, the entangling gate introduces a term into the payoff that depends on the players&#x27; phase choices, and this term becomes strictly positive for every deviation. The strategy becomes a strict symmetric Nash equilibrium, and therefore an ESS, for every γ &gt; 0. The picture changes dramatically when the strategy space is enlarged to the full group SU(2) of all single-qubit unitaries—precisely the enlargement famously raised by Benjamin and Hayden for quantum games.</p>
<p>The same unitary remains a Nash equilibrium, but it is no longer strict and no longer an ESS at any entanglement strength. The culprit is not a change in payoffs but a one-parameter family of physically distinct unitaries that earn exactly the same payoff as the resident in every possible matchup. Because an ESS must outperform every distinct mutant, exact payoff duplicates block the strict inequality, and the second ESS condition fails as well.</p>
<p>In fact, the authors prove something stronger: in the unreduced SU(2) game, no pure strategy whatsoever is an ESS, and no randomized strategy is either, because every one has a continuum of such duplicates. The geometric origin of this failure is one of the paper&#x27;s most elegant results. For the class of payoffs considered—equal rewards for both coordinated outcomes and equal penalties for both mismatched outcomes—the entire payoff of the quantum game depends on a player&#x27;s unitary only through a single vector: the Bloch vector n(U), obtained by rotating the z-axis of the Bloch sphere with the unitary.</p>
<p>The payoff takes the compact form t plus a term proportional to a bilinear coupling of the two players&#x27; Bloch vectors through a matrix that depends on entanglement. Two unitaries with the same Bloch vector are exact payoff duplicates, even though they are generally different physical operations. The payoff-equivalence classes turn out to be the orbits of a continuous U(1) subgroup acting on SU(2), and the quotient—the reduced strategy space—is a two-dimensional sphere.</p>
<p>On that reduced sphere, stability is restored. The image of the equilibrium strategy becomes a strict symmetric Nash equilibrium and an ESS for every positive entanglement, and the authors show this holds even against randomized or polymorphic mutant populations, with an explicit uniform invasion barrier equal to sin(γ)/2. At zero entanglement the barrier vanishes, consistent with the classical result.</p>
<p>The unreduced and reduced formulations therefore give different but mathematically consistent answers: they simply disagree on what counts as a distinct mutant. The authors reconcile the two by showing a set-valued form of stability—in the unreduced game, each individual unitary is only neutrally stable, but its whole payoff-equivalence class resists every mutant population not concentrated on that class, a property closely related to evolutionarily stable sets. Which formulation is appropriate is a modeling decision, and the paper is careful about it.</p>
<p>If fitness is determined solely by the game&#x27;s payoff, selection cannot discriminate between payoff-equivalent unitaries, and the reduced game captures the entire selective dynamics—the replicator equation acts on equivalence classes while relative frequencies within each class drift neutrally. If, however, distinct unitary implementations matter for reasons outside the payoff function—implementation cost, circuit complexity, robustness to noise, or the full distribution of outcomes rather than its average—then the unreduced game is the right arena, and payoff-equivalent unitaries generally do produce different outcome distributions even when their payoffs coincide. The analysis also delimits its own scope sharply.</p>
<p>The Bloch-map reduction depends on an exact symmetry of the payoff matrix: equal rewards for the two agreement outcomes and equal penalties for the two disagreement outcomes. The authors exhibit an arbitrarily small perturbation of the payoffs that preserves the classical mixed equilibrium at p = 1/2 but destroys the quantum equilibrium entirely—at entanglement π/4, a profitable deviation appears within what was previously the neutral family, and the strategy fails even the Nash condition. The mechanism is traced to single-player terms in the payoff operator, which do not commute with the entangling gate&#x27;s generator and therefore pull additional dependence on the local unitaries into the payoff.</p>
<p>The reduced-space stability theorem is thus not robust against generic payoff perturbations. For the broader field, the message is methodological. Statements that entanglement stabilizes a strategy in quantum games, the authors argue, should specify the admitted strategic domain, the criterion for strategy identity, and whether stability attaches to a single strategy or to a set of payoff-equivalent ones.</p>
<p>The study extends the strategy-space dependence known since Benjamin and Hayden from Nash equilibrium to evolutionary stability, identifies exact payoff equivalence—rather than altered payoffs—as the mechanism by which enlarging a quantum strategy space can destroy stability, and supplies an operator-based test, based on whether the measured observable commutes with the entangling gate, for finding comparable reductions in other EWL-type protocols. The classical verdict that a fifty-fifty mix is evolutionarily vulnerable is not simply overturned by entanglement; it is suspended on a knife&#x27;s edge of modeling convention and exact payoff symmetry, with the stability resting on an entire equivalence class of quantum operations rather than any single one.</p>
<p><strong>Subject of Research:</strong> Evolutionary stability of strategies in an Eisert–Wilkens–Lewenstein quantized coordination game</p>
<p><strong>Article Title:</strong> Evolutionary stability and payoff equivalence in an Eisert–Wilkens–Lewenstein quantum game</p>
<p><strong>Article References:</strong> Iqbal, A., &amp; Abbott, D. (2026). Evolutionary stability and payoff equivalence in an Eisert–Wilkens–Lewenstein quantum game. <em>Quantum Information Processing, 25</em>(11), Article 348. <a href="https://doi.org/10.1007/s11128-026-05373-0" rel="noopener noreferrer">https://doi.org/10.1007/s11128-026-05373-0</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> <a href="https://doi.org/10.1007/s11128-026-05373-0" rel="noopener noreferrer">10.1007/s11128-026-05373-0</a></p>
<p><strong>Keywords:</strong> quantum game theory, evolutionarily stable strategy, Eisert-Wilkens-Lewenstein scheme, entanglement, Nash equilibrium, coordination game, SU(2) strategy space, payoff equivalence, Bloch sphere, replicator dynamics, Benjamin-Hayden, quantum information</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">335475</post-id>	</item>
		<item>
		<title>When Pension Managers Compete, Everyone Takes More Risk &#8211; Even When Liabilities Jump</title>
		<link>https://scienmag.com/when-pension-managers-compete-everyone-takes-more-risk-even-when-liabilities-jump/</link>
		
		<dc:creator><![CDATA[Reid Dalton]]></dc:creator>
		<pubDate>Sat, 17 Oct 2026 03:10:45 +0000</pubDate>
				<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Science News]]></category>
		<category><![CDATA[competition among pension managers]]></category>
		<category><![CDATA[competitive risk-taking]]></category>
		<category><![CDATA[CRRA utility]]></category>
		<category><![CDATA[defined contribution]]></category>
		<category><![CDATA[funding ratio]]></category>
		<category><![CDATA[game theory in pension finance]]></category>
		<category><![CDATA[Hamilton-Jacobi-Bellman]]></category>
		<category><![CDATA[hybrid pension scheme analysis]]></category>
		<category><![CDATA[impact of liability jumps on pension funds]]></category>
		<category><![CDATA[investment risk in defined contribution and benefit plans]]></category>
		<category><![CDATA[jump-diffusion]]></category>
		<category><![CDATA[jump-diffusion processes in retirement finance]]></category>
		<category><![CDATA[liability risk]]></category>
		<category><![CDATA[liability shocks in pension funds]]></category>
		<category><![CDATA[mathematical finance]]></category>
		<category><![CDATA[Nash equilibrium]]></category>
		<category><![CDATA[pension fund risk management]]></category>
		<category><![CDATA[pension funds]]></category>
		<category><![CDATA[real-world pension liability dynamics]]></category>
		<category><![CDATA[risk-taking behavior in pension management]]></category>
		<category><![CDATA[stochastic differential game]]></category>
		<category><![CDATA[stochastic differential game models]]></category>
		<category><![CDATA[welfare effects of pension fund competition]]></category>
		<category><![CDATA[welfare spillover]]></category>
		<guid isPermaLink="false">https://scienmag.com/?p=293002</guid>

					<description><![CDATA[A new game-theoretic model shows that competing pension fund managers take more risk than they would alone, with equilibrium strategies immune to liability jump parameters even as those jumps reshape welfare through own-cost and rival-benefit spillovers.]]></description>
										<content:encoded><![CDATA[<p>Two pension fund managers locked in a rivalry will take more investment risk than either would choose alone &#8211; and remarkably, the mathematical form of that risk-taking is completely blind to the sudden liability shocks that define pension finance. That is the central finding of a new stochastic differential game model developed by Oteng Keganneng, Eriyoti Chikodza, and Othusitse Basimanebotlhe of the University of Botswana, published in Frontiers in Applied Mathematics and Statistics. The work extends game-theoretic pension analysis into the jump-diffusion territory where real-world obligations actually live, and it delivers a counterintuitive welfare twist: a manager&#8217;s own liability jumps hurt, but the competitor&#8217;s jumps help.</p>
<p>Hybrid defined contribution pension funds occupy an awkward middle ground in retirement finance. In a pure defined contribution plan, members contribute at a fixed rate and their retirement benefit depends entirely on how investments perform over a working life that can span twenty to forty years. In a defined benefit plan, the benefit is guaranteed and the sponsor absorbs the investment risk. Hybrid schemes blend both: contributions are fixed as in a DC plan, but the fund carries stochastic liability dynamics of the kind traditionally associated with DB schemes. Because members can observe performance and reallocate their contributions toward funds that are doing better, managers face competitive pressure that distorts how they invest.</p>
<p>Most existing models treat a single pension manager optimizing in isolation, or they model liabilities as smooth diffusions &#8211; continuous random walks that never leap. Reality is less polite. Pension obligations can jump discontinuously when regulators revise benefit rules, when longevity shocks force actuarial reassessments, when bulk member transfers occur, or when discount rates are reset. The Botswana team models these shocks explicitly: each fund&#8217;s liabilities follow a jump-diffusion process in which jumps arrive according to a finite-activity Poisson random measure, and each jump size is drawn from an exponential distribution truncated to the interval between zero and one. The truncation reflects the dominant direction of actuarial risk &#8211; regulatory changes, court judgments, and longevity shocks almost exclusively increase obligations rather than reduce them.</p>
<p>The mathematical machinery rests on a carefully chosen state variable. Rather than tracking absolute surplus &#8211; assets minus liabilities &#8211; the model tracks the exact asset-to-liability ratio, the funding ratio that pension practitioners use to gauge solvency. A ratio at or above one means the fund is fully funded; below one signals underfunding. Using the Itô-Lévy formula, the authors derive the exact dynamics of this ratio without any proportional surplus approximation, producing a homogeneous stochastic differential equation. When a liability jump of size z occurs, assets are momentarily unaffected while liabilities rise proportionally, so the funding ratio is multiplied by one over one plus z &#8211; a proportional reduction of z over one plus z, which is smaller than the shock itself. If liabilities double, the funding ratio halves.</p>
<p>Into this setting the authors place two competing managers, each maximizing constant relative risk aversion utility of their terminal funding ratio relative to the competitor&#8217;s. This pure relative-performance objective is the game-theoretic engine: manager a&#8217;s welfare depends on the ratio of their funding ratio to manager b&#8217;s, and vice versa. Applying the Hamilton-Jacobi-Bellman dynamic programming approach to the coupled system yields Nash equilibrium portfolio strategies and value functions in closed form &#8211; a rarity in jump-diffusion games, where closed-form solutions are typically out of reach.</p>
<p>The headline structural result is an invariance theorem. The Nash equilibrium portfolio weights turn out to be completely independent of the liability jump parameters &#8211; neither the jump arrival intensity nor the mean jump size enters the equilibrium formula. In the symmetric case, where both managers face identical liability-correlation parameters, the equilibrium weight collapses to the ratio of excess return to variance, the familiar Merton-like quantity determined solely by the market&#8217;s risk-reward profile. Neither manager&#8217;s risk aversion matters. The mechanism is an exact cancellation: each manager&#8217;s reaction function has a competitive amplification slope that grows with risk tolerance, while the intercept falls with risk aversion, and in equilibrium these two effects offset precisely. The managers remain genuinely risk-averse &#8211; their value functions retain full dependence on risk aversion through curvature and welfare terms &#8211; but the portfolio weights themselves behave as if they were risk-neutral. This invariance holds only under specific conditions: pure relative utility, CRRA preferences, a single shared risky asset, and constant coefficients. Relax any one, and risk aversion re-enters through a cross-liability correction term that appears in the asymmetric case.</p>
<p>Competition itself is unambiguously risk-amplifying. Comparing the Nash equilibrium against the single-agent benchmark, where each manager optimizes absolute funding-ratio utility without regard to the rival, the equilibrium weight strictly exceeds the solo optimum for every risk aversion level above one. The amplification gap widens as risk aversion increases: the most risk-averse managers, who would invest most conservatively in isolation, are pushed furthest from their solo positions by competitive pressure. Under the paper&#8217;s benchmark calibration &#8211; a risk-free rate of four percent, an expected risky return of twelve percent, and twenty percent volatility &#8211; the equilibrium weight equals two, meaning each manager borrows an amount equal to the entire fund value and invests twice the fund&#8217;s assets in the risky asset, holding a short position in the risk-free asset to finance the leverage.</p>
<p>The welfare results carry the sharpest economic sting. Two loading functions, absent from all prior work, capture how liability jumps affect each manager&#8217;s expected utility. A manager&#8217;s own jump intensity and jump size both reduce welfare: more frequent or larger shocks to one&#8217;s own liabilities drag down the funding ratio and with it the relative-performance payoff. But the competitor&#8217;s jumps work in the opposite direction. When the rival fund&#8217;s liabilities jump more often, the rival&#8217;s funding ratio decays faster, improving one&#8217;s own relative standing even though one&#8217;s own fund is untouched. Numerical illustrations confirm the theory: as the competitor&#8217;s jump intensity rises from one-half to three, the opponent&#8217;s value function collapses from roughly negative zero-point-nine to nearly negative seven hundred, while the beneficiary&#8217;s welfare improves monotonically. This creates a strategic incentive for each manager to benefit from the competitor&#8217;s exposure to adverse shocks &#8211; a spillover entirely invisible in single-manager frameworks.</p>
<p>The implications reach into pension governance and regulation. If relative-performance evaluation, whether explicit benchmarking or implicit peer comparison, induces managers to take more risk than is individually optimal, then regulators observing excessive risk-taking may need to ask whether peer-comparison incentives rather than individual risk appetite are the true driver. The spillover result adds a systemic dimension: funds with lower liability jump exposure effectively profit from competitors&#8217; adverse shocks, an incentive structure that only becomes visible once competition is modeled explicitly. The authors note that their model imposes no leverage or short-sale constraints, whereas real pension regulation often limits leverage &#8211; incorporating such constraints would require numerical methods beyond the current scope. Future extensions include inflation-indexed assets, relaxed risk-aversion restrictions through alternative jump distributions, and allowing managers to invest in different risky assets, which would introduce additional asymmetry into the reaction functions. For now, the message is stark: in the competitive arena of pension management, the game itself &#8211; not the shocks &#8211; determines how much risk everyone takes, but the shocks decide who wins.</p>
<p><strong>Subject of Research:</strong> Stochastic differential game theory applied to competing hybrid pension fund managers facing jump-diffusion liability risk</p>
<p><strong>Article Title:</strong> A stochastic differential game between two hybrid pension fund managers under a jump-diffusion liability process</p>
<p><strong>Article References:</strong> Keganneng, O., Chikodza, E., &amp; Basimanebotlhe, O. (2026). A stochastic differential game between two hybrid pension fund managers under a jump-diffusion liability process. <em>Frontiers in Applied Mathematics and Statistics, 12</em>, Article 1931310. <a href="https://doi.org/10.3389/fams.2026.1931310" rel="noopener noreferrer">https://doi.org/10.3389/fams.2026.1931310</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> <a href="https://doi.org/10.3389/fams.2026.1931310" rel="noopener noreferrer">10.3389/fams.2026.1931310</a></p>
<p><strong>Keywords:</strong> pension funds, Nash equilibrium, stochastic differential game, jump-diffusion, defined contribution, liability risk, CRRA utility, Hamilton-Jacobi-Bellman, funding ratio, competitive risk-taking, welfare spillover, mathematical finance</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">293002</post-id>	</item>
		<item>
		<title>Game Theory Warns AI Dependence May Trap Humanity in Comfortable Servitude</title>
		<link>https://scienmag.com/game-theory-warns-ai-dependence-may-trap-humanity-in-comfortable-servitude/</link>
		
		<dc:creator><![CDATA[Bruce Campbell]]></dc:creator>
		<pubDate>Tue, 06 Oct 2026 04:06:17 +0000</pubDate>
				<category><![CDATA[Technology and Engineering]]></category>
		<category><![CDATA[AI and economic power distribution]]></category>
		<category><![CDATA[AI governance]]></category>
		<category><![CDATA[AI societal dependency risks]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Artificial intelligence dependency]]></category>
		<category><![CDATA[autonomy]]></category>
		<category><![CDATA[cognitive dependency]]></category>
		<category><![CDATA[cognitive deskilling]]></category>
		<category><![CDATA[cognitive independence loss]]></category>
		<category><![CDATA[collective action]]></category>
		<category><![CDATA[collective dilemma in AI reliance]]></category>
		<category><![CDATA[game theory]]></category>
		<category><![CDATA[game theory and AI control]]></category>
		<category><![CDATA[human autonomy in AI era]]></category>
		<category><![CDATA[large language models]]></category>
		<category><![CDATA[long-term consequences of AI dependence]]></category>
		<category><![CDATA[Nash equilibrium]]></category>
		<category><![CDATA[power concentration]]></category>
		<category><![CDATA[risks of AI-enabled servitude]]></category>
		<category><![CDATA[societal surrender to AI]]></category>
		<category><![CDATA[strategic AI reliance models]]></category>
		<category><![CDATA[tragedy of the commons]]></category>
		<category><![CDATA[Tragedy of Voluntary Servitude]]></category>
		<category><![CDATA[voluntary servitude]]></category>
		<guid isPermaLink="false">https://scienmag.com/?p=240166</guid>

					<description><![CDATA[A new game-theoretic model argues that submitting to AI dependency is a dominant strategy for every individual, making universal cognitive servitude the unique Nash equilibrium even if everyone would prefer independence.]]></description>
										<content:encoded><![CDATA[<p>A provocative new game-theoretic analysis argues that the world&#8217;s headlong rush into artificial intelligence may be constructing a trap unlike any studied before: a collective dilemma in which every individual&#8217;s rational choice leads, inexorably, to a society that has surrendered its cognitive independence. Writing in the journal AI &amp; Society, economist Taylor Collins of the University of the Incarnate Word proposes what he calls the Tragedy of Voluntary Servitude, a formal model showing that deep AI dependency can emerge as the unique stable outcome of a strategic game even when every participant would prefer that nobody become dependent at all.</p>
<p>The model borrows its skeleton from the most famous dilemma in the social sciences, the Tragedy of the Commons, first formalized by Garrett Hardin in 1968. In the classical version, a shared pasture or fishery is destroyed because each herder profits from adding one more animal, even though the aggregate result is ruin for all. Collins replaces the grass with something intangible: the distribution of cognitive and economic power across a population. Each player in his game faces a stark binary choice. Submit, and adopt AI as the primary engine of analysis, writing, planning, and decision-making. Or Resist, and maintain independent human capability at the cost of productivity.</p>
<p>The mathematical heart of the paper is a dominance proof. Each player&#8217;s payoff combines three components: productive capacity, which is high for submitters and low for resisters; competitive position, which rewards being augmented when others are not and punishes being unaugmented when others are; and autonomy, which erodes for everyone as more of the population submits and a central AI provider accumulates data, market power, and institutional influence. The critical asymmetry is that an individual&#8217;s own submission changes collective autonomy by only a vanishing fraction, an amount that shrinks as one over the population size. The productivity gain and competitive advantage, by contrast, are large and fully captured by the individual. Submit therefore strictly dominates Resist for any reasonably large population, and the unique Nash equilibrium is universal submission.</p>
<p>What makes the result unsettling is its robustness. Collins shows that the dominance of submission holds even if every player would individually prefer a world of universal resistance, because no single person&#8217;s restraint saves more than a negligible sliver of the commons while costing them the full productivity and competitive penalty. The collectively preferred outcome is individually inaccessible. The result also survives uncertainty about whether AI use actually erodes human cognition. The paper reviews striking empirical evidence that it may: endoscopists who regularly used AI-assisted polyp detection saw their unassisted detection rates fall from 28 to 22 percent within three months, and high school students given unrestricted access to GPT-4 performed 17 percent worse on subsequent unassisted mathematics exams than peers who never used the tool. But even if AI use were purely augmenting, Collins argues, the strategic dynamic toward dependency and power concentration would persist, because the mechanism is structural, not cognitive.</p>
<p>The paper then identifies six features that distinguish this new tragedy from the classical commons and make it harder to escape. The damage is invisible, because every step deeper into dependency arrives bundled with genuine benefits, so depletion feels like improvement. The lock-in is irreversible, since skills atrophy and alternative infrastructures wither, converting a repeated choice into a ratchet. There is no moment of crisis, no day the fish run out, and therefore no coordination signal to galvanize collective action. The subjects actively defend their own servitude, sincerely reporting that the tool has made them more capable, because the instrument they would use to evaluate their condition is the very instrument they have surrendered their judgment to. And the ultimate beneficiary of each submission is not the user but the central entity, which converts billions of individually rational choices into concentrated power.</p>
<p>That last point echoes a question posed in 1577 by Étienne de La Boétie, whose Discourse on Voluntary Servitude asked where the tyrant obtains the eyes to spy on citizens if the citizens do not provide them themselves. Collins formalizes La Boétie&#8217;s paradox: the AI provider&#8217;s power flows entirely upward from the population&#8217;s own choices, yet no individual can withhold their contribution without suffering a loss that dwarfs their marginal impact on the collective outcome. The servitude is voluntary not because people are ignorant of the risks, but because individual incentives overwhelm collective consequences regardless of what anyone knows.</p>
<p>Whether the resulting equilibrium constitutes a tragedy, Collins is careful to note, depends on the welfare framework applied. Under classical utilitarianism, universal submission may even be superior, since the augmented economy could produce unprecedented material abundance. Under the capability approach of Amartya Sen and Martha Nussbaum, cognitive autonomy is constitutive of meaningful agency and cannot be freely traded for productivity. Under the republican tradition of freedom as non-domination, a society whose cognitive infrastructure is controlled by an entity accountable chiefly to its own interests is unfree regardless of how prosperous its members are. The strategic dynamics, however, are indifferent to this philosophical debate; the equilibrium arrives either way.</p>
<p>The paper sketches what a society at the universal submission equilibrium might look like. Material wealth could be historically unprecedented, with diagnostics, legal analysis, and creative production abundant and cheap. But cognitive homogeneity would replace intellectual diversity, as everyone thinks through the same system trained on the same data, narrowing the range of ideas considered and leaving the society capable of optimizing within existing frameworks but unable to generate new ones. Democratic governance would be structurally undermined, since citizens relying on the same AI to understand policy and evaluate candidates would hand its operator an influence over public deliberation that no propaganda apparatus has ever achieved. A new class division would separate those who own the infrastructure from those who depend on it, and the servitude would be stable precisely because it is comfortable.</p>
<p>Can the trap be escaped? Collins audits Elinor Ostrom&#8217;s celebrated eight design principles for governing commons and finds the fit sobering. Only two, congruence with local conditions and nested enterprises, apply readily. Boundary definition and monitoring face severe challenges, because the resource being depleted is internal and invisible. Graduated sanctions must be inverted, replacing punishment for overuse with incentives for demonstrated independence, such as professional benchmarks of unassisted performance. The paper also surveys antitrust tools, including interoperability mandates and public compute options, open-source ecosystems, algorithmic auditing under frameworks like the EU AI Act, and education designed to cultivate the capacity to think without assistance. Cultural norms, Collins argues, are the only mechanism that changes the payoff structure itself, but they evolve on generational timescales while AI adoption moves on quarterly ones.</p>
<p>The author is explicit about the model&#8217;s limits: it assumes a binary choice, homogeneous players, a static one-shot decision, and linear autonomy dynamics, and it presents no new empirical data. He also acknowledges, with some irony, that the paper was developed through extensive collaboration with a large language model, a choice he describes as perfectly rational under the very incentive structure the model describes. Yet the central warning stands independent of those simplifications. The problem, Collins concludes, cannot be solved by individual restraint, because dominant strategies are too powerful; it demands institutional, structural, and system-wide responses, built before lock-in completes. If La Boétie was right that servitude endures through the atrophy of the imagination of alternatives, then waiting until the dependency is complete to act may not merely be difficult. It may, by that point, be literally unthinkable.</p>
<p><strong>Subject of Research:</strong> A game-theoretic model of cognitive dependency on artificial intelligence as a collective-action tragedy</p>
<p><strong>Article Title:</strong> The Tragedy of Voluntary Servitude: a game-theoretic model of cognitive dependency in the age of artificial intelligence</p>
<p><strong>Article References:</strong> Collins, T. (2026). The Tragedy of Voluntary Servitude: a game-theoretic model of cognitive dependency in the age of artificial intelligence. <em>AI &amp;amp; SOCIETY</em>. <a href="https://doi.org/10.1007/s00146-026-03309-x" rel="noopener noreferrer">https://doi.org/10.1007/s00146-026-03309-x</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> <a href="https://doi.org/10.1007/s00146-026-03309-x" rel="noopener noreferrer">10.1007/s00146-026-03309-x</a></p>
<p><strong>Keywords:</strong> game theory, artificial intelligence, cognitive dependency, tragedy of the commons, voluntary servitude, Nash equilibrium, power concentration, cognitive deskilling, large language models, collective action, AI governance, autonomy</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">240166</post-id>	</item>
		<item>
		<title>Quantum Rivals, Delayed Data: Economists Find a Universal Stability Boundary in Quantum Duopolies</title>
		<link>https://scienmag.com/quantum-rivals-delayed-data-economists-find-a-universal-stability-boundary-in-quantum-duopolies/</link>
		
		<dc:creator><![CDATA[Katie Riggs]]></dc:creator>
		<pubDate>Mon, 05 Oct 2026 12:09:29 +0000</pubDate>
				<category><![CDATA[Technology and Engineering]]></category>
		<category><![CDATA[analytical proof of market stability boundary]]></category>
		<category><![CDATA[cost asymmetry]]></category>
		<category><![CDATA[Cournot duopoly]]></category>
		<category><![CDATA[Cournot duopoly in quantum markets]]></category>
		<category><![CDATA[delay differential equations]]></category>
		<category><![CDATA[delayed data impact on market dynamics]]></category>
		<category><![CDATA[delayed information]]></category>
		<category><![CDATA[effects of information delays in quantum economics]]></category>
		<category><![CDATA[entanglement]]></category>
		<category><![CDATA[Hopf bifurcation]]></category>
		<category><![CDATA[influence of cost asymmetry in quantum duopoly]]></category>
		<category><![CDATA[isoelastic demand]]></category>
		<category><![CDATA[long-term market behavior in quantum economic systems]]></category>
		<category><![CDATA[Nash equilibrium]]></category>
		<category><![CDATA[oscillatory instability]]></category>
		<category><![CDATA[Quantum duopoly stability boundary]]></category>
		<category><![CDATA[quantum game theory]]></category>
		<category><![CDATA[quantum game theory in economics]]></category>
		<category><![CDATA[quantum information processing]]></category>
		<category><![CDATA[quantum information processing in economic models]]></category>
		<category><![CDATA[quantum market oscillations and stability]]></category>
		<category><![CDATA[quantum mechanics influence on firm competition]]></category>
		<category><![CDATA[stability switching]]></category>
		<category><![CDATA[stability versus runaway behavior in quantum strategic interactions]]></category>
		<guid isPermaLink="false">https://scienmag.com/?p=237924</guid>

					<description><![CDATA[A new mathematical analysis of quantum Cournot duopolies with delayed information shows that whether oscillatory instability can occur depends only on the firms' relative marginal costs, while entanglement and protocol choice merely shift the critical delay threshold.]]></description>
										<content:encoded><![CDATA[<p>What happens when two firms locked in fierce competition make their decisions not with classical arithmetic but with the strange machinery of quantum mechanics, and what happens further when the information they receive arrives late? That question sits at the heart of a new theoretical study by Luca Guerrini of the Polytechnic University of Marche and Stefania Ragni of the University of Ferrara, published in the journal Quantum Information Processing. The two Italian mathematicians have derived an exact, analytically proven boundary that separates stable market behavior from runaway oscillations in a quantum version of the classic Cournot duopoly, and their result carries a striking twist: the very existence of that boundary does not depend on how the quantum game is set up, only on how unequal the two firms&#8217; costs are.</p>
<p>The Cournot duopoly is one of the oldest workhorses of economic theory. In it, two firms simultaneously choose how much of a good to produce, and the market price adjusts according to total output. Each firm wants to maximize its own profit, and under the right conditions the two settle into a Nash equilibrium, a pair of production levels from which neither has an incentive to deviate. But real firms do not respond instantaneously. Market data take time to gather, production plans take time to implement, and decisions made today reflect information that is already stale. Economists have long known that such delays can destabilize otherwise well-behaved markets, sending quantities into cycles or even chaos. What Guerrini and Ragni show is that when the game is played with quantum strategies, the mathematics of delay acquires a remarkably clean structure.</p>
<p>Their model builds on a line of research that began in 1999, when David Meyer showed that games can admit quantum strategies and that these can outperform any classical play. Soon after, Jens Eisert, Martin Wilkens and Maciej Lewenstein formulated a general framework for quantum games in which players manipulate entangled qubits rather than choosing plain numbers. In the Cournot setting, later developed by Hongjun Li, Jiangfeng Du and Serge Massar in a continuous-variable formulation and by Paweł Frąckiewicz in an alternative scheme, the firms&#8217; strategic choices become quantum operators acting on a shared entangled state. The degree of entanglement, together with the specific protocol used to translate quantum outputs into production quantities, shapes the payoff landscape that each firm navigates.</p>
<p>Guerrini and Ragni&#8217;s first contribution is a unified mathematical representation that encompasses both the Li–Du–Massar protocol and the Frąckiewicz protocol within a single framework. This unification matters because previous studies treated each protocol separately, making it hard to tell which features of a quantum duopoly&#8217;s dynamics are artifacts of a particular formalism and which are genuine properties of the underlying economics. By writing the two schemes in a common language, the authors can cleanly separate the effects of the quantum protocol from the effects of cost asymmetry between the firms, and they can ask which of these actually determines whether the market stays calm or breaks into oscillation.</p>
<p>The model assumes isoelastic demand, meaning the price elasticity of demand is constant, a standard and analytically convenient specification, and adds delayed marginal-profit adjustment: each firm continuously nudges its output in the direction of its marginal profit, but computed from quantities observed a fixed time earlier. The authors establish the mathematical foundations first, proving that the interior quantum Nash equilibrium exists, remains positive, and stays bounded for all time, so the model cannot blow up or produce nonsensical negative outputs. They then derive the exact characteristic equation of the linearized system, the transcendental equation whose roots govern whether small perturbations around equilibrium decay or grow.</p>
<p>The central result is expressed through a single number, m, defined as the ratio of the second firm&#8217;s marginal cost to the first firm&#8217;s. If m lies between 3 minus 2 times the square root of 2 and 3 plus 2 times the square root of 2, roughly between 0.172 and 5.828, the equilibrium is stable for every finite delay whatsoever. No matter how stale the information becomes, the market always returns to equilibrium. This is a delay-independent stability region, and its existence is a genuinely quantum feature of the model&#8217;s structure. Outside that window, when one firm&#8217;s costs are more than about 5.8 times or less than about 0.17 times the other&#8217;s, the picture changes dramatically: there exists a finite critical delay beyond which stability is lost.</p>
<p>At that critical delay, the authors show, a single conjugate pair of characteristic roots crosses the imaginary axis transversally, the signature of a Hopf bifurcation. In plain terms, the equilibrium loses stability not through an explosion but through the birth of sustained oscillations: output levels begin to cycle around the Nash equilibrium with a growing amplitude until nonlinear effects take over. Numerical simulations reported in the paper confirm the analytical prediction, displaying precisely the oscillatory dynamics expected once the delay exceeds the computed threshold. A root-continuation analysis, tracking the characteristic roots as parameters vary, further corroborates the exact boundary.</p>
<p>Perhaps the most conceptually important finding is what does and does not matter for the stability threshold. Whether a finite critical delay exists at all depends only on the relative marginal costs of the two firms, a purely economic quantity that no choice of quantum protocol can alter. What the entanglement between the players&#8217; qubits and the choice between the Li–Du–Massar and Frąckiewicz schemes do control is the numerical location of that threshold, that is, how much delay the market can tolerate before oscillations set in. In other words, quantum structure tunes the market&#8217;s resilience, but the economic fundamentals decide whether resilience is unlimited or finite. This protocol-invariant boundary gives the study its title and offers a rare example of a result in quantum game theory that is robust across competing formalizations.</p>
<p>The work also connects two previously separate literatures. On one side, economists including Tönu Puu, Fabio Tramontana, Luca Gori, and Angelo Matsumoto and Ferenc Szidarovszky have extensively mapped the delayed and often chaotic dynamics of classical Cournot models with isoelastic demand, identifying Hopf bifurcations and stability switches in a variety of specifications. On the other side, a rapidly growing quantum-game community, including recent studies of memory, heterogeneous players, relative profit maximization, and asymmetric information in quantum Cournot and Bertrand settings, has documented complex dynamics in discrete-time quantum duopolies and triopolies. Guerrini and Ragni bring the delay-differential machinery of the first literature to bear on the second, providing the kind of exact characteristic-equation analysis that discrete-time studies often approximate.</p>
<p>As with all theoretical work, the model is a stylized rather than a literal description of markets; no one is suggesting that firms literally share entangled qubits when setting production quotas. But quantum game theory serves as a powerful generalization of classical strategic reasoning, and results like this one clarify which economic phenomena are robust to how the strategic interaction is formalized. The finding that cost asymmetry alone dictates whether delayed information can destabilize a quantum market, while entanglement and protocol merely shift the danger zone, offers a compact and testable intuition: the more lopsided the competition, the less tolerance the market has for stale information, and once the imbalance crosses the algebraic window bounded by 3 plus or minus 2 times the square root of 2, every quantum formulation inherits the same fragility. For a field still debating the right way to quantize a game, a result that survives the change of protocol is a small landmark, and a reminder that sometimes the deepest structure in a quantum model is the classical economics hiding underneath.</p>
<p><strong>Subject of Research:</strong> Stability and delayed-information dynamics of quantum entangled Cournot duopoly games</p>
<p><strong>Article Title:</strong> Delayed information and quantum entanglement in Cournot duopoly: a protocol-invariant boundary for oscillatory instability</p>
<p><strong>Article References:</strong> Guerrini, L., &amp; Ragni, S. (2026). Delayed information and quantum entanglement in Cournot duopoly: a protocol-invariant boundary for oscillatory instability. <em>Quantum Information Processing, 25</em>(10), Article 333. <a href="https://doi.org/10.1007/s11128-026-05359-y" rel="noopener noreferrer">https://doi.org/10.1007/s11128-026-05359-y</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> <a href="https://doi.org/10.1007/s11128-026-05359-y" rel="noopener noreferrer">10.1007/s11128-026-05359-y</a></p>
<p><strong>Keywords:</strong> quantum game theory, Cournot duopoly, entanglement, delayed information, Nash equilibrium, Hopf bifurcation, isoelastic demand, stability switching, cost asymmetry, delay differential equations, oscillatory instability, Quantum Information Processing</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">237924</post-id>	</item>
	</channel>
</rss>
