REVIEW 3 major objections 5 minor 279 references
Welfare Approximation in Multilateral Trade
T0 review · 3 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash
Pith's one-line read The welfare cost of requiring all k agents to approve a trade is essentially k^{3/2} for Bayesian truthful mechanisms and k^2 for dominant-strategy ones.
desk verdict A natural and likely-important model with a clean DSIC result and credible lower bounds, but the central BIC mechanism's incentive verification has a real gap that needs fixing before the main theorem can stand. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is a family of pricing mechanisms in which one agent pays every other agent a fixed price equal to 2k E[w_j]; if a trade occurs, the payer's expected utility alone is shown to be an O(k)-approximation of social welfare unless the no-trade outcome is already O($k^{2}$)-good. For the Bayesian improvement, the paper splits welfare into a high-value part H (X_i > 4kW) and a moderate part M, uses a lead/follow/abort game to capture H, and for M selects a low-baseline set A, computes thresholds t_i via Pr[X_i > t_i] = Pr[X_i > t]/2, and solves for prices c_i so that each agent self-selects into paying, receiving, or vetoing while the selected payers' contributions always cover the followers' compensations; the key technical lemma (Claim A.1 plus local-limit estimates) guarantees the payer set is large enough with constant probability and c_i ≤ t_i/2. Lower bounds rest on the observation that a single agent's misreport barely changes the trade probability, so charging high types and paying low types simultaneously violates budget balance unless trades are rare.
What would settle it
Take the i.i.d. hard instance from Theorem 5.1 (t_i Bernoulli(1/log k), c_i Bernoulli($log^{2}$ k/k), v_i = (√k/(640 $log^{2}$ k)) t_i, w_i = c_i) and compute the worst-case welfare ratio among all symmetric BIC, individually rational, strongly budget-balanced mechanisms. If any mechanism achieves ratio o($k^{{3/2}}$) (equivalently, trades with probability ω(1/$k^{{3/2}}$)), the claimed lower bound is false; if the best mechanism's ratio is Ω($k^{{3/2}}$), the characterization is confirmed.
Extended reading notes
Core claim
The paper's central claim is that multilateral veto power has a quantifiable welfare cost. In the k-lateral trade model with independent private values, the optimal Bayesian welfare approximation under individual rationality and budget balance is Θ~($k^{{3/2}}$): Theorem 4.1 gives a BIC, strongly budget-balanced, individually rational mechanism with Õ($k^{{3/2}}$) approximation, and Theorem 5.1 shows a hard i.i.d. instance where every BIC, IR, SBB mechanism is Ω~($k^{{3/2}}$)-competitive. The DSIC version has exponent 2: Theorem 3.1's pricing mechanism is O($k^{2}$)-competitive and Theorem 5.2 matches it. The paper also proves a separation: for the gains-from-trade benchmark, no such mechanism can approximate the optimum within $e^{{o(k)}}$, and in the ℓ-out-of-k partial-agreement model the approximation improves from roughly $k^{2}$ to $k^{2}$/(k−ℓ)^2 in the DSIC case and from $k^{{3/2}}$ to $k^{{3/2}}$/(k−ℓ) in the BIC case, up to logarithmic factors.
Load-bearing premise
The mechanisms' prices and thresholds are computed from the exact prior distributions of the agents' values; if that prior is misspecified, the DSIC mechanism's welfare guarantee can fail and the BIC mechanism may no longer be truthful.
Editorial extensions
If this is right
- For any k-way deal with voluntary participation and no subsidies, the worst-case welfare loss is at least about k^{3/2} even if agents are Bayesian-strategyproof, so no clever payment scheme avoids this loss.
- Relaxing from dominant-strategy to Bayesian truthfulness is worth a factor of about √k in the approximation ratio.
- Under the gains-from-trade benchmark, the situation is exponentially worse: no BIC, IR, budget-balanced mechanism can guarantee even e^{o(k)} of the optimum.
- In the ℓ-out-of-k variant, allowing d = k−ℓ agents to be bypassed improves the DSIC guarantee from about k^2 to k^2/d^2 and the BIC guarantee from about k^{3/2} to k^{3/2}/d, up to logarithmic factors.
Reading between the lines
- Editorial inference: the lower-bound constructions use only two-point independent distributions, so the k^{3/2} exponent appears intrinsic to unanimity rather than to distributional richness; the same threshold structure may reappear in other unanimity games such as private-provision public goods.
- The paper does not claim robustness: because prices and thresholds depend on exact priors, a designer with a misspecified model cannot rely on the BIC guarantee; prior-free or sample-based versions would likely pay an extra factor.
- An extension the paper leaves implicit is that the ℓ-out-of-k results quantify the value of reducing veto power: buying out d veto players improves guarantees at a rate of about 1/d (BIC) or 1/d^2 (DSIC), which could guide institutional design of land-assembly or patent-pool exemptions.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces k-lateral trade, in which a single deal requires all k agents to agree, and studies welfare approximation under incentive compatibility, individual rationality, and budget balance. The main results are a DSIC pricing mechanism with approximation ratio O(k^2), a BIC mechanism with ratio O~(k^{3/2}), matching lower bounds up to polylogarithmic factors for both, an exponential separation for the gains-from-trade benchmark, and an extension to ℓ-out-of-k partial agreement with corresponding upper and lower bounds. The proofs combine simple pricing ideas with threshold-based BIC mechanisms, and the lower bounds use symmetric hard instances with two-point type distributions and concentration/local-limit estimates.
Significance. If the results hold, the paper gives a nearly tight characterization of Bayesian welfare approximation in a natural multilateral generalization of bilateral trade, which is a significant contribution to mechanism design. The DSIC pricing mechanism is simple and elegant, and the lower-bound constructions are explicit and falsifiable. The paper also correctly identifies that the BIC regime offers a polynomial improvement over DSIC and that gains-from-trade is exponentially harder than welfare, which are conceptually interesting findings. The main positive BIC result, however, rests on a BIC verification step that is not justified as written, so the central upper bound is currently unsupported; the gap appears local and potentially repairable, but it is load-bearing.
major comments (3)
- [Section 4.2, Lemma 4.4] The BIC verification uses interim trade probabilities that do not match the mechanism's actual trade conditions. For an agent i in A, a report in [-q_i,t_i) leads to trade only if, in addition to Y^{-i}≥m, every agent in [k]\(S∪{i⋆}) reports X_j≥-q_j and condition (3) is satisfied; a report above t_i leads to trade only if Y^{-i}≥m-1 together with the same conditions. Using Lemma 4.3 and |S|≥m, condition (3) is implied by X_{i⋆}≥-q_{i⋆}, but the remaining acceptance event E={∀j∈[k]\{i,i⋆}: X_j≥-q_j} is not independent of Y^{-i}, because for j∈A\{i} the same X_j determines both membership in Y^{-i} and the event X_j≥-q_j. The true ratio of trade probabilities is therefore Pr[Y^{-i}≥m, E]/Pr[Y^{-i}≥m-1, E], not Pr[Y^{-i}≥m]/Pr[Y^{-i}≥m-1]. The definition of c_i and the displayed expected utilities in Lemma 4.4 replace the former by the latter, so the indifference at X_i=t_i does not follow, and truthful reporting need not be interim optimal. Since Theorem 4.1 rests entirely on this mechanism, the main BIC upper bound is not established as written. The proof should redefine c_i using the full event E and re-run the estimates of Claim A.1 and Lemma 4.3, or prove that the omitted event changes the relevant ratio only by a controlled factor and then re-derive BIC.
- [Proof of Theorem 4.1, first case split] The theorem's case split has a gap involving the regime V≤120k^{1.5}log(k)W. Section 4.2's analysis, including Lemma 4.5 and Equation (5), explicitly assumes V>120k^{1.5}log(k)W, yet the proof of Theorem 4.1 invokes the Section 4.2 mechanism whenever M≥V/2 without checking this inequality. If V≤120k^{1.5}log(k)W and W<OPT/(k^{1.5}log k), none of the listed cases supplies a proven mechanism. This is patchable: in that regime OPT≤W+V≤(120k^{1.5}log k+1)W, so the never-trade mechanism is O(k^{1.5}log k)-competitive; the first bullet's threshold should be stated with an appropriate constant. Please make this case split explicit.
- [Appendix B, Lemma B.1] The proof of monotonicity of the allocation rule invokes Myerson's payment identity as though the agents had a single-dimensional type, but in the lower-bound instances agents have two-dimensional types (v_i,w_i), and the mechanism is not assumed to depend only on X_i=v_i-w_i. The needed monotonicity in X_i must be derived from the pairwise BIC constraints among the four discrete types (e.g., between A and B, and between C and D), which is likely possible but is not what is written. Since Lemma B.1 is used in the lower-bound proofs of Theorems 5.1, 5.2, and 5.3, the proof should be made complete or the statement should be replaced by the specific inequalities that follow from BIC.
minor comments (5)
- [Lemma 4.5] In the display, the indicator uses the symbol p_j, but only q_j is defined in the mechanism; please align the notation with the mechanism definition and specify the exact set of agents over which the conjunction is taken.
- [Section 4.2, Equation (7) and footnote 4] The tie-breaking convention at X_i=t_i is stated to make the agent indifferent in expectation, but this claim depends on the same missing BIC calculation; once c_i is redefined, the tie-breaking rule should be rechecked.
- [Section 4.1, equilibrium existence] The existence of the Bayesian equilibrium with the claimed properties is asserted without a fixed-point or explicit best-response argument; since the revelation principle is invoked, please make the equilibrium-existence step precise.
- [Appendix F, Lemma F.10] The proof of Lemma F.10 says it follows the proof of Lemma 4.3 'with different absolute constants' after conditioning on E^{-i}; please provide the details, since the conditioning event is not independent of Y^{-i} and the analogous issue to the k-lateral BIC proof may arise in the partial-agreement setting.
- [Throughout] There are several typographical issues, including 'eO'/'eΩ' for tilde notation, 'R 2k ≥0' for the Euclidean domain, and a duplicated ']]' in Appendix C; these should be cleaned up in revision.
Circularity Check
No significant circularity: the main constructions and lower bounds are self-contained, and the only author-inclusive citation is not load-bearing.
full rationale
The paper's positive results are derived from model primitives rather than from fitted data or from self-cited uniqueness theorems. The DSIC pricing mechanism in Theorem 3.1 sets transfers using E[w_i] and OPT bounds, and its competitiveness proof is a direct union-bound/Markov argument. The BIC mechanism in Section 4.2 defines thresholds t_i and prices c_i from the prior distributions and from the tail probabilities Pr[X_i >= t_i]; these definitions do not presuppose the target welfare approximation, and the lower bounds in Section 5 use explicitly constructed i.i.d. instances with binomial concentration arguments rather than relying on prior results for the same claim. The only reference that includes one of the present authors is the related-work citation to Babaioff, Rubinstein, Tan, and Wang (STOC 2026), and it is purely contextual, not used to justify any theorem in this paper. One non-circular concern was flagged: Lemma 4.4's BIC verification states the interim utility only in terms of Y^{-i} and omits conditions (2) and (3) of the mechanism's trade rule, so the c_i calibration may not establish interim optimality as written. That is a missing proof or correctness gap in the central upper-bound argument, but it is not a circular dependence of the claimed result on its own inputs: the c_i values are computed from the prior and the thresholds, not from the welfare bound they are intended to establish. Under the required rubric, an unsupported proof step is distinct from circularity, so the appropriate finding is essentially no circular burden, with a score of 1 reflecting the single non-load-bearing author-inclusive citation.
Assumptions & free parameters
assumptions (5)
- domain assumption Values are private and independently distributed across agents; each agent has quasi-linear utility.
- domain assumption The designer knows the prior distributions F_i and G_i.
- standard math Myerson's payment identity and the revelation principle.
- standard math Standard concentration inequalities (Markov, Chernoff, Berry-Esseen, uniform local limit theorem).
- standard math In the lower bounds, by symmetry we may restrict to symmetric mechanisms via a random permutation.
Cite this review
Pith. "Pith review of Welfare Approximation in Multilateral Trade." pith.science (2026). https://pith.science/paper/ZKZR7Z3L
@misc{pith2026260811351,
author = {Pith},
title = {Pith review of: Welfare Approximation in Multilateral Trade},
year = {2026},
howpublished = {\url{https://pith.science/paper/ZKZR7Z3L}},
note = {Machine review of arXiv:2608.11351}
}
abstract
We introduce the study of \emph{multilateral trade}: a mechanism-design problem in which a single potential trade involves $k$ agents and can be executed only if all $k$ agents agree to participate. The classical case $k=2$ is the well-studied bilateral trade problem, where a seller and a buyer with private values must decide whether to trade an item initially held by the seller. Existing extensions of bilateral trade have largely focused on markets with many buyers and many sellers, but where each realized transaction is still bilateral, requiring agreement only between the matched buyer and seller. Our formulation captures settings in which the trade itself requires joint participation, coupling the agents' incentives and creating new challenges. We study welfare approximation in this setting under incentive compatibility, individual rationality, and budget balance. We give a DSIC mechanism with approximation ratio $O(k^2)$, and a BIC mechanism with approximation ratio $\widetilde O(k^{3/2})$. We prove matching lower bounds up to polylogarithmic factors. Finally, we extend the model to an $\ell$-out-of-$k$ partial-agreement setting, where the trade may occur once at least $\ell$ agents participate. In this relaxed model, the welfare guarantees improve smoothly as $k-\ell$, the number of agents whose participation is not required, grows, and we obtain matching upper and lower bounds up to polylogarithmic factors.
Reference graph
Works this paper leans on
-
[1]
Approximating Gains-from-Trade in Matching Markets , booktitle =
Moshe Babaioff and Aviad Rubinstein and Xizhi Tan and Kangning Wang , editor =. Approximating Gains-from-Trade in Matching Markets , booktitle =. 2026 , url =. doi:10.1145/3798129.3800786 , timestamp =
arXiv 2026
-
[2]
American Economic Review , volume=
Bounded rationality and robust mechanism design: An axiomatic approach , author=. American Economic Review , volume=
-
[3]
International Economic Review , volume=
Obviously Strategy-Proof Implementation Of Assignment Rules: A New Characterization , author=. International Economic Review , volume=
-
[4]
arXiv preprint arXiv:2505.17885 , year=
Transaction Fee Mechanism Design for Leaderless Blockchain Protocols , author=. arXiv preprint arXiv:2505.17885 , year=
-
[5]
arXiv preprint arXiv:2301.13321 , year=
Censorship resistance in on-chain auctions , author=. arXiv preprint arXiv:2301.13321 , year=
-
[6]
arXiv preprint arXiv:2512.02354 , year=
Characterizing Off-Chain Influence Proof Transaction Fee Mechanisms , author=. arXiv preprint arXiv:2512.02354 , year=
-
[7]
arXiv preprint arXiv:2512.11739 , year=
Analyzing the Economic Impact of Decentralization on Users , author=. arXiv preprint arXiv:2512.11739 , year=
-
[8]
The Annals of Mathematical Statistics , pages=
Asymptotic minimax character of the sample distribution function and of the classical multinomial estimator , author=. The Annals of Mathematical Statistics , pages=. 1956 , publisher=
1956
Show all 279 references
-
[9]
The annals of Probability , pages=
The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality , author=. The annals of Probability , pages=. 1990 , publisher=
1990
-
[10]
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , year=
Hao Chung and Elaine Shi , title =. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , year=
2023
-
[11]
On the Computational Properties of Obviously Strategy-Proof Mechanisms , author=
-
[12]
Discrete Applied Mathematics , volume=
Some remarks on the stable matching problem , author=. Discrete Applied Mathematics , volume=. 1985 , publisher=
1985
-
[13]
American Economic Journal: Microeconomics , volume=
Manipulability of stable mechanisms , author=. American Economic Journal: Microeconomics , volume=
-
[14]
Games and Economic Behavior , year=2018, volume=
Rees-Jones, Alex , title=. Games and Economic Behavior , year=2018, volume=. doi:10.1016/j.geb.2017.04.011 , abstract=
2018 doi
-
[15]
School choice: an experimental study , journal =
Yan Chen and Tayfun Sönmez , keywords =. School choice: an experimental study , journal =. 2006 , issn =. doi:https://doi.org/10.1016/j.jet.2004.10.006 , url =
2006 doi
-
[16]
American Economic Review , volume=
The mechanism is truthful, why aren't you? , author=. American Economic Review , volume=
-
[17]
Econometrica , volume=
The economist as engineer: Game theory, experimentation, and computation as tools for design economics , author=. Econometrica , volume=. 2002 , publisher=
2002
-
[18]
1985 , journal =
The college admissions problem is not equivalent to the marriage problem , author =. 1985 , journal =
1985
-
[19]
Roth and Marilda Sotomayor , journal =
Alvin E. Roth and Marilda Sotomayor , journal =. The College Admissions Problem Revisited , volume =. 1989 , abstract =
1989
-
[20]
Roth , journal =
Alvin E. Roth , journal =. On the Allocation of Residents to Rural Hospitals: A General Property of Two-Sided Matching Markets , volume =
-
[21]
Proceedings of the 32nd Annual
Yash Kanoria and Seungki Min and Pengyu Qian , title =. Proceedings of the 32nd Annual
-
[22]
2017 , journal =
Unbalanced Random Matching Markets: The Stark Effect of Competition , author =. 2017 , journal =
2017
-
[23]
Mathematics of Operations Research , volume =
Pittel, Boris , title =. Mathematics of Operations Research , volume =. 2019 , doi =. https://doi.org/10.1287/moor.2017.0917 , annotate =
2019
-
[24]
Management Science , volume =
Teo, Chung-Piaw and Sethuraman, Jay and Tan, Wee-Peng , title =. Management Science , volume =. 2001 , doi =. https://doi.org/10.1287/mnsc.47.9.1252.9784 , annotate =
2001
-
[25]
and Freedman, David A
Dubins, Lester E. and Freedman, David A. , year =
-
[26]
David Gale and Marilda Sotomayor , journal =. Ms. Machiavelli and the Stable Matching Problem , volume =. 1985 , annotate =
1985
-
[27]
and Leather, Paul , title =
Irving, Robert W. and Leather, Paul , title =. SIAM Journal on Computing , volume =. 1986 , pages =
1986
-
[28]
and Gharan, Shayan O
Karlin, Anna R. and Gharan, Shayan O. and Weber, Robbie , title =. Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC) , year =
-
[29]
1989 , isbn =
Dan Gusfield and Robert Irving , title =. 1989 , isbn =
1989
-
[30]
Wilson, L. B. An analysis of the stable marriage assignment algorithm. BIT Numerical Mathematics. 1972. doi:10.1007/BF01932966
1972 doi
-
[31]
1997 , annotate =
Donald Knuth , title =. 1997 , annotate =
1997
-
[32]
SIAM Journal on Discrete Mathematics , volume =
Pittel, Boris , title =. SIAM Journal on Discrete Mathematics , volume =. 1989 , pages =
1989
-
[33]
On Likely Solutions of a Stable Marriage Problem
Pittel, Boris. On Likely Solutions of a Stable Marriage Problem. Annals of Applied Probabability. 1992
1992
-
[34]
Proceedings of the 16th Annual
Nicole Immorlica and Mohammad Mahdian , title =. Proceedings of the 16th Annual
-
[35]
Journal of Economic Theory , volume=
Stable matching mechanisms are not obviously strategy-proof , author=. Journal of Economic Theory , volume=
-
[36]
2013 , publisher=
Algorithmics of matching under preferences , author=. 2013 , publisher=
2013
-
[37]
, booktitle=
Bade, Sophie and Gonczarowski, Yannai A. , booktitle=
-
[38]
Econometrica , volume=
Efficient resource allocation on the basis of priorities , author=. Econometrica , volume=. 2002 , publisher=
2002
-
[39]
Journal of Economic Theory , volume=
Matching with single-peaked preferences , author=. Journal of Economic Theory , volume=. 2019 , publisher=
2019
-
[40]
Limitations of VCG-based mechanisms , Url =
Shahar Dobzinski and Noam Nisan , Bibsource =. Limitations of VCG-based mechanisms , Url =. 2011 , Bdsk-Url-1 =. doi:10.1007/s00493-011-2528-4 , Journal =
2011 doi
-
[41]
Communication complexity , Year =
Eyal Kushilevitz and Noam Nisan , Date-Added =. Communication complexity , Year =
-
[42]
Towards a Characterization of Truthful Combinatorial Auctions , Url =
Ron Lavi and Ahuva Mu'alem and Noam Nisan , Bibsource =. Towards a Characterization of Truthful Combinatorial Auctions , Url =. 44th Symposium on Foundations of Computer Science. 2003 , Bdsk-Url-1 =. doi:10.1109/SFCS.2003.1238230 , Pages =
2003 arXiv
-
[43]
Shahar Dobzinski , Howpublished =
-
[44]
and Slivkins, Aleksandrs , Doi =
Babaioff, Moshe and Kleinberg, Robert D. and Slivkins, Aleksandrs , Doi =. Truthful Mechanisms with Implicit Payment Computation , Url =. J. ACM , Keywords =. 2015 , Bdsk-Url-1 =
2015
-
[45]
The communication cost of selfishness , Volume =
Fadel, Ronald and Segal, Ilya , Journal =. The communication cost of selfishness , Volume =
-
[46]
The communication burden of payment determination , Url =
Moshe Babaioff and Liad Blumrosen and Michael Schapira , Doi =. The communication burden of payment determination , Url =. Games and Economic Behavior , Keywords =. 2013 , Bdsk-Url-1 =
2013
-
[48]
Sur le probleme du partage pragmatique de H
Knaster, Bronislaw , Booktitle =. Sur le probleme du partage pragmatique de H. Steinhaus , Volume =
-
[49]
Matthew Weinberg , Bibsource =
Linda Cai and Clayton Thomas and S. Matthew Weinberg , Bibsource =. Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms When Demand Queries Are NP-Hard , Url =. 11th Innovations in Theoretical Computer Science Conference,. 2020 , Bdsk-Url-1 =....
2020 doi
-
[50]
Matthew , Booktitle =
Schneider, Jon and Schvartzman, Ariel and Weinberg, S. Matthew , Booktitle =. Condorcet-Consistent and Approximately Strategyproof Tournament Rules , Year =
-
[51]
Nonmanipulable Randomized Tournament Selections , Url =
Alon Altman and Robert Kleinberg , Conference =. Nonmanipulable Randomized Tournament Selections , Url =. 2010 , Bdsk-Url-1 =
2010
-
[52]
and Tennenholtz, Moshe , Booktitle =
Altman, Alon and Procaccia, Ariel D. and Tennenholtz, Moshe , Booktitle =. Nonmanipulable Selections from a Tournament , Url =. 2009 , Bdsk-Url-1 =
2009
-
[53]
Handbook of Computational Social Choice , Year =
Brandt, Felix and Conitzer, Vincent and Endriss, Ulle and Lang, J. Handbook of Computational Social Choice , Year =
-
[54]
The computational complexity of the elimination problem in generalized sports competitions , Volume =
Kern, Walter and Paulusma, Dani. The computational complexity of the elimination problem in generalized sports competitions , Volume =. Discrete Optimization , Number =
-
[55]
Swap bribery , Year =
Elkind, Edith and Faliszewski, Piotr and Slinko, Arkadii , Booktitle =. Swap bribery , Year =
-
[56]
Complexity of Shift Bribery in Committee Elections , Year =
Bredereck, Robert and Faliszewski, Piotr and Niedermeier, Rolf and Talmon, Nimrod , Journal =. Complexity of Shift Bribery in Committee Elections , Year =
-
[57]
Fixing a Balanced Knockout Tournament
Aziz, Haris and Gaspers, Serge and Mackenzie, Simon and Mattei, Nicholas and Stursberg, Paul and Walsh, Toby , Booktitle =. Fixing a Balanced Knockout Tournament. , Year =
-
[58]
Procaccia and Alex Samorodnitsky , Title =
Felix Fischer and Ariel D. Procaccia and Alex Samorodnitsky , Title =
-
[59]
arXiv , Author =:1211.0515 , Journal =
-
[60]
Can strategizing in round-robin subtournaments be avoided? , Url =
Pauly, Marc , Journal =. Can strategizing in round-robin subtournaments be avoided? , Url =. 2014 , Bdsk-Url-1 =
2014
-
[61]
Ranking the Participants in a Tournament , Url =
Ariel Rubinstein , Issn =. Ranking the Participants in a Tournament , Url =. SIAM Journal on Applied Mathematics , Number =. 1980 , Bdsk-Url-1 =
1980
-
[62]
Tennis match fixing: Evidence of suspected match-fixing revealed , Year =
-
[63]
Italy breaks up soccer match-fixing network involving mafia , Year =
-
[64]
Badminton pairs expelled from London 2012 Olympics after 'match-fixing' scandal , Year =
2012
-
[65]
12 arrested in eSports match fixing scandal - Report , Year =
-
[66]
No3: West Germany 1-0 Austria in 1982 , Year =
World Cup: 25 stunning moments ... No3: West Germany 1-0 Austria in 1982 , Year =
1982
-
[67]
The Tennis Triangle , Year =
-
[68]
Arrow , Issn =
Kenneth J. Arrow , Issn =. A Difficulty in the Concept of Social Welfare , Url =. Journal of Political Economy , Number =. 1950 , Bdsk-Url-1 =
1950
-
[69]
Manipulation of Schemes that Mix Voting with Chance , Url =
Allan Gibbard , Issn =. Manipulation of Schemes that Mix Voting with Chance , Url =. Econometrica , Number =. 1977 , Bdsk-Url-1 =
1977
-
[70]
Manipulation of voting schemes: a general result , Volume =
Allan Gibbard , Journal =. Manipulation of voting schemes: a general result , Volume =
-
[71]
Tournament solutions and majority voting , Year =
Laslier, Jean-Francois , Number =. Tournament solutions and majority voting , Year =
-
[72]
Copeland , Journal =
A.H. Copeland , Journal =. A 'reasonable' social welfare function , Year =
-
[73]
Covering sets and a new condorcet choice correspondence , Url =
Bhaskar Dutta , Doi =. Covering sets and a new condorcet choice correspondence , Url =. Journal of Economic Theory , Number =. 1988 , Bdsk-Url-1 =
1988
-
[74]
Fishburn , Doi =
Peter C. Fishburn , Doi =. Condorcet Social Choice Functions , Url =. 1977 , Bdsk-Url-1 =. http://dx.doi.org/10.1137/0133030 , Journal =
1977 doi
-
[75]
Rivest and Emily Shen , Title =
Ronald L. Rivest and Emily Shen , Title =
-
[76]
H. P. Young , Issn =. Social Choice Scoring Functions , Url =. SIAM Journal on Applied Mathematics , Number =. 1975 , Bdsk-Url-1 =
1975
-
[77]
Moulin , Issn =
H. Moulin , Issn =. Choosing from a Tournament , Url =. Social Choice and Welfare , Number =. 1986 , Bdsk-Url-1 =
1986
-
[78]
Schwartz , Issn =
T. Schwartz , Issn =. Cyclic Tournaments and Cooperative Majority Voting: A Solution , Url =. Social Choice and Welfare , Number =. 1990 , Bdsk-Url-1 =
1990
-
[79]
Strategy-proofness and Arrow's conditions: Existence and Correspondence theorems for voting procedures and social welfare functions , Volume =
Mark Allen Satterthwaite , Journal =. Strategy-proofness and Arrow's conditions: Existence and Correspondence theorems for voting procedures and social welfare functions , Volume =
-
[80]
Miller , Issn =
Nicholas R. Miller , Issn =. A New Solution Set for Tournaments and Majority Voting: Further Graph- Theoretical Approaches to the Theory of Voting , Url =. American Journal of Political Science , Number =. 1980 , Bdsk-Url-1 =
1980
-
[81]
Kim and Warut Suksompong and Virginia Vassilevska Williams , Bibsource =
Michael P. Kim and Warut Suksompong and Virginia Vassilevska Williams , Bibsource =. Who Can Win a Single-Elimination Tournament? , Url =. Proceedings of the Thirtieth. 2016 , Bdsk-Url-1 =
2016
-
[82]
Kim and Virginia Vassilevska Williams , Bibsource =
Michael P. Kim and Virginia Vassilevska Williams , Bibsource =. Fixing Tournaments for Kings, Chokers, and More , Url =. Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence,. 2015 , Bdsk-Url-1 =
2015
-
[83]
Rigging Tournament Brackets for Weaker Players , Url =
Isabelle Stanton and Virginia Vassilevska Williams , Bibsource =. Rigging Tournament Brackets for Weaker Players , Url =. 2011 , Bdsk-Url-1 =. doi:10.5591/978-1-57735-516-8/IJCAI11-069 , Pages =
2011 doi
-
[84]
On the complexity of schedule control problems for knockout tournaments , Url =
Thuc Vu and Alon Altman and Yoav Shoham , Bibsource =. On the complexity of schedule control problems for knockout tournaments , Url =. 8th International Joint Conference on Autonomous Agents and Multiagent Systems. 2009 , Bdsk-Url-1 =. doi:10.1145/1558013.1558044 , Pages =
2009
-
[85]
Bartholdi and Craig A
John J. Bartholdi and Craig A. Tovey and Michael A. Trick , Doi =. How hard is it to control an election? , Url =. Mathematical and Computer Modelling , Number =. 1992 , Bdsk-Url-1 =
1992
-
[86]
Shepsle and Barry R
Kenneth A. Shepsle and Barry R. Weingast , Issn =. Uncovered Sets and Sophisticated Voting Outcomes with Implications for Agenda Institutions , Url =. American Journal of Political Science , Number =. 1984 , Bdsk-Url-1 =
1984
-
[87]
2018 FIFA World Cup qualification can be manipulated , Year =
Csato, Laszlo , Month =. 2018 FIFA World Cup qualification can be manipulated , Year =
2018
-
[88]
Maurer , Issn =
Stephen B. Maurer , Issn =. The King Chicken Theorems , Url =. Mathematics Magazine , Number =. 1980 , Bdsk-Url-1 =
1980
-
[89]
Fixing a Tournament , Url =
Virginia Vassilevska Williams , Bibsource =. Fixing a Tournament , Url =. Proceedings of the Twenty-Fourth. 2010 , Bdsk-Url-1 =
2010
-
[90]
Prophet Secretary for Combinatorial Auctions and Matroids , Url =
Soheil Ehsani and MohammadTaghi Hajiaghayi and Thomas Kesselheim and Sahil Singla , Bibsource =. Prophet Secretary for Combinatorial Auctions and Matroids , Url =. Proceedings of the Twenty-Ninth Annual. 2018 , Bdsk-Url-1 =. doi:10.1137/1.9781611975031.46 , Pages =
2018 doi
-
[91]
Goldberg and Jason D
Andrew V. Goldberg and Jason D. Hartline and Anna R. Karlin and Michael E. Saks and Andrew Wright , Bibsource =. Competitive auctions , Url =. 2006 , Bdsk-Url-1 =. doi:10.1016/j.geb.2006.02.003 , Journal =
2006 doi
-
[92]
Goldberg and Jason D
Andrew V. Goldberg and Jason D. Hartline and Anna R. Karlin and Michael E. Saks , Bibsource =. A Lower Bound on the Competitive Ratio of Truthful Auctions , Url =. 2004 , Bdsk-Url-1 =. doi:10.1007/978-3-540-24749-4\_56 , Editor =
2004 doi
-
[94]
Competitive Analysis via Benchmark Decomposition , Url =
Ning Chen and Nikolai Gravin and Pinyan Lu , Bibsource =. Competitive Analysis via Benchmark Decomposition , Url =. Proceedings of the Sixteenth. 2015 , Bdsk-Url-1 =. doi:10.1145/2764468.2764491 , Editor =
2015
-
[95]
Devanur and Jason D
Nikhil R. Devanur and Jason D. Hartline and Qiqi Yan , Bibsource =. Envy freedom and prior-free mechanism design , Url =. 2015 , Bdsk-Url-1 =. doi:10.1016/j.jet.2014.08.001 , Journal =
2015 doi
-
[96]
Goldberg and Jason D
Amos Fiat and Andrew V. Goldberg and Jason D. Hartline and Anna R. Karlin , Bibsource =. Competitive generalized auctions , Url =. Proceedings on 34th Annual. 2002 , Bdsk-Url-1 =. doi:10.1145/509907.509921 , Editor =
2002
-
[97]
Goldberg and Jason D
Andrew V. Goldberg and Jason D. Hartline and Andrew Wright , Bibsource =. Competitive auctions and digital goods , Url =. Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC,. 2001 , Bdsk-Url-1 =
2001
-
[98]
A New Solution to the Random Assignment Problem , Url =
Anna Bogomolnaia and Herv. A New Solution to the Random Assignment Problem , Url =. 2001 , Bdsk-Url-1 =. doi:10.1006/jeth.2000.2710 , Journal =
2001
-
[99]
Online Contention Resolution Schemes , Url =
Moran Feldman and Ola Svensson and Rico Zenklusen , Bibsource =. Online Contention Resolution Schemes , Url =. Proceedings of the Twenty-Seventh Annual. 2016 , Bdsk-Url-1 =. doi:10.1137/1.9781611974331.ch72 , Pages =
2016 doi
-
[100]
Random Order Contention Resolution Schemes , Url =
Marek Adamczyk and Michal Wlodarczyk , Bibsource =. Random Order Contention Resolution Schemes , Url =. 59th. 2018 , Bdsk-Url-1 =. doi:10.1109/FOCS.2018.00080 , Pages =
2018
-
[101]
Benjamin Miller and Yifeng Teng , Bibsource =
Shuchi Chawla and J. Benjamin Miller and Yifeng Teng , Bibsource =. Pricing for Online Resource Allocation: Intervals and Paths , Url =. Proceedings of the Thirtieth Annual. 2019 , Bdsk-Url-1 =. doi:10.1137/1.9781611975482.119 , Pages =
2019 doi
-
[103]
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods , Url =
Oliver G. Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods , Url =. Automata, Languages, and Programming - 41st International Colloquium,. 2014 , Bdsk-Url-1 =. doi:10.1007/978-3-662-43951-7\_43 , Pages =
2014 doi
-
[104]
Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs , Url =
Paul Duetting and Michal Feldman and Thomas Kesselheim and Brendan Lucier , Bibsource =. Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs , Url =. 58th. 2017 , Bdsk-Url-1 =. doi:10.1109/FOCS.2017.56 , Pages =
2017 doi
-
[105]
Kertz , Journal =
Robert P. Kertz , Journal =. Stop rule and supremum expectations of i.i.d. random variables: a complete comparison by conjugate duality , Volume =
-
[106]
Hill and Robert P
Theodore P. Hill and Robert P. Kertz , Journal =. Comparisons of stop rule and supremum expectations of i.i.d. random variables , Volume =
-
[107]
Spielman and Shang
Daniel A. Spielman and Shang. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time , Url =. 2004 , Bdsk-Url-1 =. doi:10.1145/990308.990310 , Journal =
2004
-
[109]
Prophet Secretary , Url =
Hossein Esfandiari and MohammadTaghi Hajiaghayi and Vahid Liaghat and Morteza Monemizadeh , Bibsource =. Prophet Secretary , Url =. Algorithms -. 2015 , Bdsk-Url-1 =. doi:10.1007/978-3-662-48350-3\_42 , Pages =
2015 doi
-
[112]
Prophet Secretary Through Blind Strategies , Url =
Jos. Prophet Secretary Through Blind Strategies , Url =. Proceedings of the Thirtieth Annual. 2019 , Bdsk-Url-1 =. doi:10.1137/1.9781611975482.118 , Pages =
2019 doi
-
[117]
Combinatorial Prophet Inequalities , Url =
Aviad Rubinstein and Sahil Singla , Bibsource =. Combinatorial Prophet Inequalities , Url =. Proceedings of the Twenty-Eighth Annual. 2017 , Bdsk-Url-1 =. doi:10.1137/1.9781611974782.110 , Pages =
2017 doi
-
[118]
Hartline and Brendan Lucier , Bibsource =
Jason D. Hartline and Brendan Lucier , Bibsource =. Bayesian algorithmic mechanism design , Url =. Proceedings of the 42nd. 2010 , Bdsk-Url-1 =. doi:10.1145/1806689.1806732 , Pages =
2010
-
[120]
On Semiamarts, amarts, and processes with finite value , Volume =
Ulrich Krengel and Louis Sucheston , Journal =. On Semiamarts, amarts, and processes with finite value , Volume =
-
[121]
Speed is as powerful as clairvoyance , Url =
Bala Kalyanasundaram and Kirk Pruhs , Bibsource =. Speed is as powerful as clairvoyance , Url =. 2000 , Bdsk-Url-1 =. doi:10.1145/347476.347479 , Journal =
2000
-
[122]
How bad is selfish routing? , Url =
Tim Roughgarden and. How bad is selfish routing? , Url =. 2002 , Bdsk-Url-1 =. doi:10.1145/506147.506153 , Journal =
2002
-
[123]
Joseph S. B. Mitchell , Bibsource =. Guillotine Subdivisions Approximate Polygonal Subdivisions:. 1999 , Bdsk-Url-1 =. doi:10.1137/S0097539796309764 , Journal =
1999 doi
-
[124]
Amortized Efficiency of List Update and Paging Rules , Url =
Daniel Dominic Sleator and Robert Endre Tarjan , Bibsource =. Amortized Efficiency of List Update and Paging Rules , Url =. 1985 , Bdsk-Url-1 =. doi:10.1145/2786.2793 , Journal =
1985
-
[125]
Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems , Url =
Sanjeev Arora , Bibsource =. Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems , Url =. 1998 , Bdsk-Url-1 =. doi:10.1145/290179.290180 , Journal =
1998
-
[126]
Lueker , Bibsource =
Wenceslas Fernandez de la Vega and George S. Lueker , Bibsource =. Bin packing can be solved within 1+epsilon in linear time , Url =. 1981 , Bdsk-Url-1 =. doi:10.1007/BF02579456 , Journal =
1981 doi
-
[127]
Smoothed analysis: an attempt to explain the behavior of algorithms in practice , Volume =
Spielman, Daniel A and Teng, Shang-Hua , Journal =. Smoothed analysis: an attempt to explain the behavior of algorithms in practice , Volume =
-
[128]
Ibarra and Chul E
Oscar H. Ibarra and Chul E. Kim , Bibsource =. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , Url =. 1975 , Bdsk-Url-1 =. doi:10.1145/321906.321909 , Journal =
1975
-
[129]
and Stein, Clifford , Booktitle =
Kolliopoulos, Stavros G. and Stein, Clifford , Booktitle =. Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs , Url =. 1998 , Bdsk-Url-1 =. doi:10.1007/3-540-69346-7_12 , Editor =
1998 doi
-
[130]
the 37th Annual ACM Symposium on Theory of Computing (STOC) , Title =
Patrick Briest and Piotr Krysta and Berthold V. the 37th Annual ACM Symposium on Theory of Computing (STOC) , Title =
-
[131]
Settling the Complexity of computing approximate two-player Nash Equillibria , Year =
Aviad Rubinstein , Booktitle =. Settling the Complexity of computing approximate two-player Nash Equillibria , Year =
-
[132]
On taxation and incentives: further remarks on the limits to redistribution , Year =
Roger Guesnerie , Publisher =. On taxation and incentives: further remarks on the limits to redistribution , Year =
-
[133]
Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs , Url =
Raghavan, Prabhakar , Doi =. Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs , Url =. J. Comput. Syst. Sci. , Month = oct, Number =. 1988 , Bdsk-Url-1 =
1988
-
[134]
Mechanisms for Multi-Unit Auctions , Year =
Shahar Dobzinski and Noam Nisan , Booktitle =. Mechanisms for Multi-Unit Auctions , Year =
-
[135]
Shahar Dobzinski and Jan Vondrak , Booktitle =
-
[136]
Mirrokni and Michael Schapira and Jan Vondr
Vahab S. Mirrokni and Michael Schapira and Jan Vondr. Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions , Url =. Proceedings 9th. 2008 , Bdsk-Url-1 =. doi:10.1145/1386790.1386805 , Pages =
2008
-
[137]
The allocation problem with submodular utility functions , Year =
Uriel Feige and Jan Vondrak , Booktitle =. The allocation problem with submodular utility functions , Year =
-
[138]
The Submodular Welfare Problem with Demand Queries , Url =
Uriel Feige and Jan Vondr. The Submodular Welfare Problem with Demand Queries , Url =. 2010 , Bdsk-Url-1 =. doi:10.4086/toc.2010.v006a011 , Journal =
2010 doi
-
[139]
Some Complexity Questions Related to Distributive Computing(Preliminary Report) , Url =
Yao, Andrew Chi-Chih , Booktitle =. Some Complexity Questions Related to Distributive Computing(Preliminary Report) , Url =. 1979 , Bdsk-Url-1 =. doi:10.1145/800135.804414 , Location =
1979
-
[140]
Rounds in Communication Complexity Revisited , Url =
Nisan, Noam and Wigderson, Avi , Doi =. Rounds in Communication Complexity Revisited , Url =. SIAM J. Comput. , Keywords =. 1993 , Bdsk-Url-1 =
1993
-
[141]
and Sipser, Michael , Booktitle =
Papadimitriou, Christos H. and Sipser, Michael , Booktitle =. Communication Complexity , Url =. 1982 , Bdsk-Url-1 =. doi:10.1145/800070.802192 , Isbn =
1982
-
[142]
Lower Bounds on Communication Complexity , Url =
Duris, Pavol and Galil, Zvi and Schnitger, Georg , Booktitle =. Lower Bounds on Communication Complexity , Url =. 1984 , Bdsk-Url-1 =. doi:10.1145/800057.808668 , Isbn =
1984
-
[143]
Economic Efficiency Requires Interaction , Year =
Shahar Dobzinski and Noam Nisan and Sigal Oren , Booktitle =. Economic Efficiency Requires Interaction , Year =
-
[144]
Communication Complexity of Simultaneous Messages , Url =
L. Communication Complexity of Simultaneous Messages , Url =. 2003 , Bdsk-Url-1 =. doi:10.1137/S0097539700375944 , Journal =
2003 doi
-
[146]
An Improved Approximation Algorithm for Combinatorial Auctions with Submodular Bidders , Url =
Dobzinski, Shahar and Schapira, Michael , Booktitle =. An Improved Approximation Algorithm for Combinatorial Auctions with Submodular Bidders , Url =. 2006 , Bdsk-Url-1 =
2006
-
[147]
Two Randomized Mechanisms for Combinatorial Auctions , Year =
Dobzinski, Shahar , Booktitle =. Two Randomized Mechanisms for Combinatorial Auctions , Year =
-
[149]
Truthful randomized mechanisms for combinatorial auctions , Year =
Dobzinski, Shahar and Nisan, Noam and Schapira, Michael , Booktitle =. Truthful randomized mechanisms for combinatorial auctions , Year =
-
[150]
Automata, Languages, and Programming , Pages =
Krysta, Piotr and V. Automata, Languages, and Programming , Pages =
-
[151]
Proceedings of the 44th Symposium on Theory of Computing (STOC) , Title =
Shahar Dobzinski and Jan Vondr. Proceedings of the 44th Symposium on Theory of Computing (STOC) , Title =
-
[152]
Shaddin Dughmi and Jan Vondrak , Booktitle =
-
[153]
Optimal approximation for the submodular welfare problem in the value oracle model , Url =
Jan Vondr. Optimal approximation for the submodular welfare problem in the value oracle model , Url =. Proceedings of the 40th Annual. 2008 , Bdsk-Url-1 =. doi:10.1145/1374376.1374389 , Pages =
2008
-
[154]
Combinatorial Auctions with Decreasing Marginal Utilities , Year =
Benny Lehmann and Daniel Lehmann and Noam Nisan , Booktitle =. Combinatorial Auctions with Decreasing Marginal Utilities , Year =
-
[155]
Combinatorial Auctions via Posted Prices , Url =
Feldman, Michal and Gravin, Nick and Lucier, Brendan , Booktitle =. Combinatorial Auctions via Posted Prices , Url =. 2015 , Bdsk-Url-1 =
2015
-
[156]
Exponentially Improved Truthful Combinatorial Auctions with Submodular Bidders , Year =
Sepehr Assadi and Sahil Singla , Booktitle =. Exponentially Improved Truthful Combinatorial Auctions with Submodular Bidders , Year =
-
[157]
Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations , Url =
Shahar Dobzinski and Jan Vondr. Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations , Url =. 2016 , Bdsk-Url-1 =. doi:10.1145/2786754 , Journal =
2016 doi
-
[159]
Ron Holzman and Noa E. Kfir. Bundling equilibrium in combinatorial auctions , Url =. 2004 , Bdsk-Url-1 =. doi:10.1016/S0899-8256(03)00184-2 , Journal =
2004 doi
-
[160]
The communication requirements of efficient allocations and supporting prices , Url =
Noam Nisan and Ilya Segal , Bibsource =. The communication requirements of efficient allocations and supporting prices , Url =. 2006 , Bdsk-Url-1 =. doi:10.1016/j.jet.2004.10.007 , Journal =
2006 doi
-
[161]
Truth revelation in approximately efficient combinatorial auctions , Url =
Daniel Lehmann and Liadan O'Callaghan and Yoav Shoham , Bibsource =. Truth revelation in approximately efficient combinatorial auctions , Url =. 2002 , Bdsk-Url-1 =. doi:10.1145/585265.585266 , Journal =
2002
-
[162]
From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions , Year =
Shaddin Dughmi and Tim Roughgarden and Qiqi Yan , Booktitle =. From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions , Year =
-
[163]
Sampling and Representation Complexity of Revenue Maximization , Url =
Shaddin Dughmi and Li Han and Noam Nisan , Bibsource =. Sampling and Representation Complexity of Revenue Maximization , Url =. Web and Internet Economics - 10th International Conference,. 2014 , Bdsk-Url-1 =. doi:10.1007/978-3-319-13129-0_22 , Pages =
2014 doi
-
[164]
Rounds in Communication Complexity Revisited , Url =
Noam Nisan and Avi Wigderson , Bibsource =. Rounds in Communication Complexity Revisited , Url =. 1993 , Bdsk-Url-1 =. doi:10.1137/0222016 , Journal =
1993 doi
-
[165]
Settling the complexity of computing two-player Nash equilibria , Url =
Xi Chen and Xiaotie Deng and Shang. Settling the complexity of computing two-player Nash equilibria , Url =. 2009 , Bdsk-Url-1 =. doi:10.1145/1516512.1516516 , Journal =
2009
-
[166]
Goldberg and Christos H
Constantinos Daskalakis and Paul W. Goldberg and Christos H. Papadimitriou , Bibsource =. The Complexity of Computing a Nash Equilibrium , Url =. 2009 , Bdsk-Url-1 =. doi:10.1137/070699652 , Journal =
2009 doi
-
[168]
Stubborn mining: Generalizing selfish mining and combining with an eclipse attack , Year =
Nayak, Kartik and Kumar, Srijan and Miller, Andrew and Shi, Elaine , Institution =. Stubborn mining: Generalizing selfish mining and combining with an eclipse attack , Year =
-
[169]
Nakamoto, Satoshi , Title =
-
[170]
Garay and Aggelos Kiayias and Nikos Leonardos , Bibsource =
Juan A. Garay and Aggelos Kiayias and Nikos Leonardos , Bibsource =. The Bitcoin Backbone Protocol: Analysis and Applications , Url =. Advances in Cryptology -. 2015 , Bdsk-Url-1 =. doi:10.1007/978-3-662-46803-6_10 , Pages =
2015 doi
-
[171]
Courtois and Lear Bahack , Bibsource =
Nicolas T. Courtois and Lear Bahack , Bibsource =. On Subversive Miner Strategies and Block Withholding Attack in Bitcoin Digital Currency , Url =. CoRR , Timestamp =. 2014 , Bdsk-Url-1 =
2014
-
[172]
Economics and Computer Science of a Radio Spectrum Reallocation , Url =
Kevin Leyton. Economics and Computer Science of a Radio Spectrum Reallocation , Url =. Proceedings of the National Academy of Sciences (PNAS) , Number =. 2017 , Bdsk-Url-1 =
2017
-
[173]
Hartline , Bibsource =
Yiding Feng and Jason D. Hartline , Bibsource =. An End-to-End Argument in Mechanism Design (Prior-Independent Auctions for Budgeted Agents) , Url =. 59th. 2018 , Bdsk-Url-1 =. doi:10.1109/FOCS.2018.00046 , Pages =
2018
-
[174]
A Compact Representation for Permutation Groups , Url =
Mark Jerrum , Bibsource =. A Compact Representation for Permutation Groups , Url =. 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982 , Crossrefignore =. 1982 , Bdsk-Url-1 =. doi:10.1109/SFCS.1982.52 , Pages =
1982 doi
-
[176]
Price of Anarchy for Greedy Auctions , Url =
Brendan Lucier and Allan Borodin , Bibsource =. Price of Anarchy for Greedy Auctions , Url =. Proceedings of the Twenty-First Annual. 2010 , Bdsk-Url-1 =. doi:10.1137/1.9781611973075.46 , Pages =
2010 doi
-
[177]
Designing and learning optimal finite support auctions , Url =
Edith Elkind , Bibsource =. Designing and learning optimal finite support auctions , Url =. Proceedings of the Eighteenth Annual. 2007 , Bdsk-Url-1 =
2007
-
[178]
Comparison of threshold stop rules and maximum for independent nonnegative random variables , Volume =
Ester Samuel. Comparison of threshold stop rules and maximum for independent nonnegative random variables , Volume =. Annals of Probability , Number =
-
[179]
Making the Most of Your Samples , Url =
Zhiyi Huang and Yishay Mansour and Tim Roughgarden , Bibsource =. Making the Most of Your Samples , Url =. 2018 , Bdsk-Url-1 =. doi:10.1137/16M1065719 , Journal =
2018 doi
-
[180]
A General Theory of Sample Complexity for Multi-Item Profit Maximization , Url =
Maria. A General Theory of Sample Complexity for Multi-Item Profit Maximization , Url =. Proceedings of the 2018. 2018 , Bdsk-Url-1 =. doi:10.1145/3219166.3219217 , Pages =
2018
-
[181]
Settling the sample complexity of single-parameter revenue maximization , Url =
Chenghao Guo and Zhiyi Huang and Xinzhi Zhang , Bibsource =. Settling the sample complexity of single-parameter revenue maximization , Url =. Proceedings of the 51st Annual. 2019 , Bdsk-Url-1 =. doi:10.1145/3313276.3316325 , Pages =
2019
-
[182]
Barriers to Near-Optimal Equilibria , Url =
Tim Roughgarden , Bibsource =. Barriers to Near-Optimal Equilibria , Url =. 55th. 2014 , Bdsk-Url-1 =. doi:10.1109/FOCS.2014.16 , Pages =
2014 doi
-
[183]
Econometrica , Number =
A simple adaptive procedure leading to correlated equilibrium , Volume =. Econometrica , Number =
-
[184]
From External to Internal Regret , Url =
Avrim Blum and Yishay Mansour , Bibsource =. From External to Internal Regret , Url =. Journal of Machine Learning Research , Pages =. 2007 , Bdsk-Url-1 =
2007
-
[185]
Game Efficiency Through Linear Programming Duality , Url =
Nguyen Kim Thang , Bibsource =. Game Efficiency Through Linear Programming Duality , Url =. 10th Innovations in Theoretical Computer Science Conference,. 2019 , Bdsk-Url-1 =. doi:10.4230/LIPIcs.ITCS.2019.66 , Pages =
2019 doi
-
[186]
Games and Economic Behavior , Number =
Calibrated Learning and Correlated Equilibrium , Volume =. Games and Economic Behavior , Number =
-
[187]
Warmuth , Bibsource =
Nick Littlestone and Manfred K. Warmuth , Bibsource =. The Weighted Majority Algorithm , Url =. 1994 , Bdsk-Url-1 =. doi:10.1006/inco.1994.1009 , Journal =
1994
-
[188]
Schapire , Bibsource =
Yoav Freund and Robert E. Schapire , Bibsource =. A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting , Url =. 1997 , Bdsk-Url-1 =. doi:10.1006/jcss.1997.1504 , Journal =
1997
-
[189]
Analysis of Bitcoin Pooled Mining Reward Systems , Url =
Meni Rosenfeld , Bibsource =. Analysis of Bitcoin Pooled Mining Reward Systems , Url =. CoRR , Timestamp =. 2011 , Bdsk-Url-1 =
2011
-
[190]
Trends, Tips, Tolls:
Malte M. Trends, Tips, Tolls:. Workshop on Bitcoin Research , Crossrefignore =. 2015 , Bdsk-Url-1 =. doi:10.1007/978-3-662-48051-9_2 , Pages =
2015 doi
-
[191]
Bitcoin is not Broken , Year =
Kashmir Hill , Howpublished =. Bitcoin is not Broken , Year =
-
[192]
Majority is not enough: Bitcoin mining is vulnerable , Year =
Eyal, Ittay and Sirer, Emin G. Majority is not enough: Bitcoin mining is vulnerable , Year =. Financial Cryptography and Data Security , Pages =
-
[193]
Bitcoin and the age of bespoke silicon , Year =
Taylor, Michael Bedford , Booktitle =. Bitcoin and the age of bespoke silicon , Year =
-
[194]
Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack , Year =
Kartik Nayak and Srijan Kumar and Andrew Miller and Elaine Shi , Booktitle =. Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack , Year =
-
[195]
Kroll and Ian C
Joshua A. Kroll and Ian C. Davey and Edward W. Felten , Booktitle =. The Economics of Bitcoin Mining, or Bitcoin in the Presence of Adversaries , Year =
-
[196]
Game-theoretic Analysis of DDoS attacks against Bitcoin Mining pools , Year =
Benjamin Johnson and Aron Laszka and Jens Grossklags and Mari Vasek and Tyler Moore , Booktitle =. Game-theoretic Analysis of DDoS attacks against Bitcoin Mining pools , Year =
-
[197]
Empirical Analysis of denial-of-service attacks in the Bitcoin ecosystem , Year =
Marie Vasek and Micha Thornton and Tyler Moore , Booktitle =. Empirical Analysis of denial-of-service attacks in the Bitcoin ecosystem , Year =
-
[198]
Demystifying Incentives in the Consensus Computer , Year =
Loi Luu and Jason Teutsch and Raghav Kulkarni and Prateek Saxena , Booktitle =. Demystifying Incentives in the Consensus Computer , Year =
-
[199]
Information propagation in the bitcoin network , Year =
Decker, Christian and Wattenhofer, Roger , Booktitle =. Information propagation in the bitcoin network , Year =
-
[200]
Karame and Marc Roeschlin and Tobias Scherer and Srdjan Capkun , Booktitle =
Elli Androulaki and Ghassan O. Karame and Marc Roeschlin and Tobias Scherer and Srdjan Capkun , Booktitle =. Evaluating User Privacy in Bitcoin , Year =
-
[201]
The Economics of Bitcoin Transaction Fees , Year =
Nicolas Houy , Journal =. The Economics of Bitcoin Transaction Fees , Year =
-
[202]
Shadow-bitcoin: scalable simulation via direct execution of multithreaded applications , Year =
Andrew Miller and Rob Jansen , Booktitle =. Shadow-bitcoin: scalable simulation via direct execution of multithreaded applications , Year =
-
[203]
Mind the Gap: Security Implications of the Evolution of Bitcoin Mining , Year =
Miles Carlsten and Harry Kalodner and Arvind Naryanan , Journal =. Mind the Gap: Security Implications of the Evolution of Bitcoin Mining , Year =
-
[204]
Kroll and Edward W
Andrew Miller and Jeremy Clark and Arvind Narayanan and Joshua A. Kroll and Edward W. Felten , Booktitle =. SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies. , Year =
-
[205]
A Simple and Approximately Optimal Mechanism for a Buyer with Complements , Year =
Alon Eden and Michal Feldman and Ophir Friedler and Inbal Talgam. A Simple and Approximately Optimal Mechanism for a Buyer with Complements , Year =. Proceedings of the 18th ACM Conference on Economics and Computation (EC) , Pages =
-
[206]
The Competition Complexity of Auctions: A
Alon Eden and Michal Feldman and Ophir Friedler and Inbal Talgam. The Competition Complexity of Auctions: A. Proceedings of the 18th ACM Conference on Economics and Computation (EC) , Pages =
-
[208]
Matthew Weinberg , Bibsource =
Mark Braverman and Jieming Mao and S. Matthew Weinberg , Bibsource =. On Simultaneous Two-player Combinatorial Auctions , Url =. Proceedings of the Twenty-Ninth Annual. 2018 , Bdsk-Url-1 =. doi:10.1137/1.9781611975031.146 , Pages =
2018 doi
-
[209]
Saxena and Ariel Schvartzman and S
Raghuvansh R. Saxena and Ariel Schvartzman and S. Matthew Weinberg , Bibsource =. The menu complexity of ``one-and-a-half-dimensional'' mechanism design , Year =. Proceedings of the 29th Annual
-
[210]
Gonczarowski and Noam Nisan , Booktitle =
Moshe Babaioff and Yannai A. Gonczarowski and Noam Nisan , Booktitle =. The menu-size complexity of revenue approximation , Year =
-
[211]
Matthew Weinberg , Bibsource =
Aviad Rubinstein and Tselil Schramm and S. Matthew Weinberg , Bibsource =. Computing Exact Minimum Cuts Without Knowing the Graph , Url =. 9th Innovations in Theoretical Computer Science Conference,. 2018 , Bdsk-Url-1 =. doi:10.4230/LIPIcs.ITCS.2018.39 , Pages =
2018 doi
-
[213]
Ouroboros:
Aggelos Kiayias and Alexander Russell and Bernardo David and Roman Oliynykov , Bibsource =. Ouroboros:. Advances in Cryptology -. 2017 , Bdsk-Url-1 =. doi:10.1007/978-3-319-63688-7\_12 , Pages =
2017 doi
-
[214]
Saxena and S
Sepehr Assadi and Hrishikesh Khandeparkar and Raghuvansh R. Saxena and S. Matthew Weinberg , editor =. Separating the communication complexity of truthful and non-truthful combinatorial auctions , booktitle =. 2020 , url =. doi:10.1145/3357713.3384267 , timestamp =
2020
-
[216]
Communication Complexity of Combinatorial Auctions with Submodular Valuations , booktitle =
Shahar Dobzinski and Jan Vondr. Communication Complexity of Combinatorial Auctions with Submodular Valuations , booktitle =. 2013 , url =. doi:10.1137/1.9781611973105.87 , timestamp =
2013 doi
-
[217]
Matthew Weinberg , Bibsource =
Mark Braverman and Jieming Mao and S. Matthew Weinberg , Bibsource =. Parallel algorithms for select and partition with noisy comparisons , Url =. Proceedings of the 48th Annual. 2016 , Bdsk-Url-1 =. doi:10.1145/2897518.2897642 , Pages =
2016
-
[218]
Matthew Weinberg , Bibsource =
Mark Braverman and Jieming Mao and S. Matthew Weinberg , Bibsource =. Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial Auctions , Url =. Proceedings of the Twenty-Seventh Annual. 2016 , Bdsk-Url-1 =. doi:10.1137/1.9781611974331.ch99 , Pages =
2016 doi
-
[219]
Kalodner and S
Miles Carlsten and Harry A. Kalodner and S. Matthew Weinberg and Arvind Narayanan , Bibsource =. On the Instability of Bitcoin Without the Block Reward , Url =. Proceedings of the 2016. 2016 , Bdsk-Url-1 =. doi:10.1145/2976749.2978408 , Pages =
2016
-
[220]
The Multiplicative Weights Update Method: a Meta-Algorithm and Applications
Arora, Sanjeev and Hazan, Elad and Kale, Satyen , Journal =. The Multiplicative Weights Update Method: a Meta-Algorithm and Applications. , Volume =
-
[221]
Computational Efficiency Requires Simple Taxation , Year =
Dobzinski, Shahar , Booktitle =. Computational Efficiency Requires Simple Taxation , Year =
-
[222]
Inapproximability of Truthful Mechanisms via Generalizations of the
Amit Daniely and Michael Schapira and Gal Shahaf , Bibsource =. Inapproximability of Truthful Mechanisms via Generalizations of the. Proceedings of the Forty-Seventh Annual. 2015 , Bdsk-Url-1 =. doi:10.1145/2746539.2746597 , Pages =
2015
-
[223]
Truthful and Near-Optimal Mechanism Design via Linear Programming , Year =
Ron Lavi and Chaitanya Swamy , Booktitle =. Truthful and Near-Optimal Mechanism Design via Linear Programming , Year =
-
[224]
Intrinsic Robustness of the Price of Anarchy , Url =
Tim Roughgarden , Bibsource =. Intrinsic Robustness of the Price of Anarchy , Url =. 2015 , Bdsk-Url-1 =. doi:10.1145/2806883 , Journal =
2015 doi
-
[225]
Intrinsic robustness of the price of anarchy , Url =
Tim Roughgarden , Bibsource =. Intrinsic robustness of the price of anarchy , Url =. Proceedings of the 41st Annual. 2009 , Bdsk-Url-1 =. doi:10.1145/1536414.1536485 , Pages =
2009
-
[226]
Auctions Versus Negotiations , Year =
Bulow, Jeremy and Klemperer, Paul , Date-Added =. Auctions Versus Negotiations , Year =. The American Economic Review , Pages =
-
[227]
Non-Optimal Mechanism Design , Year =
Jason Hartline and Brendan Lucier , Journal =. Non-Optimal Mechanism Design , Year =
-
[228]
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms , Url =
Xi Chen and Ilias Diakonikolas and Anthi Orfanou and Dimitris Paparas and Xiaorui Sun and Mihalis Yannakakis , Bibsource =. On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms , Url =. 2015 , Bdsk-Url-1 =. doi:10.1109/FOCS.2015.93 , Pages =
2015 doi
-
[229]
Irving , Publisher =
Dan Gusfield and Robert W. Irving , Publisher =. The stable marriage problem: structure and algorithms , Year =
-
[230]
Matthew Weinberg , Bibsource =
Yang Cai and Constantinos Daskalakis and S. Matthew Weinberg , Bibsource =. Reducing Bayesian Mechanism Design to Algorithm Design , Url =. Encyclopedia of Algorithms , Doi =. 2016 , Bdsk-Url-1 =
2016
-
[231]
Matthew Weinberg , Bibsource =
Yang Cai and Constantinos Daskalakis and S. Matthew Weinberg , Bibsource =. On optimal multidimensional mechanism design , Url =. 2011 , Bdsk-Url-1 =. doi:10.1145/1998549.1998555 , Journal =
2011
-
[232]
Matthew Weinberg , Bibsource =
Moshe Babaioff and Nicole Immorlica and Brendan Lucier and S. Matthew Weinberg , Bibsource =. A simple and approximately optimal mechanism for an additive buyer , Url =. 2014 , Bdsk-Url-1 =. doi:10.1145/2728732.2728736 , Journal =
2014
-
[233]
Matthew Weinberg , Bibsource =
Michal Feldman and Nicole Immorlica and Brendan Lucier and S. Matthew Weinberg , Bibsource =. Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks , Url =. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques,. 2014 , ...
2014 doi
-
[234]
Matthew Weinberg , Journal =
Yang Cai and Nikhil Devanur and S. Matthew Weinberg , Journal =. A Duality Based Unified Approach to Bayesian Mechanism Design , Year =
-
[235]
Communication Complexity of Cake Cutting , Url =
Simina Br. Communication Complexity of Cake Cutting , Url =. Proceedings of the 2019. 2019 , Bdsk-Url-1 =. doi:10.1145/3328526.3329644 , Pages =
2019
-
[236]
Communication Complexity of Discrete Fair Division , Url =
Benjamin Plaut and Tim Roughgarden , Bibsource =. Communication Complexity of Discrete Fair Division , Url =. Proceedings of the Thirtieth Annual. 2019 , Bdsk-Url-1 =. doi:10.1137/1.9781611975482.122 , Pages =
2019 doi
-
[238]
On-Demand or Spot? Selling the Cloud to Risk-Averse Customers , Year =
Darrell Hoy and Nicole Immorlica and Brendan Lucier , Journal =. On-Demand or Spot? Selling the Cloud to Risk-Averse Customers , Year =
-
[239]
Graur and Tristan Pollner and Vidhya Ramaswamy and S
Andrei A. Graur and Tristan Pollner and Vidhya Ramaswamy and S. Matthew Weinberg , Journal =. New Query Lower Bounds for Submodular Function Minimization , Year =
-
[240]
2021 , note =
A theory of simplicity in games and mechanism design , author=. 2021 , note =
2021
-
[241]
International Economic Review , volume=
Obviously Strategy-Proof Implementation Of Top Trading Cycles , author=. International Economic Review , volume=. 2019 , publisher=
2019
-
[242]
Obvious manipulations , Volume =
Troyan, Peter and Morrill, Thayer , Journal =. Obvious manipulations , Volume =
-
[243]
Risk, Ambiguity, and the Savage Axioms , Volume =
Daniel Ellsberg , Journal =. Risk, Ambiguity, and the Savage Axioms , Volume =
-
[244]
Le Comportement de l'Homme Rationnel devant le Risque: Critique des Postulats et Axiomes de l'Ecole Americaine , Volume =
Maurice Allais , Journal =. Le Comportement de l'Homme Rationnel devant le Risque: Critique des Postulats et Axiomes de l'Ecole Americaine , Volume =
-
[245]
Sampling and Representation Complexity of Revenue Maximization , Url =
Shaddin Dughmi and Li Han and Noam Nisan , Bibsource =. Sampling and Representation Complexity of Revenue Maximization , Url =. Web and Internet Economics - 10th International Conference,. 2014 , Bdsk-Url-1 =. doi:10.1007/978-3-319-13129-0\_22 , Pages =
2014 doi
-
[247]
Benjamin Miller and Emmanouil Pountourakis , Bibsource =
Shuchi Chawla and Kira Goldner and J. Benjamin Miller and Emmanouil Pountourakis , Bibsource =. Revenue Maximization with an Uncertainty-Averse Buyer , Url =. Proceedings of the Twenty-Ninth Annual. 2018 , Bdsk-Url-1 =. doi:10.1137/1.9781611975031.134 , Pages =
2018 doi
-
[248]
Matthew Weinberg , Journal =
Nikhil Devanur and Kira Goldner and Raghuvansh Saxena and Ariel Schvartzman and S. Matthew Weinberg , Journal =. Selling Partially-Ordered Items: Exploring the space between single- and multi-dimensional mechanism design , Year =
-
[249]
Reaping the Benefits of Bundling under High Production Costs , Year =
Will Ma and David Simchi-Levi , Journal =. Reaping the Benefits of Bundling under High Production Costs , Year =
-
[250]
Matthew Weinberg , Booktitle =
Meryem Essaidi and Kira Goldner and S. Matthew Weinberg , Booktitle =. When to Limit Entry under Mandatory Purchase , Year =
-
[251]
The Miner's Dilemma , Url =
Ittay Eyal , Bibsource =. The Miner's Dilemma , Url =. 2015. 2015 , Bdsk-Url-1 =. doi:10.1109/SP.2015.13 , Pages =
2015 doi
-
[252]
On Maximizing Welfare When Utility Functions Are Subadditive , Url =
Uriel Feige , Bibsource =. On Maximizing Welfare When Utility Functions Are Subadditive , Url =. 2009 , Bdsk-Url-1 =. doi:10.1137/070680977 , Journal =
2009 doi
-
[253]
On maximizing welfare when utility functions are subadditive , Url =
Uriel Feige , Bibsource =. On maximizing welfare when utility functions are subadditive , Url =. Proceedings of the 38th Annual. 2006 , Bdsk-Url-1 =. doi:10.1145/1132516.1132523 , Pages =
2006
-
[254]
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders , Url =
Shahar Dobzinski and Noam Nisan and Michael Schapira , Bibsource =. Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders , Url =. 2010 , Bdsk-Url-1 =. doi:10.1287/moor.1090.0436 , Journal =
2010
-
[255]
Approximation algorithms for combinatorial auctions with complement-free bidders , Url =
Shahar Dobzinski and Noam Nisan and Michael Schapira , Bibsource =. Approximation algorithms for combinatorial auctions with complement-free bidders , Url =. Proceedings of the 37th Annual. 2005 , Bdsk-Url-1 =. doi:10.1145/1060590.1060681 , Pages =
2005
-
[256]
Composable and efficient mechanisms , Url =
Vasilis Syrgkanis and. Composable and efficient mechanisms , Url =. Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013 , Crossrefignore =. 2013 , Bdsk-Url-1 =. doi:10.1145/2488608.2488635 , Pages =
2013
-
[257]
Gonczarowski and Yishay Mansour and Shay Moran , Bibsource =
Moshe Babaioff and Yannai A. Gonczarowski and Yishay Mansour and Shay Moran , Bibsource =. Are Two (Samples) Really Better Than One? , Url =. Proceedings of the 2018. 2018 , Bdsk-Url-1 =. doi:10.1145/3219166.3219187 , Pages =
2018
-
[258]
Ironing in the Dark , Url =
Tim Roughgarden and Okke Schrijvers , Bibsource =. Ironing in the Dark , Url =. Proceedings of the 2016. 2016 , Bdsk-Url-1 =. doi:10.1145/2940716.2940723 , Pages =
2016
-
[259]
Incentive Compatibility of Bitcoin Mining Pool Reward Functions , Url =
Okke Schrijvers and Joseph Bonneau and Dan Boneh and Tim Roughgarden , Bibsource =. Incentive Compatibility of Bitcoin Mining Pool Reward Functions , Url =. Financial Cryptography and Data Security - 20th International Conference,. 2016 , Bdsk-Url-1 =. doi:10.1007/978-3-662-54...
2016 doi
-
[260]
Hartline and Darrell Hoy and Sam Taggart , Bibsource =
Jason D. Hartline and Darrell Hoy and Sam Taggart , Bibsource =. Price of anarchy for auction revenue , Url =. 2014 , Bdsk-Url-1 =. doi:10.1145/2600057.2602878 , Pages =
2014
-
[261]
2016 , Bdsk-Url-1 =
Non-Revelation Mechanism Design , Url =. 2016 , Bdsk-Url-1 =. arXiv , Author =:1608.01875 , Journal =
2016 arXiv
-
[262]
A scalable verification solution for blockchains , Url =
Jason Teutsch and Christian Reitwie. A scalable verification solution for blockchains , Url =. https://truebit.io/ , Month =. 2017 , Bdsk-Url-1 =
2017
-
[263]
WPRB Princeton: These Vibes are too Cosmic, Interview with Matt Weinberg , Year =
Stevie Bergman , Note =. WPRB Princeton: These Vibes are too Cosmic, Interview with Matt Weinberg , Year =
-
[264]
Blockstack Token Whitepaper , Year =
Ryan Shea and Muneeb Ali , Note =. Blockstack Token Whitepaper , Year =
-
[265]
Matthew Weinberg , Note =
Nicole Immorlica and Ruta Mehta and S. Matthew Weinberg , Note =. AGT Mentoring Workshop at EC , Year =
-
[266]
Open Discussion on Job Market Advice for Graduate Students at EC , Year =
Kevin Leyton. Open Discussion on Job Market Advice for Graduate Students at EC , Year =
-
[267]
Matthew Weinberg , Note =
Yang Cai and Shuchi Chawla and S. Matthew Weinberg , Note =. Workshop on Connections Between Theory of Computation and Bayesian Mechanism Design , Year =
-
[268]
Matthew Weinberg , Note =
Yang Cai and Constantinos Daskalakis and S. Matthew Weinberg , Note =. Tutorial: Recent Progress in Multi-Dimensional Mechanism Design , Year =
-
[269]
Matthew Weinberg , Note =
Jacob Leshno and Arvind Narayanan and Georgios Piliouras and Christos-Alexandros Psomas and S. Matthew Weinberg , Note =. Tutorial: Emerging Research Directions Regarding Incentives and Cryptocurrencies , Year =
-
[270]
Matthew Weinberg , Note =
S. Matthew Weinberg , Note =. Tutorial: Prophet Inequalities , Year =
-
[271]
Matthew Weinberg , Note =
S. Matthew Weinberg , Note =. Tutorial: Secretary Problems , Year =
-
[272]
Matthew Weinberg , Note =
Ariel Procaccia and Daniela Saban and S. Matthew Weinberg , Note =. AGT Mentoring Workshop at EC , Year =
-
[273]
Algorand: Scaling Byzantine Agreements for Cryptocurrencies , Url =
Yossi Gilad and Rotem Hemo and Silvio Micali and Georgios Vlachos and Nickolai Zeldovich , Bibsource =. Algorand: Scaling Byzantine Agreements for Cryptocurrencies , Url =. Proceedings of the 26th Symposium on Operating Systems Principles, Shanghai, China, October 28-31, 2017 ...
2017
-
[274]
FruitChains:
Rafael Pass and Elaine Shi , Bibsource =. FruitChains:. Proceedings of the. 2017 , Bdsk-Url-1 =. doi:10.1145/3087801.3087809 , Pages =
2017
-
[275]
Demystifying Incentives in the Consensus Computer , Url =
Loi Luu and Jason Teutsch and Raghav Kulkarni and Prateek Saxena , Bibsource =. Demystifying Incentives in the Consensus Computer , Url =. Proceedings of the 22nd. 2015 , Bdsk-Url-1 =. doi:10.1145/2810103.2813659 , Pages =
2015
-
[276]
Repeated Sales with Multiple Strategic Buyers , Url =
Nicole Immorlica and Brendan Lucier and Emmanouil Pountourakis and Samuel Taggart , Bibsource =. Repeated Sales with Multiple Strategic Buyers , Url =. Proceedings of the 2017. 2017 , Bdsk-Url-1 =. doi:10.1145/3033274.3085130 , Pages =
2017
-
[277]
Devanur and Zhiyi Huang and Christos
Nikhil R. Devanur and Zhiyi Huang and Christos. The sample complexity of auctions with side information , Url =. Proceedings of the 48th Annual. 2016 , Bdsk-Url-1 =. doi:10.1145/2897518.2897553 , Pages =
2016
-
[278]
Papadimitriou and George Pierrakos and Christos
Christos H. Papadimitriou and George Pierrakos and Christos. On the Complexity of Dynamic Mechanism Design , Url =. Proceedings of the Twenty-Seventh Annual. 2016 , Bdsk-Url-1 =. doi:10.1137/1.9781611974331.ch100 , Pages =
2016 doi
-
[279]
The sample complexity of revenue maximization , Url =
Richard Cole and Tim Roughgarden , Bibsource =. The sample complexity of revenue maximization , Url =. Symposium on Theory of Computing,. 2014 , Bdsk-Url-1 =. doi:10.1145/2591796.2591867 , Pages =
2014
-
[280]
Revenue maximization with a single sample , Url =
Peerapong Dhangwatnotai and Tim Roughgarden and Qiqi Yan , Bibsource =. Revenue maximization with a single sample , Url =. 2015 , Bdsk-Url-1 =. doi:10.1016/j.geb.2014.03.011 , Journal =
2015 doi
-
[281]
On the Pseudo-Dimension of Nearly Optimal Auctions , Url =
Jamie Morgenstern and Tim Roughgarden , Bibsource =. On the Pseudo-Dimension of Nearly Optimal Auctions , Url =. Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, December 7-12, 2015, Montreal, Quebec, Canada...
2015
-
[282]
Learning Simple Auctions , Url =
Jamie Morgenstern and Tim Roughgarden , Bibsource =. Learning Simple Auctions , Url =. Proceedings of the 29th Conference on Learning Theory,. 2016 , Bdsk-Url-1 =
2016
-
[283]
Matthew Weinberg , Bibsource =
Mark Braverman and Jieming Mao and Jon Schneider and S. Matthew Weinberg , Bibsource =. Multi-armed Bandit Problems with Strategic Arms , Url =. Conference on Learning Theory,. 2019 , Bdsk-Url-1 =
2019
-
[284]
On the Computational Complexity of Optimal Simple Mechanisms , Url =
Aviad Rubinstein , Bibsource =. On the Computational Complexity of Optimal Simple Mechanisms , Url =. Proceedings of the 2016. 2016 , Bdsk-Url-1 =. doi:10.1145/2840728.2840736 , Pages =
2016
-
[285]
Extreme-Value Theorems for Optimal Multidimensional Pricing , Url =
Yang Cai and Constantinos Daskalakis , Bibsource =. Extreme-Value Theorems for Optimal Multidimensional Pricing , Url =. 2011 , Bdsk-Url-1 =. doi:10.1109/FOCS.2011.76 , Pages =
2011 doi
-
[286]
Extreme value theorems for optimal multidimensional pricing , Url =
Yang Cai and Constantinos Daskalakis , Bibsource =. Extreme value theorems for optimal multidimensional pricing , Url =. 2015 , Bdsk-Url-1 =. doi:10.1016/j.geb.2015.02.003 , Journal =
2015 doi
-
[287]
The Value of Information Concealment , Url =
Hu Fu and Christopher Liaw and Pinyan Lu and Zhihao Gavin Tang , Bibsource =. The Value of Information Concealment , Url =. Proceedings of the Twenty-Ninth Annual. 2018 , Bdsk-Url-1 =. doi:10.1137/1.9781611975031.162 , Pages =
2018 doi
-
[288]
Formal Barriers to Longest-Chain Proof-of-Stake Protocols , Url =
Jonah Brown. Formal Barriers to Longest-Chain Proof-of-Stake Protocols , Url =. Proceedings of the 2019. 2019 , Bdsk-Url-1 =. doi:10.1145/3328526.3329567 , Pages =
2019
-
[289]
Matthew Weinberg , Bibsource =
Nick Arnosti and S. Matthew Weinberg , Bibsource =. Bitcoin:. 10th Innovations in Theoretical Computer Science Conference,. 2019 , Bdsk-Url-1 =. doi:10.4230/LIPIcs.ITCS.2019.5 , Pages =
2019 doi
-
[290]
Matthew Weinberg and Danny Yuxing Huang and Nick Feamster and Tithi Chattopadhyay , Bibsource =
Matheus Xavier Ferreira and S. Matthew Weinberg and Danny Yuxing Huang and Nick Feamster and Tithi Chattopadhyay , Bibsource =. Selling a Single Item with Negative Externalities , Url =. The World Wide Web Conference,. 2019 , Bdsk-Url-1 =. doi:10.1145/3308558.3313692 , Pages =
2019
-
[291]
Communication complexity of approximate Nash equilibria , Url =
Yakov Babichenko and Aviad Rubinstein , Bibsource =. Communication complexity of approximate Nash equilibria , Url =. Proceedings of the 49th Annual. 2017 , Bdsk-Url-1 =. doi:10.1145/3055399.3055407 , Pages =
2017
-
[292]
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria , Url =
Mika G. Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria , Url =. 59th. 2018 , Bdsk-Url-1 =. doi:10.1109/FOCS.2018.00045 , Pages =
2018
-
[293]
Devanur and S
Constantinos Daskalakis and Nikhil R. Devanur and S. Matthew Weinberg , Bibsource =. Revenue Maximization and Ex-Post Budget Constraints , Url =. 2018 , Bdsk-Url-1 =. doi:10.1145/3274647 , Journal =
2018 doi
-
[294]
Matthew Weinberg , Bibsource =
Aviad Rubinstein and S. Matthew Weinberg , Bibsource =. Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity , Url =. Proceedings of the Sixteenth. 2015 , Bdsk-Url-1 =. doi:10.1145/2764468.2764510 , Pages =
2015
-
[295]
Matthew Weinberg , Bibsource =
Aviad Rubinstein and S. Matthew Weinberg , Bibsource =. Simple Mechanisms for a Subadditive Buyer and Applications to Revenue Monotonicity , Url =. 2018 , Bdsk-Url-1 =. doi:10.1145/3105448 , Journal =
2018 doi
-
[296]
Snow White: Provably Secure Proofs of Stake , Url =
Phil Daian and Rafael Pass and Elaine Shi , Bibsource =. Snow White: Provably Secure Proofs of Stake , Url =. 2016 , Bdsk-Url-1 =
2016
-
[297]
Kevin Poulsen , Note =
-
[298]
Dominant Resource Fairness: Fair Allocation of Multiple Resource Types , Url =
Ali Ghodsi and Matei Zaharia and Benjamin Hindman and Andy Konwinski and Scott Shenker and Ion Stoica , Bibsource =. Dominant Resource Fairness: Fair Allocation of Multiple Resource Types , Url =. Proceedings of the 8th. 2011 , Bdsk-Url-1 =
2011
-
[299]
Toma, Jeffrey T
Catalina L. Toma, Jeffrey T. Hancock, Nicole B. Ellison , Journal =. Separating Fact From Fiction: An Examination of Deceptive Self-Presentation in Online Dating Profiles , Year =
-
[300]
Evidence of Upcoding in Pay-for-Performance Programs , Year =
Hamsa Bastani and Joel Goh and Mohsen Bayati , Journal =. Evidence of Upcoding in Pay-for-Performance Programs , Year =
Reviewed August 15, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.