scientific article; zbMATH DE number 2038846

MaRDI QIDQ4449277zbMATH OpenFDO

Authors Dov Monderer, Moshe Tennenholtz

Publication date 8 February 2004

Full work available at URL https://arxiv.org/abs/1107.0022

zbMATH Keywords

complete and incomplete informationmixed strategiesstrategy profiles

Mathematics Subject Classification ID

Artificial intelligence (68T99) Noncooperative games (91A10) Games in extensive form (91A18)

Recommendations

• Mechanism Design by Creditability
• Cost and complexity of harnessing games with payments
• A new approach to the implementation problem
• The theory of implementation when the planner is a player
• Credible implementation

Cited in

(18)

• Buying optimal payoffs in bi-matrix games
• Incentive-based search for equilibria in Boolean games
• Manipulating games by sharing information
• Enforcing efficient equilibria in network design games via subsidies
• Efficiency and complexity of price competition among single-product vendors
• Process manipulation in unique implementation
• Cost and complexity of harnessing games with payments
• The Cost of Stability in Network Flow Games
• Privacy and truthful equilibrium selection for aggregative games
• Mechanism Design by Creditability
• Manipulation in Games
• Coopetition Against an Amazon
• Coopetition against an Amazon
• Attaining equilibria using control sets
• Attaining equilibria using control sets
• When effort may fail: equilibria of shared effort with a threshold
• Strong mediated equilibrium
• Mediators in position auctions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449277)