Recommendations
Cites work
- scientific article; zbMATH DE number 5076448 (Why is no real title available?)
- scientific article; zbMATH DE number 4053069 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2201583 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- scientific article; zbMATH DE number 3078999 (Why is no real title available?)
- A New Solution Concept for Coalitional Games in Open Anonymous Environments
- A course in game theory.
- A heuristic technique for multi-agent planning
- A test suite for the evaluation of mixed multi-unit combinatorial auctions
- Computational Aspects of Cooperative Game Theory
- Computing cooperative solution concepts in coalitional skill games
- Confidentiality and information sharing in supply chain coordination
- Congestion games with failures
- Congestion games with load-dependent failures: Identical resources
- Cost allocation in shortest path games
- Efficient auction mechanisms for supply chain procurement
- Evaluating cooperative game theory in water resources
- False-name manipulations in weighted voting games
- False-name-proof voting with costs over two alternatives
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Handbook of game theory with economic applications. Vol. 2
- Introduction to algorithms
- Introduction to the Theory of Cooperative Games
- Linear logic
- Manipulating the quota in weighted voting games
- Minimal subsidies in expense sharing games
- Minimum cost spanning tree games
- Multiagent Systems
- Multilinear extensions and the banzhaf value
- NP-completeness for calculating power indices of weighted majority games
- On the Complexity of Cooperative Solution Concepts
- On the computational complexity of coalitional resource games
- On the computational complexity of weighted voting games
- Power Indices in Spanning Connectivity Games
- Proof systems and transformation games
- Sharing rewards in cooperative connectivity games
- The Complexity of Power-Index Comparison
- The Cost of Stability in Network Flow Games
- The Nucleolus of a Characteristic Function Game
- The complexity of counting in sparse, regular, and planar graphs
- The cost of stability in coalitional games
- The least-core of threshold network flow games
Cited in
(7)- From parity games to circular proofs
- Parity Games and Propositional Proofs
- scientific article; zbMATH DE number 1231521 (Why is no real title available?)
- Proof systems and transformation games
- Parity Games and Propositional Proofs
- Analyzing power in weighted voting games with super-increasing weights
- Analyzing power in weighted voting games with super-increasing weights
This page was built for publication: Proof systems and transformation games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354613)