找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
31#
發(fā)表于 2025-3-27 00:22:47 | 只看該作者
32#
發(fā)表于 2025-3-27 03:56:00 | 只看該作者
Gradient Methods for Solving Stackelberg Games,ures for solving this type of games using gradient methods. We study time and space scalability of both approaches and discuss in which situation it is more appropriate to use each of them. Finally, we illustrate their use in an adversarial prediction problem.
33#
發(fā)表于 2025-3-27 08:57:54 | 只看該作者
Interactive Elicitation of a Majority Rule Sorting Model with Maximum Margin Optimization,classification in a limited number of elicitation steps. We propose efficient strategies for computing the next question and show how its computation can be formulated as a linear program. We present experimental results showing the effectiveness of our approach.
34#
發(fā)表于 2025-3-27 09:53:29 | 只看該作者
35#
發(fā)表于 2025-3-27 15:25:48 | 只看該作者
https://doi.org/10.1007/978-3-030-31489-7artificial intelligence; automatic differentiation; autonomous agents; coalition formations; combinatori
36#
發(fā)表于 2025-3-27 20:24:24 | 只看該作者
978-3-030-31488-0Springer Nature Switzerland AG 2019
37#
發(fā)表于 2025-3-27 23:40:23 | 只看該作者
https://doi.org/10.1007/b102376timization 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
38#
發(fā)表于 2025-3-28 02:07:08 | 只看該作者
https://doi.org/10.1007/b102376e 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
39#
發(fā)表于 2025-3-28 09:38:19 | 只看該作者
40#
發(fā)表于 2025-3-28 12:04:58 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-13 06:29
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
子长县| 大英县| 萨嘎县| 余姚市| 峡江县| 合山市| 彭泽县| 罗定市| 惠来县| 仁布县| 威海市| 东乡族自治县| 张家港市| 凭祥市| 马边| 新龙县| 陆川县| 图们市| 栖霞市| 镇远县| 道孚县| 常德市| 九龙城区| 全南县| 绥中县| 夹江县| 乐至县| 额尔古纳市| 南部县| 拉萨市| 莫力| 太仓市| 江门市| 富宁县| 秦安县| 布尔津县| 梁山县| 神农架林区| 舞钢市| 崇左市| 商城县|