Positive and negative determinant strategies enable unilateral payoff control in repeated games with behavior-value inconsistency costs, where zero-determinant strategies cease to exist.
MIT press, 1995
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.GT 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A safe exploration algorithm learns an unknown receiver bias parameter in repeated information design and achieves O(log log T) regret with a matching lower bound.
citing papers explorer
-
Positive and Negative Determinant Strategies in Repeated Games with Behavior-Value Inconsistency
Positive and negative determinant strategies enable unilateral payoff control in repeated games with behavior-value inconsistency costs, where zero-determinant strategies cease to exist.
-
Learning to Persuade a Biased Receiver
A safe exploration algorithm learns an unknown receiver bias parameter in repeated information design and achieves O(log log T) regret with a matching lower bound.