We study efficient algorithms for a natural learning problem in markets. There is one seller with m divisible goods and n buyers with unknown individual utility functions and budgets of money. The seller can repeatedly announce prices and observe aggregate demand bundles requested by the buyers. The goal of the seller is to learn the utility functions and budgets of the buyers. Our scenario falls into the classic domain of ''revealed preference'' analysis. Problems with revealed preference have recently started to attract increased interest in computer science due to their fundamental nature in understanding customer behavior in electronic markets. The goal of revealed preference analysis is to observe rational agent behavior, to explain it...
We study the Fisher model of a competitive market from the algorithmic perspective. For that, the re...
In this paper, we consider the problem of a shop agent negotiating bilaterally with many customers a...
Revealed preference techniques are used to test whether a data set is compatible with rational behav...
We study efficient algorithms for a natural learning problem in markets. There is one seller with m ...
We consider the problem of learning from revealed preferences in an online setting. In our framework...
We consider a setting where n buyers, with combinatorial preferences over m items, and a seller, run...
We present the first analysis of Fisher markets with buyers that have budget-additive utility functi...
This thesis investigates how sellers in e-commerce can maximize revenue by utilizing dynamic pricing...
International audienceWe propose an agent-based computational model to investigate sequential Dutch ...
We design a simple ascending-price algorithm to compute a (1 + ϵ )-approximate equilibrium in Arrow-...
We study the learning problem of revealed preference in a stochastic setting: a learner observes the...
In computational markets utilizing algorithms that establish a general equilibrium, competitive beha...
In this paper we explore the relationship between "preference elicitation", a learning-style problem...
We provide a revealed preference characterization of equilibrium behavior in first price sealed bid ...
This thesis examines conditions under which prices signal information about agents' preferences, end...
We study the Fisher model of a competitive market from the algorithmic perspective. For that, the re...
In this paper, we consider the problem of a shop agent negotiating bilaterally with many customers a...
Revealed preference techniques are used to test whether a data set is compatible with rational behav...
We study efficient algorithms for a natural learning problem in markets. There is one seller with m ...
We consider the problem of learning from revealed preferences in an online setting. In our framework...
We consider a setting where n buyers, with combinatorial preferences over m items, and a seller, run...
We present the first analysis of Fisher markets with buyers that have budget-additive utility functi...
This thesis investigates how sellers in e-commerce can maximize revenue by utilizing dynamic pricing...
International audienceWe propose an agent-based computational model to investigate sequential Dutch ...
We design a simple ascending-price algorithm to compute a (1 + ϵ )-approximate equilibrium in Arrow-...
We study the learning problem of revealed preference in a stochastic setting: a learner observes the...
In computational markets utilizing algorithms that establish a general equilibrium, competitive beha...
In this paper we explore the relationship between "preference elicitation", a learning-style problem...
We provide a revealed preference characterization of equilibrium behavior in first price sealed bid ...
This thesis examines conditions under which prices signal information about agents' preferences, end...
We study the Fisher model of a competitive market from the algorithmic perspective. For that, the re...
In this paper, we consider the problem of a shop agent negotiating bilaterally with many customers a...
Revealed preference techniques are used to test whether a data set is compatible with rational behav...