Some Tractable Win-Lose Games (Q3010417): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 06:45, 4 July 2024

scientific article

Language	Label	Description	Also known as
English	Some Tractable Win-Lose Games	scientific article

Statements

scholarly article

0 references

Some Tractable Win-Lose Games (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-20877-5_36

0 references

0 references

Nagarajan Krishnamurthy

0 references

Lecture Notes in Computer Science

0 references

publication date

1 July 2011

0 references

full work available at URL

https://arxiv.org/abs/1010.5951

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games

0 references

An approach to the subgraph homeomorphism problem

0 references

Settling the complexity of computing two-player Nash equilibria

0 references

0 references

Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games

0 references

The Complexity of Computing a Nash Equilibrium

0 references

Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space.

0 references

Dividing a Graph into Triconnected Components

0 references

Non-cooperative games

0 references

On the complexity of the parity argument and other inefficient proofs of existence

0 references

Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space

0 references

NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3010417

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3010417&oldid=35236178"