Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Economics and Computation, Volume 9
Volume 9, Number 1, March 2021
- Giorgos Christodoulou
, Tobias Harks:
Introduction to the Special Issue on WINE'18: Part 1. 1:1 - Yiannis Giannakopoulos, Diogo Poças, Keyu Zhu:
Optimal Pricing for MHR and λ-regular Distributions. 2:1-2:28 - Paul W. Goldberg, Francisco J. Marmolejo Cossío:
Learning Convex Partitions and Computing Game-theoretic Equilibria from Best-response Queries. 3:1-3:36 - Pooya Jalaly, Éva Tardos:
Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations. 4:1-4:20 - Nicole Immorlica, Brendan Lucier, Jieming Mao, Vasilis Syrgkanis, Christos Tzamos:
Combinatorial Assortment Optimization. 5:1-5:34
- Andrew Kephart, Vincent Conitzer:
The Revelation Principle for Mechanism Design with Signaling Costs. 6:1-6:35 - Ágnes Cseh, Attila Juhos:
Pairwise Preferences in the Stable Marriage Problem. 7:1-7:28
Volume 9, Number 2, May 2021
- Giorgos Christodoulou, Tobias Harks:
Introduction to the Special Issue on WINE'18: Part 2. 8:1 - Elliot Anshelevich, Wennan Zhu:
Ordinal Approximation for Social Choice, Matching, and Facility Location Problems Given Candidate Positions. 9:1-9:24 - Yu Cheng, Nick Gravin, Kamesh Munagala, Kangning Wang:
A Simple Mechanism for a Budget-Constrained Buyer. 10:1-10:25 - Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. 11:1-11:22 - Zhentao Li, Adrian Vetta:
The Fair Division of Hereditary Set Systems. 12:1-12:19
Volume 9, Number 3, September 2021
- John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Allocation Problems in Ride-sharing Platforms: Online Matching with Offline Reusable Resources. 13:1-13:17 - Vittorio Bilò, Marios Mavronicolas:
∃ℝ-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games. 14:1-14:25 - Aadharsh Kannan, Jacob LaRiviere, R. Preston McAfee:
Characterizing the Usage Intensity of Public Cloud. 15:1-15:18 - Khaled M. Elbassioni:
A QPTAS for ɛ-Envy-Free Profit-Maximizing Pricing on Line Graphs. 16:1-16:31 - Susanne Albers, Dennis Kraft:
On the Value of Penalties in Time-Inconsistent Planning. 17:1-17:18 - Mithun Chakraborty, Ayumi Igarashi, Warut Suksompong, Yair Zick:
Weighted Envy-freeness in Indivisible Item Allocation. 18:1-18:39 - Dario Paccagnan, Rahul Chandan, Bryce L. Ferguson, Jason R. Marden:
Optimal Taxes in Atomic Congestion Games. 19:1-19:33
Volume 9, Number 4, December 2021
- Jiehua Chen, Piotr Skowron, Manuel Sorge:
Matchings under Preferences: Strength of Stability and Tradeoffs. 20:1-20:55 - Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick:
Finding Fair and Efficient Allocations for Matroid Rank Valuations. 21:1-21:41 - Joseph Y. Halpern, Rafael Pass:
Sequential Equilibrium in Games of Imperfect Recall. 22:1-22:26 - Paul Gölz, Anson Kahng, Simon Mackenzie, Ariel D. Procaccia:
The Fluid Mechanics of Liquid Democracy. 23:1-23:39 - Simon Mauras:
Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures. 24:1-24:14 - Anat Ganor, Karthik C. S., Dömötör Pálvölgyi:
On Communication Complexity of Fixed Point Computation. 25:1-25:27
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-18 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
