Kahlert School of Computing, University of Utah’s Post

Hollywood's loss is our gain! After leaving Eastern Michigan University where he studied 3D simulation and animation, Darian Hogue took advantage of free online courses in software engineering from Harvard University. Now, Darian is a software engineer with Mcity where he incorporates traffic light data into the UMTRI Smart Intersections Project, makes upgrades to Mcity OS, and creates a 3D map for the development of a simulated test facility. Learn more about Darian and how he juggles his creativity in software development and being a father: https://myumi.ch/N6kEV

Excited to share my latest blog post titled "Hiding Images in Plain Sight: The Physics of Magic Windows [Using Caustics]." In this article, we delve into the fascinating world of caustics and explore how they can be utilized to create stunning visual effects that play with perception. Understanding the physics behind these phenomena can unlock powerful applications in fields ranging from design to engineering. I invite you to read the full post to discover how magic windows can transform the way we think about visibility and concealment in visual arts and technology. Check it out here: https://ift.tt/qa1KsjJ.

Futuristic Frontiers: Collecting Sci-Fi and Cyberpunk Armor Fast forward to the future with a focus on collecting sci-fi and cyberpunk-inspired armor. This post explores the futuristic and cutting-edge designs found in speculative fiction, from space-age armor to cybernetic enhancements. Join us in appreciating the imaginative and boundary-pushing creations that collectors embrace as they venture into the realms of science fiction and cyberpunk aesthetics.

Game theory tries to help us understand the dynamics of cooperation and competition within complex adaptive systems - an important aspect to enabling systems innovation. You can find the full course here: https://bit.ly/3SI5y2J This course is a gentle introduction to game theory and it should be accessible to all. Unlike a more traditional course in game theory, the aim of this course will not be on the formalities of classical game theory and solving for Nash equilibrium, but instead using this modelling framework as a tool for reasoning about the real-world dynamics of cooperation and competition.

Gotta Prompt 'Em All! I had 5 LLMs battle it out in a Pokémon tournament to see who would be the very best. Inspired by the PokéLLMon paper from Georgia Institute of Technology, I set out to identify the Elite Four and the Champion among different LLMs. After several rounds of battles, Anthropic Claude Opus, now available on Amazon Bedrock, emerged victorious. Read my latest blog post to learn more about the experiment, the models' strategies, and the results. https://lnkd.in/e4aXzAr6

Guest lecture by visiting Professor Philip Brown on understanding the practical relevance of worst-case equilibria in games 💡 A central theme of game theory research in recent decades has focused on deriving bounds on the worst-case performance of equilibria in noncooperative games. In much recent literature, selecting agent incentives or payoff functions to optimize worst-case equilibria has been a central research goal. However, little work has focused on understanding the practical relevance of worst-case equilibria themselves. Are these equilibria common? Are they stable? Brown, Assistant Professor at the University of Colorado, will provide recently found evidence that worst-case equilibria are less "scary" than previously thought. The fundamental tradeoff between the efficiency of equilibria and their stability will be discussed, as well as a proposed paradigm of distributed algorithm design which exploits this tradeoff to ensure that agents never converge to worst-case equilibria. 📆 June 21st, 2024 ⏰ 11:00 - 12:00 (welcome with coffee at 10:45) 📍 Gemini South 0.05, TU/e Find out more and sign up here! 👇 https://lnkd.in/eVFmbGQ8

My latest talk is online! 📺🌞 https://lnkd.in/dXWnmWBr I talk about my methods of discovering cool game art tricks (which I then document on my blog) by asking around, doing research, using mod tools or injecting into the rendering process with Intel GPA, RenderDoc or NVIDIA NSight. #gamedev #realtimevfx #techart #rendering

You can see our #courseleader at all our open days at Sheffield Hallam University Computer Science; explaining why Sheffield Hallam University really is the right choice for your next step.

Understanding whether there is an efficient algorithm for approximate Nash equilibrium has been the central open problem in this field for the past decade. We prove several intractability theorems for different settings (two-player games and many-player games) and models (computational complexity, query complexity, and communication complexity). In particular, our main result is that under a plausible and natural complexity assumption ("Exponential Time Hypothesis for PPAD"), there is no polynomial-time algorithm for finding an approximate Nash equilibrium in two-player games. Get Hardness of Approximation Between P and NP here: https://bit.ly/3omoTLp Author: Aviad Rubinstein, Stanford University #gametheory #approximate #Nash #equilibrium #computational #intractability #Brouwersfixedpoint #CourseMatch #multiplayergames #PPADhardnessofapproximation ACM, Association for Computing Machinery

Understanding whether there is an efficient algorithm for approximate Nash equilibrium has been the central open problem in this field for the past decade. We prove several intractability theorems for different settings (two-player games and many-player games) and models (computational complexity, query complexity, and communication complexity). In particular, our main result is that under a plausible and natural complexity assumption ("Exponential Time Hypothesis for PPAD"), there is no polynomial-time algorithm for finding an approximate Nash equilibrium in two-player games. Get Hardness of Approximation Between P and NP here: https://bit.ly/3omoTLp Author: Aviad Rubinstein, Stanford University #gametheory #approximate #Nash #equilibrium #computational #intractability #Brouwersfixedpoint #CourseMatch #multiplayergames #PPADhardnessofapproximation ACM, Association for Computing Machinery