The following pages link to Algorithmic mechanism design (Q5938624):
Displayed 50 items.
- 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)
- Incentives and justice for sequencing problems (Q2403448) (← links)
- The anarchy of scheduling without money (Q2420568) (← links)
- Stackelberg network pricing games (Q2429327) (← links)
- Mechanism design with a restricted action space (Q2437830) (← links)
- Exact and approximate truthful mechanisms for the shortest paths tree problem (Q2461546) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)
- A survey on networking games in telecommunications (Q2567161) (← links)
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
- On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium (Q2670913) (← links)
- The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context (Q2698591) (← links)
- Truthful Mechanisms with Implicit Payment Computation (Q2796397) (← links)
- A Unified Approach to Truthful Scheduling on Related Machines (Q2800378) (← links)
- Bribeproof Mechanisms for Two-Values Domains (Q2819466) (← links)
- The Anarchy of Scheduling Without Money (Q2819467) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Characterization of Truthful Mechanisms for One-Dimensional Single Facility Location Game with Payments (Q2937768) (← links)
- A Survey on Approximation Mechanism Design Without Money for Facility Games (Q2942465) (← links)
- THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING (Q3144935) (← links)
- Private Capacities in Mechanism Design (Q3182917) (← links)
- Algorithmic Mechanism Design for Collaboration in Large-Scale Transportation Networks (Q3296389) (← links)
- The Price of Matching with Metric Preferences (Q3452808) (← links)
- The VCG Mechanism for Bayesian Scheduling (Q3460800) (← links)
- Mechanisms with Monitoring for Truthful RAM Allocation (Q3460805) (← links)
- Rationality Authority for Provable Rational Behavior (Q3464466) (← 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)
- (Q5009585) (← links)
- (Q5111230) (← links)
- Appraising two decades of distributed computing theory research (Q5138493) (← links)
- Mechanism Design (Q5149740) (← links)