The following pages link to Algorithmic mechanism design (Q5938624):
Displayed 50 items.
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- On bilevel machine scheduling problems (Q421065) (← links)
- An incentive-based distributed mechanism for scheduling divisible loads in tree networks (Q433420) (← links)
- Cost sharing and strategyproof mechanisms for set cover games (Q604756) (← links)
- Modelling and analysis of a network organization for cooperation of manufacturers on production capacity (Q610074) (← links)
- Improved lower bounds for non-utilitarian truthfulness (Q627119) (← links)
- Distributed algorithmic mechanism design for scheduling on unrelated machines (Q635328) (← links)
- Truthful mechanisms for selfish routing and two-parameter agents (Q647482) (← links)
- Incentive-compatible interdomain routing (Q658663) (← links)
- A complete characterization of group-strategyproof mechanisms of cost-sharing (Q692628) (← 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)
- 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)
- 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)
- Learning in nonlinear pricing with unknown utility functions (Q2267314) (← links)
- Computer science and decision theory (Q2271874) (← 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)
- Stackelberg network pricing games (Q2429327) (← links)
- Exact and approximate truthful mechanisms for the shortest paths tree problem (Q2461546) (← links)
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)
- A survey on networking games in telecommunications (Q2567161) (← links)
- THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING (Q3144935) (← links)
- Private Capacities in Mechanism Design (Q3182917) (← links)
- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games (Q3511399) (← links)
- When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures (Q3599064) (← links)
- Collaboration in Cargo Transportation (Q3638512) (← links)
- Asynchronous Congestion Games (Q3655138) (← links)
- Improved Lower Bounds for Non-utilitarian Truthfulness (Q5443369) (← links)
- The Price of Anarchy on Uniformly Related Machines Revisited (Q5459971) (← links)