Entity usage

Showing below up to 50 results in range #1 to #50.

1. Fast convergence of optimistic gradient ascent in network zero-sum extensive form games: Label: en
2. Data curation from privacy-aware agents: Label: en
3. Coopetition against an Amazon: Label: en
4. Financial networks with singleton liability priorities: Label: en
5. Seniorities and minimal clearing in financial network games: Label: en
6. PPAD-complete pure approximate Nash equilibria in Lipschitz games: Label: en
7. Complexity of public goods games on graphs: Label: en
8. Simultaneous contests with equal sharing allocation of prizes: computational complexity and price of anarchy: Label: en
9. Explicitly simple near-tie auctions: Label: en
10. On improved interval cover mechanisms for crowdsourcing markets: Label: en
11. Budget feasible mechanisms for procurement auctions with divisible agents: Label: en
12. Lookahead auctions with pooling: Label: en
13. Greater flexibility in mechanism design through altruism: Label: en
14. How bad is the merger paradox?: Label: en
15. Decentralizing information technology: the advent of resource based systems: Label: en
16. Strategic voting in the context of stable-matching of teams: Label: en
17. Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas: Label: en
18. Online max-min fair allocation: Label: en
19. Gehrlein stable committee with multi-modal preferences: Label: en
20. Fairness in temporal slot assignment: Label: en
21. Justifying groups in multiwinner approval voting: Label: en
22. Collective schedules: axioms and algorithms: Label: en
23. Stable matching with multilayer approval preferences: approvals can be harder than strict preferences: Label: en
24. Fair ride allocation on a line: Label: en
25. Decentralized update selection with semi-strategic experts: Label: en
26. Learning approximately optimal contracts: Label: en
27. On the impact of player capability on congestion games: Label: en
28. On tree equilibria in max-distance network creation games: Label: en
29. Cost-sharing games with rank-based utilities: Label: en
30. A common generalization of budget games and congestion games: Label: en
31. An improved bound for the tree conjecture in network creation games: Label: en
32. Automated equilibrium analysis of \(2\times 2\times 2\) games: Label: en
33. Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location: Label: en
34. Non-cooperative Cost Sharing Games Via Subsidies: Label: en
35. Is Shapley Cost Sharing Optimal?: Label: en
36. Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems: Label: en
37. The Price of Stochastic Anarchy: Label: en
38. On the Hardness and Existence of Quasi-Strict Equilibria: Label: en
39. Subjective vs. Objective Reality — The Risk of Running Late: Label: en
40. Approximate Nash Equilibria for Multi-player Games: Label: en
41. The Local and Global Price of Anarchy of Graphical Games: Label: en
42. Strategic Characterization of the Index of an Equilibrium: Label: en
43. A Hierarchical Model for Cooperative Games: Label: en
44. The Price of Anarchy of a Network Creation Game with Exponential Payoff: Label: en
45. Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity: Label: en
46. Alternatives to Truthfulness Are Hard to Recognize: Label: en
47. A Truthful Mechanism for Offline Ad Slot Scheduling: Label: en
48. Prompt Mechanisms for Online Auctions: Label: en
49. Sensitivity of Wardrop Equilibria: Label: en
50. Facets of the Fully Mixed Nash Equilibrium Conjecture: Label: en