The following pages link to Algorithmic mechanism design (Q5938624):
Displayed 50 items.
- A complete characterization of group-strategyproof mechanisms of cost-sharing (Q692628) (← links)
- Automated optimal OSP mechanisms for set systems. The case of small domains (Q777956) (← links)
- The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
- Iterative Dutch combinatorial auctions (Q812381) (← links)
- Auction design with costly preference elicitation (Q812389) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- Stackelberg thresholds in network routing games or the value of altruism (Q834861) (← links)
- Coordination mechanisms (Q838145) (← links)
- The price of envy-freeness in machine scheduling (Q899310) (← links)
- Mechanisms for scheduling with single-bit private values (Q904689) (← links)
- Copula-based randomized mechanisms for truthful scheduling on two unrelated machines (Q904694) (← links)
- Computationally-feasible truthful auctions for convex bundles (Q932809) (← links)
- Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems (Q935148) (← links)
- Mechanism design for a multicommodity flow game in service network alliances (Q957334) (← links)
- Non-cooperative cost sharing games via subsidies (Q987398) (← links)
- Foundations of mechanism design: a tutorial. I. Key concepts and classical results (Q1001137) (← links)
- Fast payment schemes for truthful mechanisms with verification (Q1006066) (← links)
- Dynamic mechanism design (Q1014626) (← links)
- Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
- A lower bound for scheduling mechanisms (Q1031874) (← links)
- On truthfulness and approximation for scheduling selfish tasks (Q1041343) (← links)
- Hardness results for multicast cost sharing. (Q1401398) (← links)
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- Efficiency of electronic service allocation with privately known quality (Q1751281) (← links)
- No truthful mechanism can be better than \(n\) approximate for two natural problems (Q1792559) (← links)
- Approximation and collusion in multicast cost sharing (Q1885423) (← links)
- Bundling equilibrium in combinatorial auctions (Q1885427) (← links)
- Continuous learning methods in two-buyer pricing problem (Q1935931) (← links)
- A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759) (← links)
- A BGP-based mechanism for lowest-cost routing (Q1953638) (← links)
- Incentive compatible regression learning (Q1959425) (← links)
- Optimal collusion-resistant mechanisms with verification (Q2016253) (← links)
- Strategyproof mechanisms for 2-facility location games with minimax envy (Q2039669) (← links)
- Tighter price of anarchy for selfish task allocation on selfish machines (Q2082200) (← links)
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs (Q2140265) (← links)
- Strategyproof mechanisms for \(2\)-facility location games with minimax envy (Q2156318) (← links)
- Mechanisms for dual-role-facility location games: truthfulness and approximability (Q2172605) (← links)
- The capacity constrained facility location problem (Q2212775) (← links)
- Multi-unit auctions: beyond Roberts (Q2253831) (← links)
- Learning in nonlinear pricing with unknown utility functions (Q2267314) (← links)
- Computer science and decision theory (Q2271874) (← links)
- New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)
- On black-box transformations in downward-closed environments (Q2322707) (← links)
- Fair by design: multidimensional envy-free mechanisms (Q2345204) (← links)
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach (Q2345944) (← links)
- Mechanism design for policy routing (Q2375297) (← links)
- Proving Arrow's theorem by \texttt{PROLOG} (Q2385186) (← links)
- Mechanisms for a spatially distributed market (Q2389294) (← links)
- Fault tolerant mechanism design (Q2389683) (← links)