scientific article

From MaRDI portal
Revision as of 01:21, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3549687

zbMath1231.91117MaRDI QIDQ3549687

Jason D. Hartline, Tim Roughgarden

Publication date: 5 January 2009


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (32)

Worst-case optimal redistribution of VCG payments in multi-unit auctionsEfficient Money Burning in General DomainsToss one's cake, and eat it too: partial divisions can improve social welfare in cake cuttingMechanisms with Monitoring for Truthful RAM AllocationOn the complexity of dynamic mechanism designResource Burning for Permissionless Systems (Invited Paper)Optimal private good allocation: the case for a balanced budgetReasoning about Quality and Fuzziness of Strategic BehaviorsWhat money can't buy: efficient mechanism design with costly signalsWithholding and damage in Bayesian trade mechanismsWelfare maximizing allocation without transfersPrior-free multi-unit auctions with ordered biddersDerandomization of auctionsOptimal mechanism design when both allocative inefficiency and expenditure inefficiency matterBlack-box reductions for cost-sharing mechanism designOptimal crowdsourcing contestsEfficient money burning in general domainsEnvy freedom and prior-free mechanism designNear-optimality of second price mechanisms in a class of asymmetric auctionsCollusive communication schemes in a first-price auctionOptimal-in-expectation redistribution mechanismsEfficient voting with penaltiesAutomated Design of Revenue-Maximizing Combinatorial AuctionsOptimal Provision-After-Wait in HealthcareFrom Monetary to Nonmonetary Mechanism Design via Artificial CurrenciesDecentralized utilitarian mechanisms for scheduling gamesOptimal deterministic auctions with correlated priorsWorst-Case Mechanism Design via Bayesian AnalysisTruthful Generalized Assignments via Stable MatchingUnnamed ItemRevenue maximization with a single sampleSelling privacy at auction




This page was built for publication: