<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0">
  <channel>
    <docs>http://www.rssboard.org/rss-specification</docs>
    <atom:link rel="self" type="application/rss+xml" href="https://escholarship.org/uc/uci_imbs_colloquium/rss"/>
    <ttl>720</ttl>
    <title>Recent uci_imbs_colloquium items</title>
    <link>https://escholarship.org/uc/uci_imbs_colloquium/rss</link>
    <description>Recent eScholarship items from IMBS Colloquium</description>
    <pubDate>Wed, 2 Sep 2026 05:46:43 +0000</pubDate>
    <item>
      <title>Private Information, Prices, and Market Efficiency</title>
      <link>https://escholarship.org/uc/item/02n095p2</link>
      <description>&lt;p&gt;In our economy the most important prices--longterm interest rates, for example--are the aggregate result of many self-interested individuals strategically making trades based on their privately perceived costs, values, and expectations.  If these prices are to guide individuals into making efficient decisions, then each must be the competitive price that successfully clears its market and correctly impounds traders' private information.  Economists have long believed that markets do this well, but have been unclear as to how a market in fact extracts sufficient information from its participants in order to arrive at a close approximation to the competitive price.   Insight into this question may be obtained through understanding the incentives that the double auction gives participants to reveal their information. A double auction is a stylized market institution that explicitly recognizes that buyers and sellers' possess essential private information.  In equilibrium the double...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/02n095p2</guid>
      <pubDate>Fri, 15 Apr 2005 00:00:00 +0000</pubDate>
      <author>
        <name>Satterthwaite, Mark</name>
      </author>
    </item>
    <item>
      <title>Borda Scores and Aggregation of Preference: A Geometric-Combinatoric and a Topological Approach</title>
      <link>https://escholarship.org/uc/item/0d9018qj</link>
      <description>Borda Scores and Aggregation of Preference: A Geometric-Combinatoric and a Topological Approach</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/0d9018qj</guid>
      <pubDate>Wed, 10 Nov 2004 00:00:00 +0000</pubDate>
      <author>
        <name>Zhang, Jun</name>
      </author>
    </item>
    <item>
      <title>Constructing a Binomial Processing Tree through Selective Influence with Application to Immediate Serial Recall</title>
      <link>https://escholarship.org/uc/item/3966v8t7</link>
      <description>Constructing a Binomial Processing Tree through Selective Influence with Application to Immediate Serial Recall</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/3966v8t7</guid>
      <pubDate>Thu, 21 Oct 2004 00:00:00 +0000</pubDate>
      <author>
        <name>Schweickert, Richard</name>
      </author>
    </item>
    <item>
      <title>What's the Matter with Memory?</title>
      <link>https://escholarship.org/uc/item/9r79v8tc</link>
      <description>What's the Matter with Memory?</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/9r79v8tc</guid>
      <pubDate>Tue, 21 Sep 2004 00:00:00 +0000</pubDate>
      <author>
        <name>Loftus, Elizabeth</name>
      </author>
    </item>
    <item>
      <title>The Evolution of Cooperation Through Imitation</title>
      <link>https://escholarship.org/uc/item/45g5k560</link>
      <description>&lt;p&gt;We study when cooperation and conflict emerge in a class of “folk theorem” games such as the Prisoner’s Dilemma. We make use of two simple ideas: existing strategies are more likely to be imitated than new strategies are to be introduced, and it is possible to identify how an opponent will behave prior to the interaction. Both global interactions and the local interaction model of Ellison [1993] are examined. We use methods introduced by Kandori, Mailath and Rob [1993] and Young [1993] to examine the long-run evolutionary limit of this system. This limit contains only pure strategies. A sufficient condition for a unique limit is that a strategy beat all others in pairwise contests. When players can perfectly determine the strategy used by their opponent, full cooperation is achieved. When identification is imperfect, the long-run limit can be interpreted as a model of endogenous preferences where players who appear similar are treated altruistically, and players who appear...</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/45g5k560</guid>
      <pubDate>Tue, 21 Sep 2004 00:00:00 +0000</pubDate>
      <author>
        <name>Levine, David K.</name>
      </author>
    </item>
    <item>
      <title>How Poker, Baseball, and Fermat Teach Us the Best Way to Elect the President</title>
      <link>https://escholarship.org/uc/item/1nc0m3dc</link>
      <description>How Poker, Baseball, and Fermat Teach Us the Best Way to Elect the President</description>
      <guid isPermaLink="true">https://escholarship.org/uc/item/1nc0m3dc</guid>
      <pubDate>Tue, 21 Sep 2004 00:00:00 +0000</pubDate>
      <author>
        <name>Natapoff, Alan</name>
      </author>
    </item>
  </channel>
</rss>
