Envy-free pricing (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Envy-free pricing" in English language version.

refsWebsite

Global rank English rank

21doi.org

2^nd place

13semanticscholar.org

11^th place

8^th place

7worldcat.org

5^th place

7arxiv.org

69^th place

59^th place

4springer.com

274^th place

309^th place

3acm.org

1,185^th place

840^th place

3psu.edu

207^th place

136^th place

2ieee.org

652^nd place

515^th place

2siam.org

low place

6,473^rd place

1handle.net

102^nd place

76^th place

1gssi.it

low place

acm.org

dl.acm.org

Guruswami, Venkatesan; Hartline, Jason D.; Karlin, Anna R.; Kempe, David; Kenyon, Claire; McSherry, Frank (23 January 2005). On profit-maximizing envy-free pricing. Society for Industrial and Applied Mathematics. pp. 1164–1173. ISBN 978-0-89871-585-9.
Briest, Patrick; Krysta, Piotr (2006-01-22). "Single-minded unlimited supply pricing on sparse instances". Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06. Miami, Florida: Society for Industrial and Applied Mathematics. pp. 1093–1102. doi:10.1145/1109557.1109678. ISBN 978-0-89871-605-4. S2CID 4191038.
Monaco, Gianpiero; Sankowski, Piotr; Zhang, Qiang (2015-07-25). "Revenue maximization envy-free pricing for homogeneous resources". Proceedings of the 24th International Conference on Artificial Intelligence. IJCAI'15. Buenos Aires, Argentina: AAAI Press: 90–96. ISBN 978-1-57735-738-4.

arxiv.org

Devanur, Nikhil R.; Hartline, Jason D.; Yan, Qiqi (2015-03-01). "Envy freedom and prior-free mechanism design". Journal of Economic Theory. 156: 103–143. arXiv:1212.3741. doi:10.1016/j.jet.2014.08.001. ISSN 0022-0531. S2CID 17990320.
Chalermsook, P.; Laekhanukit, B.; Nanongkai, D. (2013-10-01). "Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 370–379. arXiv:1308.2617. doi:10.1109/FOCS.2013.47. ISBN 978-0-7695-5135-7. S2CID 972321.
Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon (2013-01-06). "Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More". Proceedings of the 2013 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. pp. 1557–1576. arXiv:1212.4129. doi:10.1137/1.9781611973105.112. ISBN 978-1-61197-251-1. S2CID 6556716. Retrieved 2021-04-04.
Bilò, Vittorio; Flammini, Michele; Monaco, Gianpiero (2017-02-01). "Approximating the revenue maximization problem with sharp demands". Theoretical Computer Science. 662: 9–30. arXiv:1312.3892. doi:10.1016/j.tcs.2016.12.002. ISSN 0304-3975.
Amanatidis, Georgios; Fulla, Peter; Markakis, Evangelos; Sornat, Krzysztof (2019-12-17). "Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results". arXiv:1606.06664 [cs.GT].
Elbassioni, Khaled; Fouz, Mahmoud; Swamy, Chaitanya (2010). "Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply". In Saberi, Amin (ed.). Internet and Network Economics. Lecture Notes in Computer Science. Vol. 6484. Berlin, Heidelberg: Springer. pp. 462–472. arXiv:1312.0137. doi:10.1007/978-3-642-17572-5_39. ISBN 978-3-642-17572-5. S2CID 14124011.
Bérczi, Kristóf; Codazzi, Laura; Golak, Julian; Grigoriev, Alexander (2023). "Dynamic Envy-Freeness in Pricing". arXiv:2301.01529 [cs.GT].

doi.org

Balcan, Maria-Florina; Blum, Avrim; Mansour, Yishay (2008). "Item pricing for revenue maximization". In Fortnow, Lance; Riedl, John; Sandholm, Tuomas (eds.). Proceedings of the 9th ACM Conference on Electronic Commerce (EC-2008), Chicago, IL, USA, June 8-12, 2008. pp. 50–59. doi:10.1145/1386790.1386802. ISBN 9781605581699. S2CID 53038874.
Briest, Patrick; Krysta, Piotr (2006-01-22). "Single-minded unlimited supply pricing on sparse instances". Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06. Miami, Florida: Society for Industrial and Applied Mathematics. pp. 1093–1102. doi:10.1145/1109557.1109678. ISBN 978-0-89871-605-4. S2CID 4191038.
Briest, Patrick (2008). "Uniform Budgets and the Envy-Free Pricing Problem". In Aceto, Luca; Damgård, Ivan; Goldberg, Leslie Ann; Halldórsson, Magnús M.; Ingólfsdóttir, Anna; Walukiewicz, Igor (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 5125. Springer Berlin Heidelberg. pp. 808–819. CiteSeerX 10.1.1.205.433. doi:10.1007/978-3-540-70575-8_66. ISBN 9783540705758.
Chen, Ning; Ghosh, Arpita; Vassilvitskii, Sergei (2011). "SIAM (Society for Industrial and Applied Mathematics)". SIAM Journal on Computing. 40 (3): 623–645. CiteSeerX 10.1.1.193.6235. doi:10.1137/080740970.
Im, Sungjin; Lu, Pinyan; Wang, Yajun (2010). "Envy-Free Pricing with General Supply Constraints". In Saberi, Amin (ed.). Internet and Network Economics. Lecture Notes in Computer Science. Vol. 6484. Berlin, Heidelberg: Springer. pp. 483–491. doi:10.1007/978-3-642-17572-5_41. ISBN 978-3-642-17572-5.
Chen, Ning; Deng, Xiaotie (1 February 2014). "Envy-free Pricing in Multi-item Markets". ACM Transactions on Algorithms. 10 (2): 7:1–7:15. CiteSeerX 10.1.1.297.784. doi:10.1145/2567923. ISSN 1549-6325. S2CID 15309106.
Cheung, M.; Swamy, C. (2008-10-01). "Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. pp. 35–44. doi:10.1109/FOCS.2008.15. ISBN 978-0-7695-3436-7. S2CID 1318192.
Devanur, Nikhil R.; Hartline, Jason D.; Yan, Qiqi (2015-03-01). "Envy freedom and prior-free mechanism design". Journal of Economic Theory. 156: 103–143. arXiv:1212.3741. doi:10.1016/j.jet.2014.08.001. ISSN 0022-0531. S2CID 17990320.
Chalermsook, Parinya; Chuzhoy, Julia; Kannan, Sampath; Khanna, Sanjeev (2012). "Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply". In Gupta, Anupam; Jansen, Klaus; Rolim, José; Servedio, Rocco (eds.). Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science. Vol. 7408. Berlin, Heidelberg: Springer. pp. 73–84. doi:10.1007/978-3-642-32512-0_7. ISBN 978-3-642-32512-0.
Chalermsook, P.; Laekhanukit, B.; Nanongkai, D. (2013-10-01). "Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 370–379. arXiv:1308.2617. doi:10.1109/FOCS.2013.47. ISBN 978-0-7695-5135-7. S2CID 972321.
Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon (2013-01-06). "Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More". Proceedings of the 2013 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. pp. 1557–1576. arXiv:1212.4129. doi:10.1137/1.9781611973105.112. ISBN 978-1-61197-251-1. S2CID 6556716. Retrieved 2021-04-04.
Demaine, Erik D.; Feige, Uriel; Hajiaghayi, MohammadTaghi; Salavatipour, Mohammad R. (2008-01-01). "Combination Can Be Hard: Approximability of the Unique Coverage Problem". SIAM Journal on Computing. 38 (4): 1464–1483. doi:10.1137/060656048. ISSN 0097-5397. S2CID 12248889.
Anshelevich, Elliot; Kar, Koushik; Sekar, Shreyas (2017-08-09). "Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare". ACM Transactions on Economics and Computation. 5 (3): 16:1–16:42. doi:10.1145/3105786. ISSN 2167-8375. S2CID 7008965.
Bilò, Vittorio; Flammini, Michele; Monaco, Gianpiero (2017-02-01). "Approximating the revenue maximization problem with sharp demands". Theoretical Computer Science. 662: 9–30. arXiv:1312.3892. doi:10.1016/j.tcs.2016.12.002. ISSN 0304-3975.
Colini-Baldeschi, Riccardo; Leonardi, Stefano; Sankowski, Piotr; Zhang, Qiang (2014). "Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets". In Liu, Tie-Yan; Qi, Qi; Ye, Yinyu (eds.). Web and Internet Economics. Lecture Notes in Computer Science. Vol. 8877. Cham: Springer International Publishing. pp. 233–246. doi:10.1007/978-3-319-13129-0_18. hdl:11573/754515. ISBN 978-3-319-13129-0.
Feldman, Michal; Fiat, Amos; Leonardi, Stefano; Sankowski, Piotr (2012). "Revenue maximizing envy-free multi-unit auctions with budgets". Proceedings of the 13th ACM Conference on Electronic Commerce. EC '12. New York, NY, USA: ACM. pp. 532–549. doi:10.1145/2229012.2229052. ISBN 9781450314152. S2CID 15639601.
Chen, Ning; Rudra, Atri (2008-09-01). "Walrasian Equilibrium: Hardness, Approximations and Tractable Instances". Algorithmica. 52 (1): 44–64. doi:10.1007/s00453-007-9103-9. ISSN 1432-0541. S2CID 18839423.
Alon, Noga; Mansour, Yishay; Tenneholtz, Moshe (2013-06-16). "Differential pricing with inequity aversion in social networks". Proceedings of the fourteenth ACM conference on Electronic commerce. EC '13. Philadelphia, Pennsylvania, USA: Association for Computing Machinery. pp. 9–24. doi:10.1145/2492002.2482545. ISBN 978-1-4503-1962-1.
Flammini, Michele; Mauro, Manuel; Tonelli, Matteo (2019-04-01). "On social envy-freeness in multi-unit markets". Artificial Intelligence. 269: 1–26. doi:10.1016/j.artint.2018.12.003. ISSN 0004-3702. S2CID 19205358.
Elbassioni, Khaled; Fouz, Mahmoud; Swamy, Chaitanya (2010). "Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply". In Saberi, Amin (ed.). Internet and Network Economics. Lecture Notes in Computer Science. Vol. 6484. Berlin, Heidelberg: Springer. pp. 462–472. arXiv:1312.0137. doi:10.1007/978-3-642-17572-5_39. ISBN 978-3-642-17572-5. S2CID 14124011.

dx.doi.org

Devanur, Nikhil R.; Hartline, Jason D.; Yan, Qiqi (2015-03-01). "Envy freedom and prior-free mechanism design". Journal of Economic Theory. 156: 103–143. arXiv:1212.3741. doi:10.1016/j.jet.2014.08.001. ISSN 0022-0531. S2CID 17990320.

gssi.it

iris.gssi.it

"Inequity Aversion Pricing in Multi-Unit Markets". iris.gssi.it. Retrieved 2021-04-05.

handle.net

hdl.handle.net

Colini-Baldeschi, Riccardo; Leonardi, Stefano; Sankowski, Piotr; Zhang, Qiang (2014). "Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets". In Liu, Tie-Yan; Qi, Qi; Ye, Yinyu (eds.). Web and Internet Economics. Lecture Notes in Computer Science. Vol. 8877. Cham: Springer International Publishing. pp. 233–246. doi:10.1007/978-3-319-13129-0_18. hdl:11573/754515. ISBN 978-3-319-13129-0.

ieee.org

ieeexplore.ieee.org

Cheung, M.; Swamy, C. (2008-10-01). "Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. pp. 35–44. doi:10.1109/FOCS.2008.15. ISBN 978-0-7695-3436-7. S2CID 1318192.
Chalermsook, P.; Laekhanukit, B.; Nanongkai, D. (2013-10-01). "Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 370–379. arXiv:1308.2617. doi:10.1109/FOCS.2013.47. ISBN 978-0-7695-5135-7. S2CID 972321.

psu.edu

citeseerx.ist.psu.edu

Briest, Patrick (2008). "Uniform Budgets and the Envy-Free Pricing Problem". In Aceto, Luca; Damgård, Ivan; Goldberg, Leslie Ann; Halldórsson, Magnús M.; Ingólfsdóttir, Anna; Walukiewicz, Igor (eds.). Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 5125. Springer Berlin Heidelberg. pp. 808–819. CiteSeerX 10.1.1.205.433. doi:10.1007/978-3-540-70575-8_66. ISBN 9783540705758.
Chen, Ning; Ghosh, Arpita; Vassilvitskii, Sergei (2011). "SIAM (Society for Industrial and Applied Mathematics)". SIAM Journal on Computing. 40 (3): 623–645. CiteSeerX 10.1.1.193.6235. doi:10.1137/080740970.
Chen, Ning; Deng, Xiaotie (1 February 2014). "Envy-free Pricing in Multi-item Markets". ACM Transactions on Algorithms. 10 (2): 7:1–7:15. CiteSeerX 10.1.1.297.784. doi:10.1145/2567923. ISSN 1549-6325. S2CID 15309106.

semanticscholar.org

api.semanticscholar.org

Balcan, Maria-Florina; Blum, Avrim; Mansour, Yishay (2008). "Item pricing for revenue maximization". In Fortnow, Lance; Riedl, John; Sandholm, Tuomas (eds.). Proceedings of the 9th ACM Conference on Electronic Commerce (EC-2008), Chicago, IL, USA, June 8-12, 2008. pp. 50–59. doi:10.1145/1386790.1386802. ISBN 9781605581699. S2CID 53038874.
Briest, Patrick; Krysta, Piotr (2006-01-22). "Single-minded unlimited supply pricing on sparse instances". Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06. Miami, Florida: Society for Industrial and Applied Mathematics. pp. 1093–1102. doi:10.1145/1109557.1109678. ISBN 978-0-89871-605-4. S2CID 4191038.
Chen, Ning; Deng, Xiaotie (1 February 2014). "Envy-free Pricing in Multi-item Markets". ACM Transactions on Algorithms. 10 (2): 7:1–7:15. CiteSeerX 10.1.1.297.784. doi:10.1145/2567923. ISSN 1549-6325. S2CID 15309106.
Cheung, M.; Swamy, C. (2008-10-01). "Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. pp. 35–44. doi:10.1109/FOCS.2008.15. ISBN 978-0-7695-3436-7. S2CID 1318192.
Devanur, Nikhil R.; Hartline, Jason D.; Yan, Qiqi (2015-03-01). "Envy freedom and prior-free mechanism design". Journal of Economic Theory. 156: 103–143. arXiv:1212.3741. doi:10.1016/j.jet.2014.08.001. ISSN 0022-0531. S2CID 17990320.
Chalermsook, P.; Laekhanukit, B.; Nanongkai, D. (2013-10-01). "Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 370–379. arXiv:1308.2617. doi:10.1109/FOCS.2013.47. ISBN 978-0-7695-5135-7. S2CID 972321.
Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon (2013-01-06). "Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More". Proceedings of the 2013 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. pp. 1557–1576. arXiv:1212.4129. doi:10.1137/1.9781611973105.112. ISBN 978-1-61197-251-1. S2CID 6556716. Retrieved 2021-04-04.
Demaine, Erik D.; Feige, Uriel; Hajiaghayi, MohammadTaghi; Salavatipour, Mohammad R. (2008-01-01). "Combination Can Be Hard: Approximability of the Unique Coverage Problem". SIAM Journal on Computing. 38 (4): 1464–1483. doi:10.1137/060656048. ISSN 0097-5397. S2CID 12248889.
Anshelevich, Elliot; Kar, Koushik; Sekar, Shreyas (2017-08-09). "Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare". ACM Transactions on Economics and Computation. 5 (3): 16:1–16:42. doi:10.1145/3105786. ISSN 2167-8375. S2CID 7008965.
Feldman, Michal; Fiat, Amos; Leonardi, Stefano; Sankowski, Piotr (2012). "Revenue maximizing envy-free multi-unit auctions with budgets". Proceedings of the 13th ACM Conference on Electronic Commerce. EC '12. New York, NY, USA: ACM. pp. 532–549. doi:10.1145/2229012.2229052. ISBN 9781450314152. S2CID 15639601.
Chen, Ning; Rudra, Atri (2008-09-01). "Walrasian Equilibrium: Hardness, Approximations and Tractable Instances". Algorithmica. 52 (1): 44–64. doi:10.1007/s00453-007-9103-9. ISSN 1432-0541. S2CID 18839423.
Flammini, Michele; Mauro, Manuel; Tonelli, Matteo (2019-04-01). "On social envy-freeness in multi-unit markets". Artificial Intelligence. 269: 1–26. doi:10.1016/j.artint.2018.12.003. ISSN 0004-3702. S2CID 19205358.
Elbassioni, Khaled; Fouz, Mahmoud; Swamy, Chaitanya (2010). "Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply". In Saberi, Amin (ed.). Internet and Network Economics. Lecture Notes in Computer Science. Vol. 6484. Berlin, Heidelberg: Springer. pp. 462–472. arXiv:1312.0137. doi:10.1007/978-3-642-17572-5_39. ISBN 978-3-642-17572-5. S2CID 14124011.

siam.org

epubs.siam.org

Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon (2013-01-06). "Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More". Proceedings of the 2013 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. pp. 1557–1576. arXiv:1212.4129. doi:10.1137/1.9781611973105.112. ISBN 978-1-61197-251-1. S2CID 6556716. Retrieved 2021-04-04.
Demaine, Erik D.; Feige, Uriel; Hajiaghayi, MohammadTaghi; Salavatipour, Mohammad R. (2008-01-01). "Combination Can Be Hard: Approximability of the Unique Coverage Problem". SIAM Journal on Computing. 38 (4): 1464–1483. doi:10.1137/060656048. ISSN 0097-5397. S2CID 12248889.

springer.com

link.springer.com

Im, Sungjin; Lu, Pinyan; Wang, Yajun (2010). "Envy-Free Pricing with General Supply Constraints". In Saberi, Amin (ed.). Internet and Network Economics. Lecture Notes in Computer Science. Vol. 6484. Berlin, Heidelberg: Springer. pp. 483–491. doi:10.1007/978-3-642-17572-5_41. ISBN 978-3-642-17572-5.
Chalermsook, Parinya; Chuzhoy, Julia; Kannan, Sampath; Khanna, Sanjeev (2012). "Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply". In Gupta, Anupam; Jansen, Klaus; Rolim, José; Servedio, Rocco (eds.). Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science. Vol. 7408. Berlin, Heidelberg: Springer. pp. 73–84. doi:10.1007/978-3-642-32512-0_7. ISBN 978-3-642-32512-0.
Colini-Baldeschi, Riccardo; Leonardi, Stefano; Sankowski, Piotr; Zhang, Qiang (2014). "Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets". In Liu, Tie-Yan; Qi, Qi; Ye, Yinyu (eds.). Web and Internet Economics. Lecture Notes in Computer Science. Vol. 8877. Cham: Springer International Publishing. pp. 233–246. doi:10.1007/978-3-319-13129-0_18. hdl:11573/754515. ISBN 978-3-319-13129-0.
Elbassioni, Khaled; Fouz, Mahmoud; Swamy, Chaitanya (2010). "Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply". In Saberi, Amin (ed.). Internet and Network Economics. Lecture Notes in Computer Science. Vol. 6484. Berlin, Heidelberg: Springer. pp. 462–472. arXiv:1312.0137. doi:10.1007/978-3-642-17572-5_39. ISBN 978-3-642-17572-5. S2CID 14124011.

worldcat.org

search.worldcat.org

Chen, Ning; Deng, Xiaotie (1 February 2014). "Envy-free Pricing in Multi-item Markets". ACM Transactions on Algorithms. 10 (2): 7:1–7:15. CiteSeerX 10.1.1.297.784. doi:10.1145/2567923. ISSN 1549-6325. S2CID 15309106.
Devanur, Nikhil R.; Hartline, Jason D.; Yan, Qiqi (2015-03-01). "Envy freedom and prior-free mechanism design". Journal of Economic Theory. 156: 103–143. arXiv:1212.3741. doi:10.1016/j.jet.2014.08.001. ISSN 0022-0531. S2CID 17990320.
Demaine, Erik D.; Feige, Uriel; Hajiaghayi, MohammadTaghi; Salavatipour, Mohammad R. (2008-01-01). "Combination Can Be Hard: Approximability of the Unique Coverage Problem". SIAM Journal on Computing. 38 (4): 1464–1483. doi:10.1137/060656048. ISSN 0097-5397. S2CID 12248889.
Anshelevich, Elliot; Kar, Koushik; Sekar, Shreyas (2017-08-09). "Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare". ACM Transactions on Economics and Computation. 5 (3): 16:1–16:42. doi:10.1145/3105786. ISSN 2167-8375. S2CID 7008965.
Bilò, Vittorio; Flammini, Michele; Monaco, Gianpiero (2017-02-01). "Approximating the revenue maximization problem with sharp demands". Theoretical Computer Science. 662: 9–30. arXiv:1312.3892. doi:10.1016/j.tcs.2016.12.002. ISSN 0304-3975.
Chen, Ning; Rudra, Atri (2008-09-01). "Walrasian Equilibrium: Hardness, Approximations and Tractable Instances". Algorithmica. 52 (1): 44–64. doi:10.1007/s00453-007-9103-9. ISSN 1432-0541. S2CID 18839423.
Flammini, Michele; Mauro, Manuel; Tonelli, Matteo (2019-04-01). "On social envy-freeness in multi-unit markets". Artificial Intelligence. 269: 1–26. doi:10.1016/j.artint.2018.12.003. ISSN 0004-3702. S2CID 19205358.