Search Results for author:
Found 14 papers, 1 papers with code
Performance rating in chess, tennis, and other contexts
The main theorem establishes that the PR$^e$ of a player is equivalent to the TPR whenever the latter is defined.
Social preferences and expected utility
It is well known that ex ante social preferences and expected utility are not always compatible.
Human and Machine Intelligence in n-Person Games with Partial Knowledge: Theory and Computation
This score quantifies the ex-post strategic ability of the players based on empirically observable information, such as the actions of the players, the game's outcome, strength of the players, and a reference oracle machine such as a chess-playing artificial intelligence system.
Fairer Shootouts in Soccer: The $m-n$ Rule
We call this the $m - n$ rule and, more specifically, propose $(m, n)$ = (5, 4): For A to win, it must successfully kick 5 goals before the end of the round in which B kicks its 4th; for B to win, it must succeed on 4 penalty kicks before A succeeds on 5.
AI-powered mechanisms as judges: Breaking ties in chess and beyond
To reduce the growing incidence of draws, many elite tournaments have resorted to fast chess tiebreakers.
Exploring the Constraints on Artificial General Intelligence: A Game-Theoretic No-Go Theorem
The emergence of increasingly sophisticated artificial intelligence (AI) systems have sparked intense debate among researchers, policymakers, and the public due to their potential to surpass human intelligence and capabilities in all domains.
Rationality and correctness in n-player games
In contrast, mutual knowledge of conjectures assumes that a given profile of conjectures is mutually known, which has long been recognized as a strong assumption.
Credible equilibrium
Credible equilibrium is a solution concept that imposes a stronger credibility notion than subgame perfect equilibrium.
Fairer Chess: A Reversal of Two Opening Moves in Chess Creates Balance Between White and Black
Unlike tic-tac-toe or checkers, in which optimal play leads to a draw, it is not known whether optimal play in chess ends in a win for White, a win for Black, or a draw.
Conditional strategy equilibrium
In this note, we prove the existence of an equilibrium concept, dubbed conditional strategy equilibrium, for non-cooperative games in which a strategy of a player is a function from the other players' actions to her own actions.
No-harm principle, rationality, and Pareto optimality in games
Mill's classic argument for liberty requires that people's exercise of freedom should be governed by a no-harm principle (NHP).
Proportional resource allocation in dynamic n-player Blotto games
A variety of social, economic, and political interactions have long been modelled after Blotto games.
Super-Nash performance in games
Since the 1990s, artificial intelligence (AI) systems have achieved 'superhuman performance' in major zero-sum games, where winning has an unambiguous definition.
The strategy of conflict and cooperation
This paper introduces a unified framework called cooperative extensive form games, which (i) generalizes standard non-cooperative games, and (ii) allows for more complex coalition formation dynamics than previous concepts like coalition-proof Nash equilibrium.
