COST AND COMPLEXITY OF HARNESSING GAMES WITH PAYMENTS

DOI10.1142/S0219198911002824zbMath1247.91015MaRDI QIDQ2907961

Stefan Schmid, Raphael Eidenbenz, Yvonne Anne Pignolet, Roger Wattenhofer

Publication date: 4 September 2012

Published in: International Game Theory Review (Search for Journal in Brave)

zbMATH Keywords

optimal strategyNP-hardnessleveragepayoff functionapproximation ratioimperfect information gamemulti-player game structureuniform game modelsworst-case implementation cost

Mathematics Subject Classification ID

Noncooperative games (91A10) Utility theory (91B16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Extracting interaction-created surplus
• Fault tolerant mechanism design
• Nash Equilibrium and Welfare Optimality
• Algorithmic Game Theory

This page was built for publication: COST AND COMPLEXITY OF HARNESSING GAMES WITH PAYMENTS