scientific article

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.

Microeconomic theory (price theory and economic markets) (91B24) Consumer behavior, demand theory (91B42)

Related Items (75)

On revenue maximization with sharp multi-unit demands ⋮ Graph pricing with limited supply ⋮ Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare ⋮ Envy-free pricing with general supply constraints for unit demand consumers ⋮ Pricing loss leaders can be hard ⋮ Combinatorial Walrasian Equilibrium ⋮ Ad Exchange: Envy-Free Auctions with Mediators ⋮ The complexity of optimal multidimensional pricing for a unit-demand buyer ⋮ Efficient heuristic algorithms for maximum utility product pricing problems ⋮ Recent studies of agent incentives in Internet resource allocation and pricing ⋮ The Envy-Free Pricing Problem and Unit-Demand Markets ⋮ On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer ⋮ Offline and online algorithms for single-minded selling problem ⋮ Efficiency and complexity of price competition among single-product vendors ⋮ Mixed-integer formulations for the capacitated rank pricing problem with envy ⋮ Approximate competitive equilibrium with generic budget ⋮ On envy-free perfect matching ⋮ Location, pricing and the problem of Apollonius ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ Walrasian pricing in multi-unit auctions ⋮ The price of envy-freeness in machine scheduling ⋮ Pricing commodities ⋮ Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets ⋮ Anonymous Auctions Maximizing Revenue ⋮ Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets ⋮ The Stackelberg minimum spanning tree game ⋮ Envy-free matchings in bipartite graphs and their applications to fair division ⋮ Stackelberg network pricing games ⋮ The power of fair pricing mechanisms ⋮ Unnamed Item ⋮ Tight Revenue Gaps Among Simple Mechanisms ⋮ The balloon popping problem revisited: lower and upper bounds ⋮ The rank pricing problem: models and branch-and-cut algorithms ⋮ On the complexity of a bundle pricing problem ⋮ Recent studies of agent incentives in internet resource allocation and pricing ⋮ An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph ⋮ New formulations and valid inequalities for a bilevel pricing problem ⋮ Walrasian equilibrium: Hardness, approximations and tractable instances ⋮ Approximating the revenue maximization problem with sharp demands ⋮ On stackelberg pricing with computationally bounded customers ⋮ The envy-free pricing problem, unit-demand markets and connections with the network pricing problem ⋮ Optimal bundle pricing with monotonicity constraint ⋮ Approximation algorithms for the max-buying problem with limited supply ⋮ Reducing mechanism design to algorithm design via machine learning ⋮ On the complexity of the highway problem ⋮ Pricing lotteries ⋮ Maximum utility product pricing models and algorithms based on reservation price ⋮ Online pricing for multi-type of items ⋮ Unnamed Item ⋮ Price strategy implementation ⋮ Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting ⋮ Pricing bridges to cross a river ⋮ Optimal pricing of capacitated networks ⋮ A polyhedral study of the network pricing problem with connected toll arcs ⋮ Models and algorithms for the product pricing with single-minded customers requesting bundles ⋮ Competitive location and pricing on a line with metric transportation costs ⋮ Automated Design of Revenue-Maximizing Combinatorial Auctions ⋮ On envy-free revenue approximation for combinatorial buyers with budgets ⋮ Pricing on Paths: A PTAS for the Highway Problem ⋮ Optimal deterministic auctions with correlated priors ⋮ Unnamed Item ⋮ On fair price discrimination in multi-unit markets ⋮ Online pricing for bundles of multiple items ⋮ A hybrid approach to the solution of a pricing model with continuous demand segmentation ⋮ Stackelberg network pricing is hard to approximate ⋮ Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments ⋮ Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets ⋮ On social envy-freeness in multi-unit markets ⋮ Competitive Equilibrium with Indivisible Goods and Generic Budgets ⋮ On core-selecting and core-competitive mechanisms for binary single-parameter auctions ⋮ Envy-free pricing in multi-item markets ⋮ Unnamed Item ⋮ Auctions with online supply ⋮ Fair by design: multidimensional envy-free mechanisms ⋮ The power of randomness in Bayesian optimal mechanism design

This page was built for publication: