Budget-feasible mechanism

In mechanism design, a branch of economics, a budget-feasible mechanism is a mechanism in which the total payment made by the auctioneer is upper-bounded by a fixed pre-specified budget. They were first presented by Yaron Singer,^[1] and studied by several others.^[2]^[3]^[4]

References

^ Singer, Yaron (2010-10-01). "Budget Feasible Mechanisms". 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. pp. 765–774. doi:10.1109/FOCS.2010.78. ISBN 978-1-4244-8525-3. S2CID 11916656.
^ Chen, Ning; Gravin, Nick; Lu, Pinyan (2011-01-23), "On the Approximability of Budget Feasible Mechanisms", Proceedings of the 2011 Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings, Society for Industrial and Applied Mathematics, pp. 685–699, arXiv:1007.3801, doi:10.1137/1.9781611973082.54, ISBN 978-0-89871-993-2, S2CID 14406192
^ Horel, Thibaut; Ioannidis, Stratis; Muthukrishnan, S. (2014). "Budget Feasible Mechanisms for Experimental Design". In Pardo, Alberto; Viola, Alfredo (eds.). LATIN 2014: Theoretical Informatics. Lecture Notes in Computer Science. Vol. 8392. Berlin, Heidelberg: Springer. pp. 719–730. arXiv:1302.5724. doi:10.1007/978-3-642-54423-1_62. ISBN 978-3-642-54423-1. S2CID 145181.
^ Jalaly Khalilabadi, Pooya; Tardos, Éva (2018). "Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations". In Christodoulou, George; Harks, Tobias (eds.). Web and Internet Economics. Lecture Notes in Computer Science. Vol. 11316. Cham: Springer International Publishing. pp. 246–263. arXiv:1703.10681. doi:10.1007/978-3-030-04612-5_17. ISBN 978-3-030-04612-5. S2CID 15747265.

This economics-related article is a stub. You can help Wikipedia by expanding it.

[1] Singer, Yaron (2010-10-01). "Budget Feasible Mechanisms". 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. pp. 765–774. doi:10.1109/FOCS.2010.78. ISBN 978-1-4244-8525-3. S2CID 11916656.

[2] Chen, Ning; Gravin, Nick; Lu, Pinyan (2011-01-23), "On the Approximability of Budget Feasible Mechanisms", Proceedings of the 2011 Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings, Society for Industrial and Applied Mathematics, pp. 685–699, arXiv:1007.3801, doi:10.1137/1.9781611973082.54, ISBN 978-0-89871-993-2, S2CID 14406192

[3] Horel, Thibaut; Ioannidis, Stratis; Muthukrishnan, S. (2014). "Budget Feasible Mechanisms for Experimental Design". In Pardo, Alberto; Viola, Alfredo (eds.). LATIN 2014: Theoretical Informatics. Lecture Notes in Computer Science. Vol. 8392. Berlin, Heidelberg: Springer. pp. 719–730. arXiv:1302.5724. doi:10.1007/978-3-642-54423-1_62. ISBN 978-3-642-54423-1. S2CID 145181.

[4] Jalaly Khalilabadi, Pooya; Tardos, Éva (2018). "Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations". In Christodoulou, George; Harks, Tobias (eds.). Web and Internet Economics. Lecture Notes in Computer Science. Vol. 11316. Cham: Springer International Publishing. pp. 246–263. arXiv:1703.10681. doi:10.1007/978-3-030-04612-5_17. ISBN 978-3-030-04612-5. S2CID 15747265.

[1]

[2]

[3]

[4]