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 valuesCompetitive analysis of incentive compatible on-line auctionsApproximation and collusion in multicast cost sharingWorst-case optimal redistribution of VCG payments in multi-unit auctionsTight Revenue Gaps among Multiunit MechanismsOnline learning in online auctionsAuction Design with a Revenue TargetEnvy-free pricing with general supply constraints for unit demand consumersRecent studies of agent incentives in Internet resource allocation and pricingServe or skip: the power of rejection in online bottleneck matchingAsymptotically optimal prior-free clock auctionsA simple mechanism for a budget-constrained buyerStrategyproof mechanism for two-sided matching with resource allocationA mechanism design approach for multi-party machine learningTight Revenue Gaps Among Simple MechanismsPrior-free multi-unit auctions with ordered biddersOn the value of using group discounts under price competitionTruthful randomized mechanisms for combinatorial auctionsDerandomization of auctionsRecent studies of agent incentives in internet resource allocation and pricingReducing mechanism design to algorithm design via machine learningEnvy freedom and prior-free mechanism designUnconditional competitive auctions with copy and budget constraintsSharing the cost of multicast transmissionsAutomated Design of Revenue-Maximizing Combinatorial AuctionsOptimal VCG mechanisms to assign multiple badsPrior-free online mechanisms for queueing with arrivalsIncentive-Compatible Learning of Reserve Prices for Repeated AuctionsNew bounds for the balloon popping problem




This page was built for publication: