2002•International Journal of Game TheoryRequires access

On computational complexity of membership test in flow games and linear production games

Qizhi Fang, Shanfeng Zhu, Mao-cheng Cai, Xiaotie Deng

Open publisher page 31 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 31 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Mathematics, Core (optical fiber), Mathematical economics, Example of a game without a value, Time complexity, Production (economics), Sequential game, Repeated game

Back to paper search Browse research topics Original source

On computational complexity of membership test in flow games and linear production games — Research Paper | ScholarLens