scientific article

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

Publication:3624066

zbMath1165.91387arXiv1110.0025MaRDI QIDQ3624066

Noam Nisan, Amir Ronen

Publication date: 28 April 2009

Full work available at URL: https://arxiv.org/abs/1110.0025

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



Related Items (50)

Incentive-compatible simple mechanismsCharacterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms – Two players caseApproximation and collusion in multicast cost sharingAuctions with bidder-determined allowable combinationsA parallel machine schedule updating game with compensations and clients averse to uncertain lossHow to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibriumThe VCG Mechanism for Bayesian SchedulingEliciting social knowledge for creditworthiness assessmentSharing the cost of multicast transmissions in wireless networksTruthful optimization using mechanisms with verificationComparing multiagent systems research in combinatorial auctions and votingDecentralized subcontractor scheduling with divisible jobsOn the correlation gap of matroidsGradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectivesHardness results for multicast cost sharing.Truthful learning mechanisms for multi-slot sponsored search auctions with externalitiesAlgorithms and mechanisms for procuring services with uncertain durations using redundancyBetter redistribution with inefficient allocation in multi-unit auctionsTruthful randomized mechanisms for combinatorial auctionsRandomized mechanism design for decentralized network schedulingLimitations of VCG-based mechanismsIncentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobsDeterministic monotone algorithms for scheduling on related machinesUnconditional competitive auctions with copy and budget constraintsRevenue monotonicity in deterministic, dominant-strategy combinatorial auctionsComputer science and decision theorySharing the cost of multicast transmissionsAbstracting and Verifying Strategy-Proofness for Auction MechanismsMultiple unit auctions with economies and diseconomies of scaleTowards better models of externalities in sponsored search auctionsCombinatorial auctions with verification are tractableFoundations of mechanism design: a tutorial. I. Key concepts and classical resultsBayesian incentive compatibility via matchingsFast payment schemes for truthful mechanisms with verificationFrugal Routing on Wireless Ad-Hoc NetworksTruthful approximation mechanisms for restricted combinatorial auctionsCollusion-Resistant Mechanisms with Verification Yielding Optimal SolutionsItem Pricing for Combinatorial Public ProjectsMechanisms for combinatorial auctions with budget constraintsThe Pareto frontier of inefficiency in mechanism designMechanism design for set cover games with selfish element agentsStability and Recovery for Independence SystemsTruthful mechanism design for bin packing with applications on cloud computingOn the approximability of the range assignment problem on radio networks in presence of selfish agentsCombinatorial auctions for electronic businessIncentive compatible mulit-unit combinatorial auctions: a primal dual approachDictatorial Mechanisms in Constrained Combinatorial AuctionsCharacterizing the incentive compatible and Pareto optimal efficiency space for two players, \(k\) items, public budget and quasilinear utilitiesThe incompatibility of Pareto optimality and dominant-strategy incentive compatibility in sufficiently-anonymous budget-constrained quasilinear settingsFast Core Pricing for Rich Advertising Auctions







This page was built for publication: