On stackelberg pricing with computationally bounded customers-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On stackelberg pricing with computationally bounded customers

Published:2011-09-30 Issue:1 Volume:60 Page:31-44
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Briest Patrick,Gualà Luciano,Hoefer Martin,Ventre Carmine

Funder

DFG

EPSRC

German Academic Exchange Service (DAAD), EP

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/net.20457/fullpdf

Reference32 articles.

1. G. Aggarwal T. Feder R. Motwani A. Zhu Algorithms for multi-product pricing 2004 72 83

2. Approximation algorithms and online mechanisms for item pricing;Balcan;Theory Comput,2007

3. Reducing mechanism design to algorithm design via machine learning;Balcan;J Comput Syst Sci,2008

4. M. F. Balcan A. Blum Y. Mansour Item pricing for revenue maximization 2008 50 59

5. P. Berman M. Karpinski Improved approximation lower bounds on small occurrence optimization,Technical report ECCC-TR03-008 2003

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solution techniques for Bi-level Knapsack Problems;Computers & Operations Research;2023-11

2. Stackelberg packing games;Theoretical Computer Science;2023-01

3. Stackelberg Vertex Cover on a Path;Algorithmic Game Theory;2023

4. Stackelberg Packing Games;SSRN Electronic Journal;2022

5. On the Stackelberg knapsack game;European Journal of Operational Research;2021-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP