SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Approximate Mechanism Design without Money
16 references·8 citing·23 second hop
Approximate Mechanism Design without Money (2013)Approximate Mechanism Design without MoneyAsymptotically optimal strategy-proof mechanisms for two-facility games (2010)Asymptotically optimal strate…AI's War on Manipulation: Are We Winning? (2010)AI's War on Manipulation: Are…Truthful randomized mechanisms for combinatorial auctions (2006)Truthful randomized mechanism…Truthful and Near-Optimal Mechanism Design via Linear Programming (2005)Truthful and Near-Optimal Mec…Allocating indivisible goods (2005)Allocating indivisible goodsTruth revelation in approximately efficient combinatorial auctions (2002)Truth revelation in approxima…Strategy-proof Location on a Network (2002)Strategy-proof Location on a …Algorithmic Mechanism Design (2001)Algorithmic Mechanism DesignTwo-Sided Matching (1990)Two-Sided MatchingOn strategy-proofness and single peakedness (1980)On strategy-proofness and sin…Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions (1975)Strategy-proofness and Arrow'…Manipulation of Voting Schemes: A General Result (1973)Manipulation of Voting Scheme…Incentives in Teams (1973)Incentives in TeamsMultipart pricing of public goods (1971)Multipart pricing of public g…College Admissions and the Stability of Marriage (1962)College Admissions and the St…COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)COUNTERSPECULATION, AUCTIONS,…When Is Assortment Optimization Optimal? (2022)When Is Assortment Optimizati…Mechanism Design for Facility Location Problems: A Survey (2021)Mechanism Design for Facility…Deep Learning for Multi-Facility Location Mechanism Design (2018)Deep Learning for Multi-Facil…The Price of Anarchy in Auctions (2017)The Price of Anarchy in Aucti…Introduction to Computational Social Choice (2016)Introduction to Computational…A Mechanism for Fair Distribution of Resources without Payments (2016)A Mechanism for Fair Distribu…Optimal Envy-Free Cake Cutting (2011)Optimal Envy-Free Cake CuttingCan Approximation Circumvent Gibbard-Satterthwaite? (2010)Can Approximation Circumvent …Optimal Auction Design (1981)A Course in Game Theory (1994)A survey on networking games in telecommunications (2004)Worst-case equilibria (2009)Social Choice and Individual Values. (1951)Incentive Compatibility and the Bargaining Problem (1979)The Theory of Incentives: The Principal-Agent Model (2001)On the Rationale of Group Decision-making (1948)Distributed algorithmic mechanism design (2002)An Introduction to the Theory of Mechanism Design (2015)The Theory of Committees and Elections. (1959)A Theory of Auctions and Competitive Bidding (1982)Combinatorial auctions with decreasing marginal utilities (2005)Truthful approximation mechanisms for restricted combinatorial auctions (2008)Approximate mechanism design without money (2009)A Strategic Model of Social and Economic Networks (1996)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)Contrasting Computational Models of Mate Preference Integration Across 45 Countries (2019)Putting Auction Theory to Work (2004)2. Public Goods: A Survey of Experimental Research (1995)The Evolution of Social and Economic Networks (2002)The Stability of Hedonic Coalition Structures (2002)Matching and Sorting in Online Dating (2010)
this work references cited by second hop

References

  • 1961COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS7,719 cited
  • 1962College Admissions and the Stability of Marriage5,978 cited
  • 1973Incentives in Teams3,334 cited
  • 1971Multipart pricing of public goods3,266 cited
  • 1973Manipulation of Voting Schemes: A General Result3,211 cited
  • 1975Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions2,821 cited
  • 1990Two-Sided Matching1,377 cited
  • 2001Algorithmic Mechanism Design1,331 cited
  • 1980On strategy-proofness and single peakedness868 cited
  • 2002Truth revelation in approximately efficient combinatorial auctions658 cited
  • 2005Truthful and Near-Optimal Mechanism Design via Linear Programming218 cited
  • 2010AI's War on Manipulation: Are We Winning?191 cited
  • 2006Truthful randomized mechanisms for combinatorial auctions189 cited
  • 2002Strategy-proof Location on a Network180 cited
  • 2005Allocating indivisible goods176 cited
  • 2010Asymptotically optimal strategy-proof mechanisms for two-facility games

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

174 cited

Cited by

  • 2016Introduction to Computational Social Choice161 cited
  • 2011Optimal Envy-Free Cake Cutting91 cited
  • 2017The Price of Anarchy in Auctions76 cited
  • 2021Mechanism Design for Facility Location Problems: A Survey72 cited
  • 2018Deep Learning for Multi-Facility Location Mechanism Design62 cited
  • 2010Can Approximation Circumvent Gibbard-Satterthwaite?61 cited
  • 2016A Mechanism for Fair Distribution of Resources without Payments39 cited
  • 2022When Is Assortment Optimization Optimal?20 cited