Titlebook: Algorithmic Decision Theory; 6th International Co Sa?a Peke?,Kristen Brent Venable Conference proceedings 2019 Springer Nature Switzerland

航天飛機(jī)

書目名稱Algorithmic Decision Theory影響因子(影響力)




書目名稱Algorithmic Decision Theory影響因子(影響力)學(xué)科排名




書目名稱Algorithmic Decision Theory網(wǎng)絡(luò)公開度




書目名稱Algorithmic Decision Theory網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Algorithmic Decision Theory被引頻次




書目名稱Algorithmic Decision Theory被引頻次學(xué)科排名




書目名稱Algorithmic Decision Theory年度引用




書目名稱Algorithmic Decision Theory年度引用學(xué)科排名




書目名稱Algorithmic Decision Theory讀者反饋




書目名稱Algorithmic Decision Theory讀者反饋學(xué)科排名

寒冷

Towards Characterizing the Deterministic Combinatorial Constrained Efficient Space,n that the valuation for the largest bundle is more than the budget for at least one of the players then the following are true. (a) VCG does not fulfill the basic properties of deterministic, dominant-strategy incentive compatible, individual rationality and Pareto optimality when the all-item bund

SUE

On the Parameterized Complexity of Party Nominations, even on profiles that are both single-peaked and single-crossing. This strengthens previously established hardness results. We also show a polynomial time result for the related . problem on single-crossing elections.

哪有黃油

https://doi.org/10.1007/b102376ters (e.g., a weighted sum, an OWA aggregator, a Choquet integral) and that a (near-)optimal solution can be efficiently determined when preferences are precisely known. For the multi-objective traveling salesman problem, we provide numerical results obtained with different query generation strategi

Cholecystokinin

并入

商業(yè)上

Combining Local Search and Elicitation for Multi-Objective Combinatorial Optimization,timization problems with imprecise preferences. We assume that the decision maker’s preferences over solutions can be represented by a parameterized scalarizing function but the parameters are initially not known. In our approach, the parameter imprecision is progressively reduced by iteratively ask

陪審團(tuán)

Robustness of Approval-Based Multiwinner Voting Rules,e extent to which a committee can change after we add/remove/swap one approval, and we consider the computational complexity of deciding how many such operations are necessary to change the set of winning committees. We also consider the counting variants of our problems, which can be interpreted as

Ige326

Triglyceride