Algorithmic mechanism design

DOI10.1006/game.1999.0790zbMath0996.68251OpenAlexW2012634103WikidataQ55899415 ScholiaQ55899415MaRDI QIDQ5938624

Publication date: 2001

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.7473

zbMATH Keywords

scheduling

Mathematics Subject Classification ID

Noncooperative games (91A10) Distributed systems (68M14) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (only showing first 100 items - show all)

On resilient graph spanners ⋮ Approximation and collusion in multicast cost sharing ⋮ Bundling equilibrium in combinatorial auctions ⋮ Truthful mechanism design for multidimensional scheduling via cycle monotonicity ⋮ Stackelberg thresholds in network routing games or the value of altruism ⋮ Coordination mechanisms ⋮ A parallel machine schedule updating game with compensations and clients averse to uncertain loss ⋮ Mechanism design for policy routing ⋮ Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs ⋮ The Price of Matching with Metric Preferences ⋮ Synthesis with rational environments ⋮ Private Capacities in Mechanism Design ⋮ The VCG Mechanism for Bayesian Scheduling ⋮ Mechanisms with Monitoring for Truthful RAM Allocation ⋮ Proving Arrow's theorem by \texttt{PROLOG} ⋮ Rationality Authority for Provable Rational Behavior ⋮ Mechanisms for a spatially distributed market ⋮ Setting lower bounds on truthfulness ⋮ Fault tolerant mechanism design ⋮ Strategyproof mechanisms for \(2\)-facility location games with minimax envy ⋮ Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location ⋮ Incentives and justice for sequencing problems ⋮ Mechanisms for dual-role-facility location games: truthfulness and approximability ⋮ Nonpreemptive coordination mechanisms for identical machines ⋮ Characterization of Truthful Mechanisms for One-Dimensional Single Facility Location Game with Payments ⋮ Cost sharing and strategyproof mechanisms for set cover games ⋮ A Survey on Approximation Mechanism Design Without Money for Facility Games ⋮ Modelling and analysis of a network organization for cooperation of manufacturers on production capacity ⋮ On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium ⋮ Maximizing the minimum load: the cost of selfishness ⋮ Truthful optimization using mechanisms with verification ⋮ Reducing price of anarchy of selfish task allocation with more selfishness ⋮ The anarchy of scheduling without money ⋮ Continuous learning methods in two-buyer pricing problem ⋮ Hardness results for multicast cost sharing. ⋮ The price of envy-freeness in machine scheduling ⋮ Improved lower bounds for non-utilitarian truthfulness ⋮ The price of anarchy on uniformly related machines revisited ⋮ Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games ⋮ On bilevel machine scheduling problems ⋮ Stackelberg network pricing games ⋮ Mechanisms for scheduling with single-bit private values ⋮ Copula-based randomized mechanisms for truthful scheduling on two unrelated machines ⋮ Distributed algorithmic mechanism design for scheduling on unrelated machines ⋮ An incentive-based distributed mechanism for scheduling divisible loads in tree networks ⋮ Unnamed Item ⋮ A lower bound of \(1+\varphi \) for truthful scheduling mechanisms ⋮ The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context ⋮ Mechanism design with a restricted action space ⋮ A BGP-based mechanism for lowest-cost routing ⋮ The capacity constrained facility location problem ⋮ Incentive compatible regression learning ⋮ Truthful mechanisms for selfish routing and two-parameter agents ⋮ Appraising two decades of distributed computing theory research ⋮ Incentive-compatible interdomain routing ⋮ Convergence of best-response dynamics in games with conflicting congestion effects ⋮ Computationally-feasible truthful auctions for convex bundles ⋮ Algorithmic Mechanism Design for Collaboration in Large-Scale Transportation Networks ⋮ Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems ⋮ Exact and approximate truthful mechanisms for the shortest paths tree problem ⋮ Efficiency of electronic service allocation with privately known quality ⋮ Mechanism design for a multicommodity flow game in service network alliances ⋮ Combinatorial auctions without money ⋮ Truthful mechanism design via correlated tree rounding ⋮ Multi-unit auctions: beyond Roberts ⋮ A complete characterization of group-strategyproof mechanisms of cost-sharing ⋮ Learning in nonlinear pricing with unknown utility functions ⋮ Optimal collusion-resistant mechanisms with verification ⋮ Computer science and decision theory ⋮ When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures ⋮ Non-cooperative cost sharing games via subsidies ⋮ Truthful Mechanisms with Implicit Payment Computation ⋮ No truthful mechanism can be better than \(n\) approximate for two natural problems ⋮ Combinatorial auctions with verification are tractable ⋮ A Unified Approach to Truthful Scheduling on Related Machines ⋮ Foundations of mechanism design: a tutorial. I. Key concepts and classical results ⋮ Strategyproof mechanisms for 2-facility location games with minimax envy ⋮ Fast payment schemes for truthful mechanisms with verification ⋮ Unnamed Item ⋮ Truthful approximation mechanisms for restricted combinatorial auctions ⋮ New bounds for truthful scheduling on two unrelated selfish machines ⋮ Dynamic mechanism design ⋮ Bribeproof Mechanisms for Two-Values Domains ⋮ The Anarchy of Scheduling Without Money ⋮ Collaboration in Cargo Transportation ⋮ Fair cost-sharing methods for scheduling jobs on parallel machines ⋮ A lower bound for scheduling mechanisms ⋮ On black-box transformations in downward-closed environments ⋮ Asynchronous Congestion Games ⋮ Automated optimal OSP mechanisms for set systems. The case of small domains ⋮ The Pareto frontier of inefficiency in mechanism design ⋮ On truthfulness and approximation for scheduling selfish tasks ⋮ Tighter price of anarchy for selfish task allocation on selfish machines ⋮ A survey on networking games in telecommunications ⋮ Computing (and Life) Is All about Tradeoffs ⋮ Fair by design: multidimensional envy-free mechanisms ⋮ Incentive compatible mulit-unit combinatorial auctions: a primal dual approach ⋮ THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING ⋮ Iterative Dutch combinatorial auctions ⋮ Auction design with costly preference elicitation

Cites Work

This page was built for publication: Algorithmic mechanism design