Proof systems and transformation games
type: Item
instance of: scholarly article
title: Proof systems and transformation games
zbMATH Open document ID: 1272.91022
author: Yoram Bachrach
author: Michael Zuckerman
author: M. J. Wooldridge
author: Jeffrey S. Rosenschein
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2013-07-19T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6189550
zbMATH Keywords: transformation games
zbMATH Keywords: supply chains
zbMATH Keywords: core
zbMATH Keywords: Shapley value
zbMATH Keywords: power indices
zbMATH Keywords: cooperative proof systems
MaRDI profile type: Publication
OpenAlex ID: W2029955772
cites work: Handbook of game theory with economic applications. Vol. 2
cites work: False-Name Manipulations in Weighted Voting Games
cites work: Power Indices in Spanning Connectivity Games
cites work: The Least-Core of Threshold Network Flow Games
cites work: Congestion games with load-dependent failures: Identical resources
cites work: The Cost of Stability in Coalitional Games
cites work: On the computational complexity of coalitional resource games
cites work: Minimum cost spanning tree games
cites work: Computing cooperative solution concepts in coalitional skill games
cites work: Sharing Rewards in Cooperative Connectivity Games
cites work: Proof Systems and Transformation Games
cites work: Computational Aspects of Cooperative Game Theory
cites work: Efficient Auction Mechanisms for Supply Chain Procurement
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Introduction to algorithms
cites work: Q3410593
cites work: On the Complexity of Cooperative Solution Concepts
cites work: A heuristic technique for multi-agent planning
cites work: Evaluating cooperative game theory in water resources
cites work: On the computational complexity of weighted voting games
cites work: The Complexity of Power-Index Comparison
cites work: Q4198056
cites work: Q3789107
cites work: Q5313998
cites work: Q5817872
cites work: A test suite for the evaluation of mixed multi-unit combinatorial auctions
cites work: Linear logic
cites work: Cost allocation in shortest path games
cites work: Confidentiality and Information Sharing in Supply Chain Coordination
cites work: NP-completeness for calculating power indices of weighted majority games
cites work: Minimal Subsidies in Expense Sharing Games
cites work: Q3576736
cites work: Multilinear extensions and the banzhaf value
cites work: Introduction to the Theory of Cooperative Games
cites work: Congestion games with failures
cites work: The Cost of Stability in Network Flow Games
cites work: The Nucleolus of a Characteristic Function Game
cites work: Q5817870
cites work: Multiagent Systems
cites work: The complexity of counting in sparse, regular, and planar graphs
cites work: False-name-proof voting with costs over two alternatives
cites work: A New Solution Concept for Coalitional Games in Open Anonymous Environments
cites work: Manipulating the quota in weighted voting games
DOI: 10.1007/S10472-012-9323-9
description: scientific article; zbMATH DE number 6189550