Cover Image

The Impacts of Increasingly Complex Matchup Models on Baseball Win Probability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mott, Tristan, Bradshaw, Caleb, Grimsman, David, Archibald, Christopher
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Winning Without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round
by: Blum, Avrim, et al.
Published: (2024)

Improving Cooperation in Language Games with Bayesian Inference and the Cognitive Hierarchy
by: Bills, Joseph, et al.
Published: (2024)

In This Apportionment Lottery, the House Always Wins
by: Gölz, Paul, et al.
Published: (2022)

Properties of Winning Iterated Prisoner's Dilemma Strategies
by: Glynatsi, Nikoleta E., et al.
Published: (2020)

The Complexity of Sparse Win-Lose Bimatrix Games
by: Batziou, Eleni, et al.
Published: (2026)

Synthesizing Permissive Winning Strategy Templates for Parity Games
by: Anand, Ashwani, et al.
Published: (2023)

Most General Winning Secure Equilibria Synthesis in Graph Games
by: Nayak, Satya Prakash, et al.
Published: (2024)

Augmented Probability Simulation Methods for Sequential Games
by: Ekin, Tahir, et al.
Published: (2019)

Nash Equilibria with Derangement Degree Probabilities
by: Orzech, Edan, et al.
Published: (2026)

Online Temporal Voting: Strategyproofness, Proportionality and Asymptotic Analysis
by: Borodin, Allan, et al.
Published: (2026)

Can a Weaker Player Win? Adaptive Play in Repeated Games
by: ANSELMI, Jonatha, et al.
Published: (2026)

Designing Inferable Signaling Schemes for Bayesian Persuasion
by: Probine, Caleb, et al.
Published: (2025)

Effects of Vote Delegation in Blockchains: Who Wins?
by: Gersbach, Hans, et al.
Published: (2024)

The Team Order Problem: Maximizing the Probability of Matching Being Large Enough
by: Aziz, Haris, et al.
Published: (2026)

Competitive Search with a Faulty Satnav (GPS): When Probability Matching is Rational
by: Alpern, Steve, et al.
Published: (2026)

Pursuit Winning Strategies for Reach-Avoid Games with Polygonal Obstacles
by: Yan, Rui, et al.
Published: (2024)

Winning Strategies for the Synchronization Game on Subclasses of Finite Automata
by: Fernau, Henning, et al.
Published: (2024)

Privacy-preserving Nash Equilibrium Synthesis with Partially Ordered Temporal Objectives
by: Probine, Caleb, et al.
Published: (2025)

The Complexity of Tullock Contests
by: He, Yu, et al.
Published: (2024)

The Query Complexity of Uniform Pricing
by: Chen, Houshuang, et al.
Published: (2025)

The Sample Complexity of Stackelberg Games
by: Bacchiocchi, Francesco, et al.
Published: (2024)

Complex Dynamics in Autobidding Systems
by: Leme, Renato Paes, et al.
Published: (2024)

The Competition Complexity of Prophet Secretary
by: Ezra, Tomer, et al.
Published: (2024)

The Complexity of Correlated Equilibria in Generalized Games
by: Bernasconi, Martino, et al.
Published: (2025)

The Complexity of Equilibrium Refinements in Potential Games
by: Anagnostides, Ioannis, et al.
Published: (2025)

The Complexity of Fair Division of Indivisible Items with Externalities
by: Deligkas, Argyrios, et al.
Published: (2023)

The Cost and Complexity of Minimizing Envy in House Allocation
by: Madathil, Jayakrishnan, et al.
Published: (2024)

Fair Division with Social Impact
by: Flammini, Michele, et al.
Published: (2024)

Multi-Organizational Scheduling: Individual Rationality, Optimality, and Complexity
by: Chen, Jiehua, et al.
Published: (2025)

Control in Stable Marriage and Stable Roommates: Complexity and Algorithms
by: Chen, Jiehua, et al.
Published: (2025)

The Panel Complexity of Sortition: Is 12 Angry Men Enough?
by: Brustle, Johannes, et al.
Published: (2025)

The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders
by: Qiu, Frederick V., et al.
Published: (2025)

Near-Feasible Solutions to Complex Stable Matching Problems
by: Csáji, Gergely
Published: (2025)

Navigating the Complexity Landscape of Nominee Selection in Schulze Voting
by: Cechlárová, Katarína, et al.
Published: (2026)

On the Complexity of Correlated Equilibria Beyond Normal-Form Games
by: Anagnostides, Ioannis, et al.
Published: (2026)

The Complexity of Two-Team Polymatrix Games with Independent Adversaries
by: Hollender, Alexandros, et al.
Published: (2024)

The Cost of Failure: On The Complexity of Recampaigning under Fixed Districts
by: Chavrimootoo, Michael C., et al.
Published: (2026)

Algorithms and Complexity of Influence Maximization on Directed Acyclic Graphs
by: Liu, Panfeng, et al.
Published: (2026)

When Contracts Get Complex: Information-Theoretic Barriers
by: Dütting, Paul, et al.
Published: (2024)

The Complexity of Proper Equilibrium in Extensive-Form and Polytope Games
by: Zhang, Brian Hu, et al.
Published: (2026)