English
Related papers

Related papers: Testing Consumer Rationality using Perfect Graphs …

200 papers

The poset cover problem seeks a minimum set of partial orders whose linear extensions cover a given set of linear orders. Recognizing its NP-completeness, we devised a non-trivial reduction to the Boolean satisfiability problem using a…

Logic in Computer Science · Computer Science 2025-05-08 Chih-Cheng Rex Yuan , Bow-Yaw Wang

This paper is devoted to revealed preference theory and its applications to testing economic data for consistency with utility maximization hypothesis, construction of index numbers, and forecasting. The quantitative measures of…

Optimization and Control · Mathematics 2015-01-26 Nikolay Klemashev , Alexander Shananin

Economic theory implies strong limitations on what types of consumption behavior are considered rational. Rationality implies that the Slutsky matrix, which captures the substitution effects of compensated price changes on demand for…

Econometrics · Economics 2026-02-11 Florian Gunsilius , Lonjezo Sithole

Completeness and transitivity are standard rationality conditions in economics. However, under ambiguity, decision makers sometimes violate these requirements because of the difficulty of forming accurate predictions about ambiguous events.…

Theoretical Economics · Economics 2025-09-16 Kensei Nakamura , Shohei Yanagita

In this paper, an algorithm for determining 3-colorability, i.e. the decision problem (YES/NO), in planar graphs is presented. The algorithm, although not exact (it could produce false positives) has two very important features: (i) it has…

Discrete Mathematics · Computer Science 2011-02-01 Jose Antonio Martin H

The fair allocation of mixed goods, consisting of both divisible and indivisible goods, has been a prominent topic of study in economics and computer science. We define an allocation as fair if its utility vector minimizes a symmetric…

Computer Science and Game Theory · Computer Science 2024-07-10 Yasushi Kawase , Koichi Nishimura , Hanna Sumita

This paper shows that it is computationally hard to decide (or test) if a consumption data set is consistent with separable preferences.

Computer Science and Game Theory · Computer Science 2014-01-21 Federico Echenique

Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…

Condensed Matter · Physics 2009-11-07 M. A. Marchisio

We study generalizations of online bipartite matching in which each arriving vertex (customer) views a ranked list of offline vertices (products) and matches to (purchases) the first one they deem acceptable. The number of products that the…

Data Structures and Algorithms · Computer Science 2023-06-27 Brian Brubach , Nathaniel Grammel , Will Ma , Aravind Srinivasan

A family of Markov blankets in a faithful Bayesian network satisfies the symmetry and consistency properties. In this paper, we draw a bijection between families of consistent Markov blankets and moral graphs. We define the new concepts of…

Machine Learning · Computer Science 2019-03-06 Yang Li , Kevin Korb , Lloyd Allison

In mathematical optimization, we want to find the best possible solution for a decision-making problem. Curiously, these problems are harder to solve if they have discrete decisions. Imagine that you would like to buy chocolate: you can buy…

Optimization and Control · Mathematics 2025-12-23 Thiago Serra

Recommender systems often operate on item catalogs clustered by genres, and user bases that have natural clusterings into user types by demographic or psychographic attributes. Prior work on system-wide diversity has mainly focused on…

Information Retrieval · Computer Science 2019-08-28 Arda Antikacioglu , Tanvi Bajpai , R. Ravi

In recommendation literature, explainability and fairness are becoming two prominent perspectives to consider. However, prior works have mostly addressed them separately, for instance by explaining to consumers why a certain item was…

Information Retrieval · Computer Science 2023-08-24 Ludovico Boratto , Francesco Fabbri , Gianni Fenu , Mirko Marras , Giacomo Medda

Accuracy and diversity have long been considered to be two conflicting goals for recommendations. We point out, however, that as the diversity is typically measured by certain pre-selected item attributes, e.g., category as the most…

Information Retrieval · Computer Science 2023-01-16 Xiaoying Zhang , Hongning Wang , Hang Li

Diversity maximization problem is a well-studied problem where the goal is to find $k$ diverse items. Fair diversity maximization aims to select a diverse subset of $k$ items from a large dataset, while requiring that each group of items be…

Data Structures and Algorithms · Computer Science 2025-06-11 Florian Adriaens , Nikolaj Tatti

In this paper, we tackle the problem of computing a sequence of rankings with the guarantee of the Pareto-optimal balance between (1) maximizing the utility of the consumers and (2) minimizing unfairness between producers of the items. Such…

Information Retrieval · Computer Science 2024-02-23 Phuong Dinh Mai , Duc-Trong Le , Tuan-Anh Hoang , Dung D. Le

When selling information products, the seller can provide some free partial information to change people's valuations so that the overall revenue can possibly be increased. We study the general problem of advertising information products by…

Computer Science and Game Theory · Computer Science 2021-09-24 Shuran Zheng , Yiling Chen

To choose between two discrete goods, a consumer pays attention to only those with prices below a threshold. From these, she chooses her most preferred good. We assume consumers in a population have the same preference but may have…

Theoretical Economics · Economics 2025-11-07 Kaushil Patel

When tracking user-specific online activities, each user's preference is revealed in the form of choices and comparisons. For example, a user's purchase history is a record of her choices, i.e. which item was chosen among a subset of…

Machine Learning · Statistics 2019-01-01 Sahand Negahban , Sewoong Oh , Kiran K. Thekumparampil , Jiaming Xu

Beyond accuracy, there are a variety of aspects to the quality of recommender systems, such as diversity, fairness, and robustness. We argue that many of the prevalent problems in recommender systems are partly due to low-dimensionality of…

Information Retrieval · Computer Science 2023-05-24 Naoto Ohsaka , Riku Togashi
‹ Prev 1 4 5 6 7 8 10 Next ›