Achieving Allocatively-Efficient and Strongly Budget-Balanced Mechanisms in the Network Flow Domain for Bounded-Rational Agents

Yoram Bachrach, Jeffrey S. Rosenschein. Achieving Allocatively-Efficient and Strongly Budget-Balanced Mechanisms in the Network Flow Domain for Bounded-Rational Agents. In Han La Poutré, Norman M. Sadeh, Sverker Janson, editors, Agent-Mediated Electronic Commerce. Designing Trading Agents and Mechanisms - AAMAS 2005 Workshop, AMEC 2005, Utrecht, Netherlands, July 25, 2005, and IJCAI 2005 Workshop, TADA 2005, Edinburgh, UK, August 1, 2005, Selected and Revised Papers. Volume 3937 of Lecture Notes in Computer Science, pages 71-84, Springer, 2005. [doi]

@inproceedings{BachrachR05a,
  title = {Achieving Allocatively-Efficient and Strongly Budget-Balanced Mechanisms in the Network Flow Domain for Bounded-Rational Agents},
  author = {Yoram Bachrach and Jeffrey S. Rosenschein},
  year = {2005},
  doi = {10.1007/11888727_6},
  url = {http://dx.doi.org/10.1007/11888727_6},
  researchr = {https://researchr.org/publication/BachrachR05a},
  cites = {0},
  citedby = {0},
  pages = {71-84},
  booktitle = {Agent-Mediated Electronic Commerce. Designing Trading Agents and Mechanisms - AAMAS 2005 Workshop, AMEC 2005, Utrecht, Netherlands, July 25, 2005, and IJCAI 2005 Workshop, TADA 2005, Edinburgh, UK, August 1, 2005, Selected and Revised Papers},
  editor = {Han La Poutré and Norman M. Sadeh and Sverker Janson},
  volume = {3937},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-46242-2},
}