Pages that link to "Item:Q2819541"
From MaRDI portal
The following pages link to Algorithmic mechanism design (extended abstract) (Q2819541):
Displaying 50 items.
- Finding a contra-risk path between two nodes in undirected graphs (Q326494) (← links)
- Approximate composable truthful mechanism design (Q344791) (← links)
- Coping with selfish on-going behaviors (Q418112) (← links)
- Worst-case equilibria (Q458478) (← links)
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Strategyproof mechanism design for facility location games with weighted agents on a line (Q489723) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- A complete characterization of group-strategyproof mechanisms of cost-sharing (Q692628) (← links)
- Computing optimal contracts in combinatorial agencies (Q714788) (← links)
- On designing truthful mechanisms for online scheduling (Q838147) (← links)
- Truthful algorithms for scheduling selfish tasks on parallel machines (Q861258) (← links)
- Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
- Decomposing random mechanisms (Q898659) (← links)
- Deterministic monotone algorithms for scheduling on related machines (Q952439) (← links)
- Price of anarchy in parallel processing (Q991788) (← links)
- The power of verification for one-parameter agents (Q1004286) (← links)
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- Strongly polynomial-time truthful mechanisms in one shot (Q1014632) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- A lower bound for scheduling mechanisms (Q1031874) (← links)
- Path auctions with multiple edge ownership (Q1041251) (← links)
- Finding the most vital node of a shortest path. (Q1401266) (← links)
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
- Scheduling without payments (Q1678760) (← links)
- A truthful mechanism for value-based scheduling in cloud computing (Q1678764) (← links)
- Competitive multi-agent scheduling with an iterative selection rule (Q1743639) (← links)
- Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs (Q1744245) (← links)
- Network QoS games: stability vs optimality tradeoff (Q1880785) (← links)
- Competitive analysis of incentive compatible on-line auctions (Q1884971) (← links)
- Average-case approximation ratio of scheduling without payments (Q2032343) (← links)
- Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
- Introduction to computer science and economic theory (Q2253830) (← links)
- Optimizing maintenance service contracts through mechanism design theory (Q2293743) (← links)
- MiniBrass: soft constraints for MiniZinc (Q2331099) (← links)
- Games to induce specified equilibria (Q2378513) (← links)
- Mechanisms for information elicitation (Q2389691) (← links)
- Improved algorithms for replacement paths problems in restricted graphs (Q2488196) (← links)
- On certain connectivity properties of the internet topology (Q2490261) (← links)
- Optimal deterministic auctions with correlated priors (Q2516251) (← links)
- On the approximability of the range assignment problem on radio networks in presence of selfish agents (Q2570125) (← links)
- Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
- Truthfulness for the Sum of Weighted Completion Times (Q2817845) (← links)
- First-passage percolation on a ladder graph, and the path cost in a VCG auction (Q2998892) (← links)
- Recent Developments in the Mechanism Design Problem for Scheduling (Q3004649) (← links)
- Black-Box Reductions in Mechanism Design (Q3088099) (← links)
- Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (Q3196401) (← links)
- (Q5090397) (← links)
- (Q5111230) (← links)
