Zur Theorie der Gesellschaftsspiele

1928/12/01 by J. v. Neumann · 2,603 citations
Mathematics · Social Sciences · #Humanities #Mathematics #Philosophy #Weber, Simmel, Sociological Theory

paper · doi:10.1007/bf01448847

published in Mathematische Annalen 100(1), 295-320 (Springer Nature)

openalex publication_date 1928/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23

Cited by

• Selforganization of matter and the evolution of biological macromolecules
• Lagrange Multipliers and Optimality
• Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games
• Computing Equilibria in Games with Stochastic Action Sets
• Moonflowers and efficient code sparsification
• The Complexity of Computing a Nash Equilibrium
• Constant Rank Two-Player Games are PPAD-hard
• Fundamental limits for thermodynamic control with quantum feedback
• Last-iterate convergence rates for min-max optimization
• Unilaterally Competitive Multi-Player Stopping Games
• The layer complexity of Arthur-Merlin-like communication
• State Information in Bayesian Games
• Minimax Value Interval for Off-Policy Evaluation and Policy Optimization
• Principles of Quantum Communication Theory: A Modern Approach
• Rethinking Generative Mode Coverage: A Pointwise Guaranteed Approach
• Generative Adversarial Networks (GANs): What it can generate and What it cannot?
• Certifying Concavity and Monotonicity in Games via Sum-of-Squares Hierarchies
• Solving Combinatorial Games using Products, Projections and Lexicographically Optimal Bases
• Investigations in quantum games using EPR-type set-ups
• GANGs: Generative Adversarial Network Games
• A Game-Theoretic Approach for Adversarial Information Fusion in Distributed Sensor Networks
• An Elementary Proof of a Minimax Theorem
• Centipedes Leap into the Quantum Realm
• A Scenario Approach to the Robustness of Nonconvex-Nonconcave Minimax Problems
• Matrix games with bandit feedback
• Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back
• Solutions of Two-stage Stochastic Minimax Problems
• Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games
• Targeted Advertising Platforms: Data Sharing and Customer Poaching
• Minimax Theorems for Possibly Nonconvex Functions
• Accelerated Dinkelbach method
• Proximal Gradient Descent-Ascent: Variable Convergence under KŁ Geometry
• CNN-based Steganalysis and Parametric Adversarial Embedding: a Game-Theoretic Framework
• Kac's formula, vertices of chains and equidecomposability of functions and enhanced functions (PHD thesis)
• The Optimal Approximation Factor in Density Estimation
• On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
• Social game theory: Preferences, perceptions, and choices
• Vortices Instead of Equilibria in MinMax Optimization: Chaos and Butterfly Effects of Online Learning in Zero-Sum Games
• Bandit Algorithms
• The value of random zero-sum games
• A Low-Rank Symplectic Gradient Adjustment Method for Computing Nash Equilibria
• Forecast Hedging and Calibration
• Deep Pepper: Expert Iteration based Chess agent in the Reinforcement Learning Setting
• Robust two-stage combinatorial optimization problems under convex uncertainty
• A projection-free dynamics for nonsmooth composite optimization
• Optimizing Feature Ordering in Radar Charts for Multi-Profile Comparison
• Learning to Play No-Press Diplomacy with Best Response Policy Iteration
• Settling the Complexity of Computing Two-Player Nash Equilibria
• Risk-Averse Equilibrium for Games
• Finding a Nash equilibrium of a random win-lose game in expected polynomial time
• Semi-infinite Nonconvex Constrained Min-Max Optimization
• Robust Least Squares Problems with Binary Uncertain Data
• Cooperation, psychological game theory, and limitations of rationality in social interaction
• Storage Participation in Electricity Markets: Arbitrage and Ancillary Services
• Sample compression schemes for VC classes
• An Approximate Dynamic Programming Approach to Adversarial Online Learning
• Graph curvature via resistance distance
• The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
• On the O(1/T) Convergence of Alternating Gradient Descent-Ascent in Bilinear Games
• Economic analysis, history of economic thought and ontology: the case of Léon Walras
• Quantum Measurement Trees, I: Two Preliminary Examples of Induced Contextual Boolean Algebras
• Quantum Measurement Trees, II: Quantum Observables as Ortho-Measurable Functions and Density Matrices as Ortho-Probability Measures
• A regret minimization approach to fixed-point iterations
• A Novel Framework for Honey-X Deception in Zero-Sum Games
• Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization
• HSVI for zs-POSGs using Concavity, Convexity and Lipschitz Properties
• A horizon tour of box-total dual integrality
• Efficient representations for team and imperfect-recall equilibrium computation
• What is Local Optimality in Nonconvex-Nonconcave Minimax Optimization?
• Game-Theoretic Multiagent Reinforcement Learning
• A Minimax Converse for Quantum Channel Coding
• Evolutionary games on graphs
• Computing all Nash equilibria of low-rank bi-matrix games
• Pure Nash Equilibria and Best-Response Dynamics in Random Games
• Extracting and charging energy into almost unknown quantum states
• Efficiently Computing Equilibria in Budget-Aggregation Games
• A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
• Generalized Quantum Stein's Lemma for Classical-Quantum Dynamical Resources
• Algorithm for Overcoming the Curse of Dimensionality for State-dependent Hamilton-Jacobi equations
• Provable Self-Play Algorithms for Competitive Reinforcement Learning
• Contest vs. Competition in Cournot Duopoly: Schaffer's Paradox
• Adversarial Image Perturbation for Privacy Protection -- A Game Theory Perspective
• Playing Markov Games Without Observing Payoffs
• Characterizing and Computing the Set of Nash Equilibria via Vector Optimization
• Contested Route Planning
• Ordered field property for zero-sum stochastic games
• Hybrid Game Control Envelope Synthesis
• Minimax Analysis of Active Learning
• Security Games in Network Flow Problems
• A Note on Bayesian Rationality and Correlated Equilibrium
• Finite Regret and Cycles with Fixed Step-Size via Alternating Gradient Descent-Ascent
• Giraffe: Using Deep Reinforcement Learning to Play Chess
• Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes
• Parallel approximation of non-interactive zero-sum quantum games
• Provably Efficient Algorithms for Multi-Objective Competitive RL
• Robust Reinforcement Learning Under Minimax Regret for Green Security
• A Travel-Time Metric
• Linear programming duality for geometers
• Local AdaGrad-Type Algorithm for Stochastic Convex-Concave Optimization
• Zermelo and the Early History of Game Theory
• Nonconvex-Nonconcave Min-Max Optimization with a Small Maximization Domain
• Data-driven distributionally robust risk parity portfolio optimization
• Efficient exploration of zero-sum stochastic games
• Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries
• Tie-breaking Agnostic Lower Bound for Fictitious Play
• A Rockafellar Theorem for cyclically quasi-monotone maps: the regular non-vanishing case
• Towards Efficient Detection and Optimal Response against Sophisticated Opponents
• Game Theory for Adversarial Attacks and Defenses
• Preconditioned Halpern iteration with adaptive anchoring parameters and an acceleration to Chambolle-Pock algorithm
• Detection of coordinated fleet vehicles in route choice urban games. Part I. Inverse fleet assignment theory
• On testing the simulation theory
• Two-Player Zero-Sum Games with Bandit Feedback
• Minimax Optimization with Smooth Algorithmic Adversaries
• A logical analysis of Monty Hall and Sleeping Beauty
• A Simple Reward-free Approach to Constrained Reinforcement Learning
• On the Communication Complexity of Approximate Nash Equilibria
• Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization
• Learning to Plan via Supervised Contrastive Learning and Strategic Interpolation: A Chess Case Study
• Some remarks on convex analysis in topological groups
• Rationality and Escalation in Infinite Extensive Games
• Faster Rates for Convex-Concave Games
• Learning in Matching Games with Bandit Feedback
• Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step Sizes
• Distributionally Robust Learning in Survival Analysis
• Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization
• Constant Rank Bimatrix Games are PPAD-hard
• Linear Last-iterate Convergence in Constrained Saddle-point Optimization
• Alternating and Parallel Proximal Gradient Methods for Nonsmooth, Nonconvex Minimax: A Unified Convergence Analysis
• Reward is enough for convex MDPs
• Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization
• Two-Player Games for Efficient Non-Convex Constrained Optimization
• Search in Imperfect Information Games
• Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games
• A Direct Sum Result for the Information Complexity of Learning
• Support Contraction for Well-Supported Nash Equilibria
• Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
• Programming a computer to play chess
• An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
• Does stress make us more—or less—prosocial? A systematic review and meta-analysis of the effects of acute stress on prosocial behaviours using economic games
• Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty
• On Fundamental Limits of Robust Learning
• Cooperation in Subset Team Games: Altruism and Selfishness
• A Hölderian backtracking method for min-max and min-min problems
• Equilibrium Value Method for the Proof of QIP=PSPACE
• The Death of Neoclassical Economics
• 90+ years of the Scottish Book
• Trade Using One Commodity as a Means of Payment
• Direct-Search for a Class of Stochastic Min-Max Problems
• Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
• A Variational Framework for LLM Generator-Regulator Games
• Cumulative Games: Who is the current player?
• Chemical Game Theory
• Die Habilitation von John von Neumann an der Friedrich-Wilhelms-Universität in Berlin: Urteile über einen ungarisch-jüdischen Mathematiker in Deutschland im Jahr 1927
• John von Neumann’s work in the theory of games and mathematical economics
• A Walk through Johnny von Neumann’s Garden
• The Nature of Computation
• MiniMax Learning of Interpretable Factored Stochastic Policies from Conjoint Data, with Uncertainty Quantification
• Computing Graph Properties by Randomized Subcube Partitions
• A data-independent distance to infeasibility for linear conic systems
• Settling the Complexity of Two-Player Nash Equilibrium
• Tit for Tat and Beyond: The Legendary Work of Anatol Rapoport
• Solving diner’s dilemma game, circuit implementation and verification on the IBM quantum simulator
• Performance guarantees of light-cone variational quantum algorithms for the maximum cut problem
• Maximal pattern complexity and structure of null systems
• Minimax asymptotics
• A resource theory of quantum measurements
• Heads-up limit hold’em poker is solved
• Randomized Strategies for Robust Combinatorial Optimization
• Extensive-form game [wikipedia]
• Game theory [wikipedia]
• John von Neumann [wikipedia]
• Morals matter in economic games. [europepmc]
• Exploring Cooperative Transboundary River Management Strategies for the Eastern Nile Basin. [europepmc]
• Quantum Games with Unawareness. [europepmc]
• RestraintMaker: a graph-based approach to select distance restraints in free-energy calculations with dual topology. [europepmc]
• Chess AI: Competing Paradigms for Machine Intelligence. [europepmc]
• The Contribution of Evolutionary Game Theory to Understanding and Treating Cancer. [europepmc]
• Modelling coupled human-environment complexity for the future of the biosphere: strengths, gaps and promising directions. [europepmc]
• A free boundary problem-in time-for the spread of Covid-19. [europepmc]
• Strategy investments in zero-sum games. [europepmc]
• An Empirical Study of Self-Supervised Learning with Wasserstein Distance. [europepmc]
• Decision-Making in Repeated Games: Insights from Active Inference. [europepmc]
• Asymptotic quantification of entanglement with a single copy. [europepmc]
• On the Perceptron’s Compression [europepmc]