Proof systems and transformation games
From MaRDI portal
Publication:354613
DOI10.1007/S10472-012-9323-9zbMATH Open1272.91022OpenAlexW2029955772MaRDI QIDQ354613FDOQ354613
Authors: Yoram Bachrach, Michael Zuckerman, M. J. Wooldridge, Jeffrey S. Rosenschein
Publication date: 19 July 2013
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.631.4209
Recommendations
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Complexity of proofs (03F20)
Cites Work
- Introduction to algorithms
- The Nucleolus of a Characteristic Function Game
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimum cost spanning tree games
- Introduction to the Theory of Cooperative Games
- Title not available (Why is that?)
- A course in game theory.
- Multiagent Systems
- Linear logic
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Multilinear extensions and the banzhaf value
- Title not available (Why is that?)
- Computational Aspects of Cooperative Game Theory
- The complexity of counting in sparse, regular, and planar graphs
- On the Complexity of Cooperative Solution Concepts
- Evaluating cooperative game theory in water resources
- Handbook of game theory with economic applications. Vol. 2
- A heuristic technique for multi-agent planning
- Cost allocation in shortest path games
- On the computational complexity of weighted voting games
- On the computational complexity of coalitional resource games
- False-name manipulations in weighted voting games
- The least-core of threshold network flow games
- Efficient auction mechanisms for supply chain procurement
- Confidentiality and information sharing in supply chain coordination
- Minimal subsidies in expense sharing games
- The Cost of Stability in Network Flow Games
- The Complexity of Power-Index Comparison
- A test suite for the evaluation of mixed multi-unit combinatorial auctions
- Proof systems and transformation games
- A New Solution Concept for Coalitional Games in Open Anonymous Environments
- Power Indices in Spanning Connectivity Games
- The cost of stability in coalitional games
- Title not available (Why is that?)
- False-name-proof voting with costs over two alternatives
- Manipulating the quota in weighted voting games
- Computing cooperative solution concepts in coalitional skill games
- Sharing rewards in cooperative connectivity games
- NP-completeness for calculating power indices of weighted majority games
- Congestion games with failures
- Congestion games with load-dependent failures: Identical resources
Cited In (7)
- From parity games to circular proofs
- Parity Games and Propositional Proofs
- Title not available (Why is that?)
- 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)