Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMay 2019
Avoiding Social Disappointment in Elections
AAMAS '19: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent SystemsPages 2039–2041Mechanism design is concerned with settings where a policy maker (or social planner) faces the problem of aggregating the announced preferences of multiple agents into a collective (or social), system-wide decision. One of the most important ways for ...
- articleMay 2003
Integer programming and arrovian social welfare functions
Mathematics of Operations Research (MOOR), Volume 28, Issue 2Pages 309–326https://doi.org/10.1287/moor.28.2.309.14478We characterize the class of Arrovian Social Welfare Functions (ASWFs) as integer solutions to a collection of linear inequalities. Many of the classical possibility, impossibility, and characterization results can be derived in a simple and unified way ...
- articleDecember 2002
Simple Explanation of the No-Free-Lunch Theorem and Its Implications
Journal of Optimization Theory and Applications (JOPT), Volume 115, Issue 3Pages 549–570https://doi.org/10.1023/A:1021251113462The no-free-lunch theorem of optimization (NFLT) is an impossibility theorem telling us that a general-purpose, universal optimization strategy is impossible. The only way one strategy can outperform another is if it is specialized to the structure of ...
- articleFebruary 1996
An Impossibility Result in Axiomatic Location Theory
We show that certain reasonable axioms for an optimal solution to the problem of locating a facility on a network, i.e., axioms of distance determination, Pareto optimality, and anonymity, and a weak Lipschitz condition, can be self-contradictory. In ...