9 citations · 16 across the 4 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2018
Prophets and Secretaries with Overbooking
Tomer Ezra, Michal Feldman, Ilan Nehama
The prophet and secretary problems demonstrate online scenarios involving the optimal stopping theory. In a typical prophet or secretary problem, selection decisions are assumed to…
cs.GT2016★ 1 cited
Analyzing Games with Ambiguous Player Types using the Decision Model
Ilan Nehama
In many common interactive scenarios, participants lack information about other participants, and specifically about the preferences of other participants. In this work, we model a…
cs.GT2010★ 5 cited
Approximate Judgement Aggregation
Ilan Nehama
In this paper we analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint bet…