Mechanisms for information elicitation (Q2389691): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.artint.2008.08.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2118208231
@@ Property / OpenAlex ID: W2118208231 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4902563
@@ Property / cites work: Q4902563 / rank @@
+Normal rank
@@ Property / cites work @@
+Elicitation of Personal Probabilities and Expectations
+Normal rank
@@ Property / cites work @@
+Strictly Proper Scoring Rules, Prediction, and Estimation
+Normal rank
@@ Property / cites work @@
+Proper Scores for Probability Forecasters
@@ Property / cites work: Proper Scores for Probability Forecasters / rank @@
+Normal rank
@@ Property / cites work @@
+Agreeing to disagree
@@ Property / cites work: Agreeing to disagree / rank @@
+Normal rank
@@ Property / cites work @@
+Iterated expectations and common priors
@@ Property / cites work: Iterated expectations and common priors / rank @@
+Normal rank
@@ Property / cites work @@
+Q4424377
@@ Property / cites work: Q4424377 / rank @@
+Normal rank
@@ Property / cites work @@
+Overcoming free riding in multi-party computations -- the anonymous case
+Normal rank
@@ Property / cites work @@
+Algorithmic mechanism design (extended abstract)
@@ Property / cites work: Algorithmic mechanism design (extended abstract) / rank @@
+Normal rank
@@ Property / cites work @@
+Robust solutions of uncertain linear programs
@@ Property / cites work: Robust solutions of uncertain linear programs / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Q3772828
@@ Property / cites work: Q3772828 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4253255
@@ Property / cites work: Q4253255 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity and approximability of finding maximum feasible subsystems of linear relations
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2389691