La teoría de juegos de cómo los algoritmos pueden hacer subir los precios
Estudios recientes revelan que incluso los algoritmos de fijación de precios más simples pueden encarecer las cosas. » César Tomé | culturacientifica.com
Estudios recientes revelan que incluso los algoritmos de fijación de precios más simples pueden encarecer las cosas. » César Tomé | culturacientifica.com
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. » Cepheus ...
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. 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. The game is this: imagine Alice and Bob have committed a crime and are arrested. The police offer each one a deal–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. What should Alice and Bob do? ...