Pages that link to "Item:Q5363025"

The following pages link to Combinatorial Auctions via Posted Prices (Q5363025):

Displaying 41 items.

• Designing cost-sharing methods for Bayesian games (Q1733377) (← links)
• Simple combinatorial auctions with budget constraints (Q2006772) (← links)
• Strategyproof facility location in perturbation stable instances (Q2152106) (← links)
• Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
• Optimal item pricing in online combinatorial auctions (Q2164686) (← links)
• Quality of local equilibria in discrete exchange economies (Q2178594) (← links)
• Pricing multi-unit markets (Q2190388) (← links)
• Prophet secretary through blind strategies (Q2235156) (← links)
• Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents (Q2237895) (← links)
• From pricing to prophets, and back! (Q2294260) (← links)
• Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
• Revenue Maximization for Market Intermediation with Correlated Priors (Q2819465) (← links)
• Designing Cost-Sharing Methods for Bayesian Games (Q2819469) (← links)
• Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs (Q3304731) (← links)
• Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare (Q3448773) (← links)
• Polymatroid Prophet Inequalities (Q3452806) (← links)
• Combinatorial Walrasian Equilibrium (Q3460334) (← links)
• Sequential Posted Price Mechanisms with Correlated Valuations (Q3460773) (← links)
• A Simple and Approximately Optimal Mechanism for a Buyer with Complements (Q4994150) (← links)
• Market Pricing for Matroid Rank Valuations (Q5013570) (← links)
• (Q5077148) (← links)
• Prophet Matching with General Arrivals (Q5085120) (← links)
• Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution (Q5085141) (← links)
• Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources (Q5106367) (← links)
• (Q5111298) (← links)
• Pricing Social Goods (Q5111722) (← links)
• Tight Revenue Gaps Among Simple Mechanisms (Q5123985) (← links)
• An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions (Q5864664) (← links)
• (Q5874555) (← links)
• (Q5875458) (← links)
• Mechanism design for perturbation stable combinatorial auctions (Q5918751) (← links)
• (Q6087211) (← links)
• A Dual Approach for Dynamic Pricing in Multidemand Markets (Q6116232) (← links)
• Walrasian pricing in multi-unit auctions (Q6136100) (← links)
• Max-min greedy matching problem: hardness for the adversary and fractional variant (Q6138832) (← links)
• Max-min greedy matching problem: hardness for the adversary and fractional variant (Q6535803) (← links)
• A theory of simplicity in games and mechanism design (Q6536583) (← links)
• Optimal item pricing in online combinatorial auctions (Q6589756) (← links)
• The importance of knowing the arrival order in combinatorial Bayesian settings (Q6609145) (← links)
• Prophet inequalities via the expected competitive ratio (Q6609147) (← links)
• Prophet secretary for combinatorial auctions and matroids (Q6640585) (← links)