Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Revelation policies in an e-marketplace differ in terms of the level of competitive information disseminated to participating sellers. Since sellers who repeatedly compete against...
Amy R. Greenwald, Karthik Kannan, Ramayya Krishnan
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
The trend towards highly specialized solution providers cooperatively offering configurable products and services to their customers requires the extension of current (standalone)...
Alexander Felfernig, Gerhard Friedrich, Dietmar Ja...
This paper presents the person identification system developed at Athens Information Technology and its performance in the CLEAR 2007 evaluations. The system operates on the audiov...
Andreas Stergiou, Aristodemos Pnevmatikakis, Lazar...