scientific article

From MaRDI portal
Publication:2921790

zbMath1297.91072MaRDI QIDQ2921790

Jason D. Hartline, Anna R. Karlin, David Kempe, Frank McSherry, Venkatesan Guruswami, Claire M. Kenyon

Publication date: 13 October 2014


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (75)

On revenue maximization with sharp multi-unit demandsGraph pricing with limited supplyEnvy-Free Pricing in Large Markets: Approximating Revenue and WelfareEnvy-free pricing with general supply constraints for unit demand consumersPricing loss leaders can be hardCombinatorial Walrasian EquilibriumAd Exchange: Envy-Free Auctions with MediatorsThe complexity of optimal multidimensional pricing for a unit-demand buyerEfficient heuristic algorithms for maximum utility product pricing problemsRecent studies of agent incentives in Internet resource allocation and pricingThe Envy-Free Pricing Problem and Unit-Demand MarketsOn the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand BuyerOffline and online algorithms for single-minded selling problemEfficiency and complexity of price competition among single-product vendorsMixed-integer formulations for the capacitated rank pricing problem with envyApproximate competitive equilibrium with generic budgetOn envy-free perfect matchingLocation, pricing and the problem of ApolloniusA survey on mixed-integer programming techniques in bilevel optimizationWalrasian pricing in multi-unit auctionsThe price of envy-freeness in machine schedulingPricing commoditiesPricing to Maximize Revenue and Welfare Simultaneously in Large MarketsAnonymous Auctions Maximizing RevenueRevenue Maximizing Envy-Free Pricing in Matching Markets with BudgetsThe Stackelberg minimum spanning tree gameEnvy-free matchings in bipartite graphs and their applications to fair divisionStackelberg network pricing gamesThe power of fair pricing mechanismsUnnamed ItemTight Revenue Gaps Among Simple MechanismsThe balloon popping problem revisited: lower and upper boundsThe rank pricing problem: models and branch-and-cut algorithmsOn the complexity of a bundle pricing problemRecent studies of agent incentives in internet resource allocation and pricingAn LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraphNew formulations and valid inequalities for a bilevel pricing problemWalrasian equilibrium: Hardness, approximations and tractable instancesApproximating the revenue maximization problem with sharp demandsOn stackelberg pricing with computationally bounded customersThe envy-free pricing problem, unit-demand markets and connections with the network pricing problemOptimal bundle pricing with monotonicity constraintApproximation algorithms for the max-buying problem with limited supplyReducing mechanism design to algorithm design via machine learningOn the complexity of the highway problemPricing lotteriesMaximum utility product pricing models and algorithms based on reservation priceOnline pricing for multi-type of itemsUnnamed ItemPrice strategy implementationRevenue maximization in Stackelberg pricing games: beyond the combinatorial settingPricing bridges to cross a riverOptimal pricing of capacitated networksA polyhedral study of the network pricing problem with connected toll arcsModels and algorithms for the product pricing with single-minded customers requesting bundlesCompetitive location and pricing on a line with metric transportation costsAutomated Design of Revenue-Maximizing Combinatorial AuctionsOn envy-free revenue approximation for combinatorial buyers with budgetsPricing on Paths: A PTAS for the Highway ProblemOptimal deterministic auctions with correlated priorsUnnamed ItemOn fair price discrimination in multi-unit marketsOnline pricing for bundles of multiple itemsA hybrid approach to the solution of a pricing model with continuous demand segmentationStackelberg network pricing is hard to approximateAssortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortmentsEnvy-Free Revenue Approximation for Asymmetric Buyers with BudgetsOn social envy-freeness in multi-unit marketsCompetitive Equilibrium with Indivisible Goods and Generic BudgetsOn core-selecting and core-competitive mechanisms for binary single-parameter auctionsEnvy-free pricing in multi-item marketsUnnamed ItemAuctions with online supplyFair by design: multidimensional envy-free mechanismsThe power of randomness in Bayesian optimal mechanism design




This page was built for publication: