Pages that link to "Item:Q5495790"
From MaRDI portal
The following pages link to Simultaneous auctions are (almost) efficient (Q5495790):
Displaying 42 items.
- Welfare guarantees for proportional allocations (Q506519) (← links)
- On the efficiency of the proportional allocation mechanism for divisible resources (Q506522) (← links)
- Self-confirming price-prediction strategies for simultaneous one-shot auctions (Q523500) (← links)
- Item bidding for combinatorial public projects (Q526903) (← links)
- Simultaneous independent online auctions with discrete bid increments (Q816718) (← links)
- Immediate demand reduction in simultaneous ascending-bid auctions: a uniqueness result (Q852319) (← links)
- Uniform price auctions: equilibria and efficiency (Q904682) (← links)
- Auctions of heterogeneous objects (Q1288238) (← links)
- On the efficiency of all-pay mechanisms (Q1751086) (← links)
- Fraction auctions: the tradeoff between efficiency and running time (Q1926775) (← links)
- Simple combinatorial auctions with budget constraints (Q2006772) (← links)
- Auctions for social lending: a theoretical analysis (Q2016244) (← links)
- Principal-agent VCG contracts (Q2138089) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- Best-response dynamics in combinatorial auctions with item bidding (Q2155910) (← links)
- Pricing multi-unit markets (Q2190388) (← links)
- Prophet inequalities vs. approximating optimum online (Q2190412) (← links)
- Simultaneous auctions without complements are (almost) efficient (Q2206818) (← links)
- Economic efficiency requires interaction (Q2278948) (← links)
- Analyses of cardinal auctions (Q2350901) (← links)
- Defensive sniping and efficiency in simultaneous hard-close proxy auctions (Q2427875) (← links)
- Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
- Item Pricing for Combinatorial Public Projects (Q2830053) (← links)
- Online ascending auctions for gradually expiring items (Q2921788) (← 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)
- Simultaneous Ad Auctions (Q3169126) (← links)
- Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs (Q3304731) (← 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)
- A Simple and Approximately Optimal Mechanism for a Buyer with Complements (Q4994150) (← links)
- Game efficiency through linear programming duality (Q5090446) (← links)
- Equilibria of Greedy Combinatorial Auctions (Q5737806) (← links)
- An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions (Q5864664) (← 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)
- A Bayesian equilibrium for simultaneous first-price auctions for complementary goods and quasi-linear bids (Q6107325) (← links)
- Simultaneous 2nd price item auctions with no-underbidding (Q6160126) (← links)
- Optimal Mechanism Design for Agents with DSL Strategies: The Case of Sybil Attacks in Combinatorial Auctions (Q6199613) (← links)
