Achieving Allocatively-Efficient and Strongly Budget-Balanced Mechanisms in the Network Flow Domain for Bounded-Rational Agents Yoram Bachrach and Jeffrey S. Rosenschein {yori, jeff School of Engineering a - Jeff Clarke - Document - PDFSEARCH.IO

First Page	Meta Content
	Achieving Allocatively-Efficient and Strongly Budget-Balanced Mechanisms in the Network Flow Domain for Bounded-Rational Agents Yoram Bachrach and Jeffrey S. Rosenschein {yori, jeff}@cs.huji.ac.il School of Engineering a Add to Reading List Document Date: 2005-07-11 16:49:14 Open Document File Size: 71,81 KB Share Result on Facebook Company VERTEX / / / Facility Computer Science Hebrew University / / IndustryTerm flow network / allocation systems / layered graph flow network / maximal flow algorithm / system-wide solution / / Organization Engineering and Computer Science Hebrew University Jerusalem / Econometric Society / School of Engineering / World Congress / / Person Jean-Jacques Laffont / Leonid Hurwicz / Jerry Green / Yoram Bachrach / Jeffrey S. Rosenschein / / Technology artificial intelligence / maximal flow algorithm / Edmonds-Karp algorithm / / SocialTag Game theory Network flow Auctioneering Networks NP-complete problems Vertex cover Maximum flow problem Vickrey–Clarke–Groves auction Strategyproof Graph theory

Achieving Allocatively-Efficient and Strongly Budget-Balanced Mechanisms in the Network Flow Domain for Bounded-Rational Agents Yoram Bachrach and Jeffrey S. Rosenschein {yori, jeff}@cs.huji.ac.il School of Engineering aAdd to Reading List