ALDT
2015
Springer
8 years 7 months ago
2015
Springer
Abstract. We address optimal group manipulation in multidimensional, multi-facility location problems. We focus on two families of mechanisms, generalized median and quantile mecha...
ALDT
2015
Springer
8 years 7 months ago
2015
Springer
It is well known that standard game-theoretic approaches to voting mechanisms lead to a multitude of Nash Equilibria (NE), many of which are counter-intuitive. We focus on truth-bi...
ALDT
2015
Springer
8 years 7 months ago
2015
Springer
We show that a number of election-related problems with prices (such as, for example, bribery) are fixed-parameter tractable (in FPT) when parameterized by the number of candidate...
ALDT
2015
Springer
8 years 7 months ago
2015
Springer
To tackle the potentially hard task of defining the reward function in a Markov Decision Process (MDPs), a new approach, called Interactive Value Iteration (IVI) has recently been...
ALDT
2015
Springer
8 years 7 months ago
2015
Springer
Abstract. We propose a framework for automated multi-attribute decision making, employing the probabilistic non-monotonic description logics proposed by Lukasiewicz in 2008. Using ...
ALDT
2015
Springer
8 years 7 months ago
2015
Springer
Many mathematical frameworks aim at modeling human preferences, employing a number of methods including utility functions, qualitative preference statements, constraint optimizatio...
ALDT
2015
Springer
8 years 7 months ago
2015
Springer
In this paper, we address the problem of comparing the performances of two popular aggregation operators, the weighted sum and the Choquet integral, for selecting the best alternat...
ALDT
2015
Springer
8 years 7 months ago
2015
Springer
Moving beyond the dualistic view in AI where agent and environment are separated incurs new challenges for decision making, as calculation of expected utility is no longer straigh...
101
click to vote
WALCOM
2016
IEEE
8 years 7 months ago
2016
IEEE
In the obnoxious facility game, a location for an undesirable facility is to be determined based on the voting of selfish agents. Design of group strategy proof mechanisms has be...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
The standard parameterization of the VERTEX COVER problem (Given an undirected graph G and k ∈ N as input, does G have a vertex cover of size at most k?) has the solution size k...