scientific article
From MaRDI portal
Publication:3624066
zbMath1165.91387arXiv1110.0025MaRDI QIDQ3624066
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
Incentive-compatible simple mechanisms ⋮ Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms – Two players case ⋮ Approximation and collusion in multicast cost sharing ⋮ Auctions with bidder-determined allowable combinations ⋮ A parallel machine schedule updating game with compensations and clients averse to uncertain loss ⋮ How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium ⋮ The VCG Mechanism for Bayesian Scheduling ⋮ Eliciting social knowledge for creditworthiness assessment ⋮ Sharing the cost of multicast transmissions in wireless networks ⋮ Truthful optimization using mechanisms with verification ⋮ Comparing multiagent systems research in combinatorial auctions and voting ⋮ Decentralized subcontractor scheduling with divisible jobs ⋮ On the correlation gap of matroids ⋮ Gradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectives ⋮ Hardness results for multicast cost sharing. ⋮ Truthful learning mechanisms for multi-slot sponsored search auctions with externalities ⋮ Algorithms and mechanisms for procuring services with uncertain durations using redundancy ⋮ Better redistribution with inefficient allocation in multi-unit auctions ⋮ Truthful randomized mechanisms for combinatorial auctions ⋮ Randomized mechanism design for decentralized network scheduling ⋮ Limitations of VCG-based mechanisms ⋮ Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs ⋮ Deterministic monotone algorithms for scheduling on related machines ⋮ Unconditional competitive auctions with copy and budget constraints ⋮ Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions ⋮ Computer science and decision theory ⋮ Sharing the cost of multicast transmissions ⋮ Abstracting and Verifying Strategy-Proofness for Auction Mechanisms ⋮ Multiple unit auctions with economies and diseconomies of scale ⋮ Towards better models of externalities in sponsored search auctions ⋮ Combinatorial auctions with verification are tractable ⋮ Foundations of mechanism design: a tutorial. I. Key concepts and classical results ⋮ Bayesian incentive compatibility via matchings ⋮ Fast payment schemes for truthful mechanisms with verification ⋮ Frugal Routing on Wireless Ad-Hoc Networks ⋮ Truthful approximation mechanisms for restricted combinatorial auctions ⋮ Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions ⋮ Item Pricing for Combinatorial Public Projects ⋮ Mechanisms for combinatorial auctions with budget constraints ⋮ The Pareto frontier of inefficiency in mechanism design ⋮ Mechanism design for set cover games with selfish element agents ⋮ Stability and Recovery for Independence Systems ⋮ Truthful mechanism design for bin packing with applications on cloud computing ⋮ On the approximability of the range assignment problem on radio networks in presence of selfish agents ⋮ Combinatorial auctions for electronic business ⋮ Incentive compatible mulit-unit combinatorial auctions: a primal dual approach ⋮ Dictatorial Mechanisms in Constrained Combinatorial Auctions ⋮ Characterizing the incentive compatible and Pareto optimal efficiency space for two players, \(k\) items, public budget and quasilinear utilities ⋮ The incompatibility of Pareto optimality and dominant-strategy incentive compatibility in sufficiently-anonymous budget-constrained quasilinear settings ⋮ Fast Core Pricing for Rich Advertising Auctions
