scientific article
From MaRDI portal
Publication:2768374
zbMath0988.91024MaRDI QIDQ2768374
No author found.
Publication date: 22 July 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
Approximation in mechanism design with interdependent values ⋮ Competitive analysis of incentive compatible on-line auctions ⋮ Approximation and collusion in multicast cost sharing ⋮ Worst-case optimal redistribution of VCG payments in multi-unit auctions ⋮ Tight Revenue Gaps among Multiunit Mechanisms ⋮ Online learning in online auctions ⋮ Auction Design with a Revenue Target ⋮ Envy-free pricing with general supply constraints for unit demand consumers ⋮ Recent studies of agent incentives in Internet resource allocation and pricing ⋮ Serve or skip: the power of rejection in online bottleneck matching ⋮ Asymptotically optimal prior-free clock auctions ⋮ A simple mechanism for a budget-constrained buyer ⋮ Strategyproof mechanism for two-sided matching with resource allocation ⋮ A mechanism design approach for multi-party machine learning ⋮ Tight Revenue Gaps Among Simple Mechanisms ⋮ Prior-free multi-unit auctions with ordered bidders ⋮ On the value of using group discounts under price competition ⋮ Truthful randomized mechanisms for combinatorial auctions ⋮ Derandomization of auctions ⋮ Recent studies of agent incentives in internet resource allocation and pricing ⋮ Reducing mechanism design to algorithm design via machine learning ⋮ Envy freedom and prior-free mechanism design ⋮ Unconditional competitive auctions with copy and budget constraints ⋮ Sharing the cost of multicast transmissions ⋮ Automated Design of Revenue-Maximizing Combinatorial Auctions ⋮ Optimal VCG mechanisms to assign multiple bads ⋮ Prior-free online mechanisms for queueing with arrivals ⋮ Incentive-Compatible Learning of Reserve Prices for Repeated Auctions ⋮ New bounds for the balloon popping problem
This page was built for publication:
