<?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>Game-Theory on Karpoke - Just Another Blog</title><link>http://karpoke.ignaciocano.com/tags/game-theory/</link><description>Recent content in Game-Theory on Karpoke - Just Another Blog</description><generator>Hugo -- 0.167.0</generator><language>es</language><lastBuildDate>Tue, 04 Nov 2025 16:51:45 +0100</lastBuildDate><atom:link href="http://karpoke.ignaciocano.com/tags/game-theory/index.xml" rel="self" type="application/rss+xml"/><item><title>La teoría de juegos de cómo los algoritmos pueden hacer subir los precios</title><link>http://karpoke.ignaciocano.com/2025/11/04/la-teoria-de-juegos-de-como-los-algoritmos-pueden-hacer-subir-los-precios/</link><pubDate>Tue, 04 Nov 2025 16:51:45 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2025/11/04/la-teoria-de-juegos-de-como-los-algoritmos-pueden-hacer-subir-los-precios/</guid><description>&lt;blockquote&gt;
&lt;p&gt;Estudios recientes revelan que incluso los algoritmos de fijación de
precios más simples pueden encarecer las cosas.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;p&gt;» César Tomé | &lt;a href="https://culturacientifica.com/2025/11/04/la-teoria-de-juegos-de-como-los-algoritmos-pueden-hacer-subir-los-precios/"&gt;culturacientifica.com&lt;/a&gt;&lt;/p&gt;</description></item><item><title>An unbeatable computer program has finally solved two-player limit Texas hold’em poker</title><link>http://karpoke.ignaciocano.com/2015/01/10/an-unbeatable-computer-program-has-finally-solved-two-player-limit-texas-holdem-poker/</link><pubDate>Sat, 10 Jan 2015 22:27:00 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2015/01/10/an-unbeatable-computer-program-has-finally-solved-two-player-limit-texas-holdem-poker/</guid><description>&lt;blockquote&gt;
&lt;p&gt;Two-player limit Texas hold’em poker has finally been solved,
according to a study published in Science today. Scientists have
designed a computer program, named Cepheus, with a strategy for the
game that is so close to perfect that statistical analysis shows it
can’t be defeated by a human poker player, even if that player
competed against the computer for an entire lifetime. This means that
no matter how the game starts out, the computer will win or break even
in the long run — making it essentially unbeatable. » &lt;a href="http://poker.srv.ualberta.ca/"&gt;Cepheus&lt;/a&gt;&lt;/p&gt;
&lt;/blockquote&gt;</description></item><item><title>The Emerging Revolution in Game Theory</title><link>http://karpoke.ignaciocano.com/2012/08/20/the-emerging-revolution-in-game-theory/</link><pubDate>Mon, 20 Aug 2012 00:17:00 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2012/08/20/the-emerging-revolution-in-game-theory/</guid><description>&lt;blockquote&gt;
&lt;p&gt;The world of game theory is currently on fire. In May, Freeman Dyson
at Princeton University and William Press at the University of Texas
announced that they had discovered a previously unknown strategy for
the game of prisoner’s dilemma which guarantees one player a better
outcome than the other.&lt;/p&gt;
&lt;p&gt;That’s a monumental surprise. Theorists have studied Prisoner’s
Dilemma for decades, using it as a model for the emergence of
co-operation in nature. This work has had a profound impact on
disciplines such as economics, evolutionary biology and, of course,
game theory itself. The new result will have impact in all these areas
and more.&lt;/p&gt;
&lt;p&gt;The game is this: imagine Alice and Bob have committed a crime and are
arrested. The police offer each one a deal&amp;ndash;snitch and you go free
while your friend does 6 months in jail. If both Alice and Bob snitch,
they both get 3 months in jail. If they both remain silent, they both
get one month in jail for a lesser offence.&lt;/p&gt;
&lt;p&gt;What should Alice and Bob do?&lt;/p&gt;
&lt;/blockquote&gt;</description></item></channel></rss>