Category Theory
Zulip Server
Archive

You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.


Stream: deprecated: economics

Topic: Anti-inductive


view this post on Zulip Faré (Apr 09 2020 at 08:17):

Have you read the "markets are anti-inductive" essay by Eliezer Yudkowski? https://www.lesswrong.com/posts/h24JGbmweNpWZfBkM/markets-are-anti-inductive
How would you translate that in terms of games and categories?
It's like there is always a meta-game such that any winning game that can be known (including by observing others who play it) thereby becomes a losing game as the knowledge is actively used.
@Jules Hedges

(Copied from #general topic "economics stream")

view this post on Zulip Johannes Drever (Apr 09 2020 at 18:10):

This paper by Tatsuya Nomura seems relevant to model recursive dynamical systems. It's based on the paper Self-Reference and Fixed Points, which in turn is based on Lawvere's fix-point theorem.

view this post on Zulip Oscar Cunningham (Apr 10 2020 at 07:19):

I don't think it's necessary for markets to be Keynesian beauty contests in order to be unpredictable. Eliezer is just talking about the Efficient-market hypothesis.

view this post on Zulip Faré (Apr 10 2020 at 09:44):

How would you represent the fact that in some application that involves transfers of assets between participants, at every moment, the balance of each asset for each participant is non-negative, and that the sum total of every asset is constant, modulo explicit deposit/withdrawal/creation/destruction operations?

view this post on Zulip Faré (Apr 10 2020 at 09:45):

That would be some kind of accounting structure that enriches the session types of the application.

view this post on Zulip Jules Hedges (Apr 10 2020 at 09:53):

Fun fact: If you replace argmax:(XR)P(X)\arg\max : (X \to \mathbb R) \to \mathcal P (X) with fix:(XX)P(X)\mathrm{fix} : (X \to X) \to \mathcal P (X) in basic game theory you get a beauty contest, where the goal of maximisation is replaced with the goal of coordination http://www.cs.ox.ac.uk/people/julian.hedges/papers/games.pdf