The following pages link to (Q5365074):
Displaying 42 items.
- Welfare guarantees for proportional allocations (Q506519) (← links)
- On the efficiency of the proportional allocation mechanism for divisible resources (Q506522) (← links)
- Item bidding for combinatorial public projects (Q526903) (← links)
- Uniform price auctions: equilibria and efficiency (Q904682) (← links)
- Repeated budgeted second price ad auction (Q1678769) (← links)
- On the efficiency of all-pay mechanisms (Q1751086) (← links)
- Stability and auctions in labor markets with job security (Q1783457) (← links)
- Simple combinatorial auctions with budget constraints (Q2006772) (← links)
- Towards a characterization of worst case equilibria in the discriminatory price auction (Q2152113) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- Best-response dynamics in combinatorial auctions with item bidding (Q2155910) (← links)
- Simultaneous auctions without complements are (almost) efficient (Q2206818) (← links)
- Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents (Q2237895) (← links)
- Bounding the inefficiency of outcomes in generalized second price auctions (Q2253843) (← links)
- Economic efficiency requires interaction (Q2278948) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
- Item Pricing for Combinatorial Public Projects (Q2830053) (← links)
- Limits of Efficiency in Sequential Auctions (Q2937755) (← links)
- Correlated and Coarse Equilibria of Single-Item Auctions (Q2959824) (← links)
- Smoothness for Simultaneous Composition of Mechanisms with Admission (Q2959837) (← links)
- Approximating Gains-from-Trade in Bilateral Trading (Q2959847) (← links)
- Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs (Q3304731) (← links)
- Cost-Sharing Models in Participatory Sensing (Q3449580) (← links)
- On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources (Q3449590) (← links)
- On the Efficiency of All-Pay Mechanisms (Q3452799) (← links)
- Computing Stable Coalitions: Approximation Algorithms for Reward Sharing (Q3460775) (← links)
- Worst-Case Mechanism Design via Bayesian Analysis (Q4978196) (← links)
- Algorithms as Mechanisms: The Price of Anarchy of Relax and Round (Q4991678) (← links)
- Game efficiency through linear programming duality (Q5090446) (← links)
- (Q5111735) (← links)
- Expressiveness and Robustness of First-Price Position Auctions (Q5219714) (← links)
- Equilibria of Greedy Combinatorial Auctions (Q5737806) (← links)
- (Q5743443) (← links)
- (Q5743455) (← links)
- An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions (Q5864664) (← links)
- On the Complexity of Equilibrium Computation in First-Price Auctions (Q5885597) (← links)
- Risk-free bidding in complement-free combinatorial auctions (Q5918704) (← links)
- Tight welfare guarantees for pure Nash equilibria of the uniform price auction (Q5919605) (← links)
- (Q6087218) (← links)
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem (Q6152666) (← links)
- Simultaneous 2nd price item auctions with no-underbidding (Q6160126) (← links)
