Automated mechanism design: a new application area for search algorithms
DOI10.1007/B13743zbMATH Open1273.68385OpenAlexW2497660909MaRDI QIDQ5897191FDOQ5897191
Authors: Tuomas Sandholm
Publication date: 2 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13743
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Applications of game theory (91A80) Agent technology and artificial intelligence (68T42) Rationality and learning in game theory (91A26)
Cited In (13)
- Efficiency and budget balance in general quasi-linear domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficiency and Budget Balance
- Optimal mechanism design for a sequencing problem with two-dimensional types
- Computer-aided verification for mechanism design
- Mechanism design for automated negotiation, and its application to task oriented domains
- Decentralized multi-level uncapacitated lot-sizing by automated negotiation
- Web services composing by multiagent negotiation
- Partial strategyproofness: relaxing strategyproofness for the random assignment problem
- An introduction to mechanized reasoning
- Evaluating strategic structures in multi-agent inverse reinforcement learning
- A parametrization of the auction design space
This page was built for publication: Automated mechanism design: a new application area for search algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897191)