<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>博弈论 on Blog</title><link>https://icelemon.top/tags/%E5%8D%9A%E5%BC%88%E8%AE%BA/</link><description>Recent content in 博弈论 on Blog</description><generator>Hugo</generator><language>zh-CN</language><lastBuildDate>Mon, 19 Oct 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://icelemon.top/tags/%E5%8D%9A%E5%BC%88%E8%AE%BA/index.xml" rel="self" type="application/rss+xml"/><item><title>多修一条路，为什么可能让所有人更慢</title><link>https://icelemon.top/knowledge/braess-paradox/</link><pubDate>Mon, 19 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/knowledge/braess-paradox/</guid><description>布雷斯悖论揭示了个人最优路线与整个路网效率之间的差别。</description></item><item><title>稳定匹配：为什么先提议的一方更有利</title><link>https://icelemon.top/knowledge/stable-matching/</link><pubDate>Mon, 19 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/knowledge/stable-matching/</guid><description>同一份偏好名单，换一组人发出提议，怎样得到不同的稳定结果。</description></item><item><title>一美元拍卖，怎样把竞争推向两败俱伤</title><link>https://icelemon.top/knowledge/dollar-auction/</link><pubDate>Mon, 19 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/knowledge/dollar-auction/</guid><description>每一步都像是在减少损失，连续下去却可能让损失越来越大。</description></item><item><title>以牙还牙：简单规则怎样维持合作</title><link>https://icelemon.top/knowledge/tit-for-tat/</link><pubDate>Mon, 19 Oct 2026 00:00:00 +0800</pubDate><guid>https://icelemon.top/knowledge/tit-for-tat/</guid><description>先合作，再回应上一轮的选择。它的优势，要放在重复互动里理解。</description></item></channel></rss>