Abstract
Consumer preference studies in economics rest heavily on the behavioural interpretation of preference especially in the form of Revealed Preference Theory (RPT). Viewing purchasing decisions as a species of human reasoning, in this paper we are interested in generalising behaviourism to preference-based argumentation where existing frameworks are universally governed by the opposing mentalistic interpretation of preference. Concretely we re-construct and unify two main approaches to RPT then develop a so-called Revealed Preference Argumentation (RPA) framework which identifies preference as observed reasoning behaviour of an agent. We show that RPA subsumes RPT, by showing that key RPT-based consumer analyses can be translated to and solved as RPA computational tasks. It is argued that RPA may pave the way for future applications of argumentation to behavioural economics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Intransitive preference, though seems odd, is not uncommon, see e.g. [25].
- 2.
Intuitively, a weak preference of x over y is to mean “x is at least as good as y” while a strict one means “x is strictly better than y”.
- 3.
- 4.
We do not impose any constraints on P except that it is a binary relation over \(\mathcal Arg\).
- 5.
A complete extension contains all sub-arguments of its arguments.
- 6.
The set of conclusions of arguments in a complete extension is consistent.
- 7.
A choice c is decisive if \(c(B) \ne \emptyset \) for any menu \(B \in \mathcal B\).
- 8.
For an illustration let’s borrow an example from [30]. An economist and her friend visit a sushi restaurant for the first time. The economist has read about wasabi and knows what it looks like. Her friend mistakes it for avocado and devours a whole spoonful. That is, the friend was observed to choose wasabi but did not have an argument for choosing it. If the economist models her friend’s choice options as “eating a spoonful of wasabi” and “not doing that”, then as a revealed preference theorist, she will conclude that her friend prefers “eating a spoonful of wasabi” to “not doing that”, which is obviously wrong.
- 9.
Recall that a regular preference relation is either a regular-weak preference relation or regular-strict preference relation (Definition 3).
- 10.
Recall that for an argument preference relation Q, \(\mathcal R_Q \triangleq \{(x,y) \mid (arg_x, arg_y) \in Q\}\) denotes the corresponding preference relation over options.
References
Amgoud, L., Cayrol, C., Lagasquie-Schiex, M.C., Livet, P.: On bipolarity in argumentation frameworks. Int. J. Intell. Syst. 23(10), 1062–1093 (2008)
Amgoud, L.: Postulates for logic-based argumentation systems. Int. J. Approximate Reason. 55(9), 2028–2048 (2014). Weighted Logics for Artificial Intelligence
Amgoud, L., Cayrol, C.: A reasoning model based on the production of acceptable arguments. Ann. Math. AI 34(1–3), 197–215 (2002)
Baroni, P., Cerutti, F., Giacomin, M., Guida, G.: Encompassing attacks to attacks in abstract argumentation frameworks. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS (LNAI), vol. 5590, pp. 83–94. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02906-6_9
Bench-Capon, T.: Persuasion in practical argument using value-based argumentation frameworks. J. Log. Comput. 13(3), 429–448 (2003)
Bench-Capon, T., Atkinson, K.: Abstract argumentation and values. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence, pp. 45–64. Springer, Boston (2009). https://doi.org/10.1007/978-0-387-98197-0_3
Brewka, G., Woltran, S.: Abstract dialectical frameworks. In: Proceedings of KR 2010, pp. 102–111. AAAI Press (2010)
Caminada, M., Amgoud, L.: On the evaluation of argumentation formalisms. Artif. Intell. 171(5–6), 286–310 (2007)
Dietrich, F., List, C.: Mentalism versus behaviourism in economics: a philosophy-of-science perspective. Econ. Philos. 32(2), 249–281 (2016)
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321–357 (1995)
Dung, P.M.: An axiomatic analysis of structured argumentation with priorities. Artif. Intell. 231, 107–150 (2016)
Dung, P.M., Thang, P.M.: Fundamental properties of attack relations in structured argumentation with priorities. Artif. Intell. 255, 1–42 (2018)
Hanh, D.D., Dung, P.M., Hung, N.D., Thang, P.M.: Inductive defense for sceptical semantics of extended argumentation. J. Logic Comput. 21(1), 307–349 (2010)
Hung, N.D., Huynh, V.-N.: Revealed preference in argumentation: algorithms and applications. Int. J. Approximate Reason. 131, 214–251 (2021)
Kaci, S., van der Torre, L.: Preference-based argumentation: arguments supporting multiple values. Int. J. Approximate Reason. 48(3), 730–751 (2008). Special Section on Choquet Integration in honor of Gustave Choquet (1915–2006) and Special Section on Nonmonotonic and Uncertain Reasoning
Kido, H., Liao, B.: A Bayesian approach to direct and inverse abstract argumentation problems. arXiv e-prints, page arXiv:1909.04319, September 2019
Kido, H., Okamoto, K.: A Bayesian approach to argument-based reasoning for attack estimation. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 249–255 (2017)
Kim, T., Richter, M.K.: Nontransitive-nontotal consumer theory. J. Econ. Theory 38(2), 324–363 (1986)
Mahesar, Q., Oren, N., Vasconcelos, W.W.: Computing preferences in abstract argumentation. In: Miller, T., Oren, N., Sakurai, Y., Noda, I., Savarimuthu, B.T.R., Cao Son, T. (eds.) PRIMA 2018. LNCS (LNAI), vol. 11224, pp. 387–402. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-03098-8_24
Mahesar, Q., Oren, N., Vasconcelos, W.W.: Preference elicitation in assumption-based argumentation. In: Uchiya, T., Bai, Q., Maestre, I.M. (eds.) PRIMA 2020. LNCS, vol. 12568, pp. 199–214. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-69322-0_13
Richter, M.K.: Preferences, utility, and demand, Chapter 2. In: Rational Choice. Harcourt Brace, Jovanovich (1971)
Modgil, S.: Reasoning about preferences in argumentation frameworks. Artif. Intell. 173(9–10), 901–934 (2009)
Modgil, S., Prakken, H.: A general account of argumentation with preferences. Artif. Intell. 195, 361–397 (2013)
Modgil, S., Prakken, H.: The aspic+ framework for structured argumentation: a tutorial. Argument Comput. 5(1), 31–62 (2014)
Panda, S.C.: Rational choice with intransitive preferences. Stud. Microecon. 6(1–2), 66–83 (2018)
Samuelson, P.A.: A note on the pure theory of consumer’s behaviour. Economica 5(17), 61–71 (1938)
Samuelson, P.A.: Consumption theory in terms of revealed preference. Economica 15(60), 243–253 (1948)
Sen, A.: Behaviour and the concept of preference. Economica 40(159), 241–259 (1973)
Smeulders, B., Crama, Y., Spieksma, F.C.R.: Revealed preference theory: an algorithmic outlook. Eur. J. Oper. Res. 272(3), 803–815 (2019)
Thoma, J.: In defence of revealed preference theory. Econ. Philos. 1–25 (2020). https://doi.org/10.1017/S0266267120000073
Acknowledgment
Nguyen Duy Hung is supported by Center of Excellence in Intelligent Informatics, Speech and Language Technology and Service Innovation (CILS), and Intelligent Informatics and Service Innovation (IISI) Research Center of Sirindhorn International Institute of Technology; Van-Nam Huynh is supported by the US Office of Naval Research Global (ONRG, Grant No. N62909-19-1-2031).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Hung, N.D., Huynh, VN. (2021). Revealed Preference Argumentation and Applications in Consumer Behaviour Analyses. In: Rosenfeld, A., Talmon, N. (eds) Multi-Agent Systems. EUMAS 2021. Lecture Notes in Computer Science(), vol 12802. Springer, Cham. https://doi.org/10.1007/978-3-030-82254-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-82254-5_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-82253-8
Online ISBN: 978-3-030-82254-5
eBook Packages: Computer ScienceComputer Science (R0)