Strategyproof and Nonbossy Multiple Assignments

By Szilvia Pápai. 2001

174 citations recorded by the source corpus.

Subfields: Economics and Econometrics, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/d5ea11e3ce69af4c7720fcb0420904638d0d89d1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Economics and Econometrics

1. Eric Budish
2. Benjamin Plaut
3. Tim Roughgarden

In Management Science and Operations Research

1. Eric Budish
2. Benjamin Plaut
3. Tim Roughgarden

Citations in the corpus

• A general equivalence theorem for allocation of indivisible objects (2014, unknown): “[16, 9, 11] for negative results in this area).”
• Matching, Allocation, and Exchange of Discrete Resources (2009, unknown): “Also see Gusfield and Irving (1989) on the complementary work in operations research and computer science on algorithms regarding two-sided matching theory. 3For surveys on market design of the US Federal Communications Commission (FCC) auctions (see http://wireless.fcc.gov/auctions/default.htm?job=”
• The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes (2010, methodology): “…attention to larger economies (i.e., ), then we can obtain a slightly weaker statement than proposition 3 by using eitherN 1 2 proposition 1 of Pápai (2001) or theorem 1 of Ehlers and Klaus (2003), each of which characterizes dictatorships in terms of strategyproofness, ex post efficiency,…”