in General Awareness recategorized by
132 views
0 votes
0 votes

Constantinos Daskalakis proved that computing the Nash equilibrium for a three-person game is computationally ________

  1. Tractable
  2. in P
  3. Intractable
  4. Decidable
in General Awareness recategorized by
12.0k points
132 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true