default search action
Kate Larson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c86]Ian Gemp, Marc Lanctot, Luke Marris, Yiran Mao, Edgar A. Duéñez-Guzmán, Sarah Perrin, Andras Gyorgy, Romuald Elie, Georgios Piliouras, Michael Kaisers, Daniel Hennes, Kalesha Bullard, Kate Larson, Yoram Bachrach:
Approximating the Core via Iterative Coalition Sampling. AAMAS 2024: 669-678 - [c85]Ben Armstrong, Kate Larson:
Liquid Democracy for Low-Cost Ensemble Pruning. AAMAS 2024: 2135-2137 - [c84]Marvin Pafla
, Kate Larson
Unraveling the Dilemma of AI Errors: Exploring the Effectiveness of Human and Machine Explanations for Large Language Models. CHI 2024: 839:1-839:20 - [i39]Ben Armstrong, Kate Larson:
Liquid Democracy for Low-Cost Ensemble Pruning. CoRR abs/2401.17443 (2024) - [i38]Ian Gemp, Marc Lanctot, Luke Marris, Yiran Mao, Edgar A. Duéñez-Guzmán, Sarah Perrin, Andras Gyorgy, Romuald Elie, Georgios Piliouras, Michael Kaisers, Daniel Hennes, Kalesha Bullard, Kate Larson, Yoram Bachrach:
Approximating the Core via Iterative Coalition Sampling. CoRR abs/2402.03928 (2024) - [i37]Marvin Pafla, Kate Larson, Mark Hancock:
Unraveling the Dilemma of AI Errors: Exploring the Effectiveness of Human and Machine Explanations for Large Language Models. CoRR abs/2404.07725 (2024) - [i36]Carter Blair, Ben Armstrong, Kate Larson:
Liquid Ensemble Selection for Continual Learning. CoRR abs/2405.07327 (2024) - 2023
- [c83]Kanav Mehra, Nanda Kishore Sreenivas, Kate Larson:
Deliberation and Voting in Approval-Based Multi-winner Elections. AAMAS Workshops 2023: 77-93 - [c82]Sriram Ganapathi Subramanian, Matthew E. Taylor, Kate Larson, Mark Crowley:
Learning from Multiple Independent Advisors in Multi-agent Reinforcement Learning. AAMAS 2023: 1144-1153 - [c81]Atrisha Sarkar, Kate Larson, Krzysztof Czarnecki:
Revealed Multi-Objective Utility Aggregation in Human Driving. AAMAS 2023: 1979-1987 - [c80]David Radke, Kate Larson, Tim Brecht:
The Importance of Credo in Multiagent Learning. AAMAS 2023: 2243-2252 - [c79]Zun Li, Marc Lanctot, Kevin R. McKee, Luke Marris, Ian Gemp, Daniel Hennes, Kate Larson, Yoram Bachrach, Michael P. Wellman, Paul Muller:
Search-Improved Game-Theoretic Multiagent Reinforcement Learning in General and Negotiation Games. AAMAS 2023: 2445-2447 - [c78]David Radke, Kate Larson, Tim Brecht, Kyle Tilbury:
Towards a Better Understanding of Learning with Multiagent Teams. IJCAI 2023: 271-279 - [c77]Kanav Mehra, Nanda Kishore Sreenivas, Kate Larson:
Deliberation and Voting in Approval-Based Multi-Winner Elections. IJCAI 2023: 2853-2861 - [c76]Sriram Ganapathi Subramanian, Matthew E. Taylor, Kate Larson, Mark Crowley:
Multi-Agent Advisor Q-Learning (Extended Abstract). IJCAI 2023: 6884-6889 - [i35]Sriram Ganapathi Subramanian, Matthew E. Taylor, Kate Larson
Learning from Multiple Independent Advisors in Multi-agent Reinforcement Learning. CoRR abs/2301.11153 (2023) - [i34]Zun Li, Marc Lanctot, Kevin R. McKee, Luke Marris, Ian Gemp, Daniel Hennes, Paul Muller, Kate Larson
Combining Tree-Search, Generative Models, and Nash Bargaining Concepts in Game-Theoretic Reinforcement Learning. CoRR abs/2302.00797 (2023) - [i33]Atrisha Sarkar, Kate Larson
Revealed Multi-Objective Utility Aggregation in Human Driving. CoRR abs/2303.07435 (2023) - [i32]Kanav Mehra, Nanda Kishore Sreenivas, Kate Larson:
Deliberation and Voting in Approval-Based Multi-Winner Elections. CoRR abs/2305.08970 (2023) - [i31]David Radke, Kate Larson, Tim Brecht, Kyle Tilbury:
Towards a Better Understanding of Learning with Multiagent Teams. CoRR abs/2306.16205 (2023) - [i30]Marc Lanctot, Kate Larson
Evaluating Agents using Social Choice Theory. CoRR abs/2312.03121 (2023) - 2022
- [j23]Ian Gemp, Thomas W. Anthony, Yoram Bachrach, Avishkar Bhoopchand, Kalesha Bullard, Jerome T. Connor, Vibhavari Dasagi, Bart De Vylder, Edgar A. Duéñez-Guzmán
Developing, evaluating and scaling learning agents in multi-agent environments. AI Commun. 35(4): 271-284 (2022) - [j22]Sriram Ganapathi Subramanian, Matthew E. Taylor, Kate Larson
Multi-Agent Advisor Q-Learning. J. Artif. Intell. Res. 74: 1-74 (2022) - [c75]Atrisha Sarkar, Kate Larson, Krzysztof Czarnecki:
Generalized Dynamic Cognitive Hierarchy Models for Strategic Driving Behavior. AAAI 2022: 5173-5182 - [c74]Shiri Alouf-Heffetz
How Should We Vote? A Comparison of Voting Systems within Social Networks. IJCAI 2022: 31-38 - [c73]David Radke, Kate Larson, Tim Brecht:
Exploring the Benefits of Teams in Multiagent Learning. IJCAI 2022: 454-460 - [i29]David Radke, Kate Larson
The Importance of Credo in Multiagent Learning. CoRR abs/2204.07471 (2022) - [i28]David Radke, Kate Larson
Exploring the Benefits of Teams in Multiagent Learning. CoRR abs/2205.02328 (2022) - [i27]Ian Gemp, Thomas W. Anthony, Yoram Bachrach, Avishkar Bhoopchand, Kalesha Bullard, Jerome T. Connor, Vibhavari Dasagi, Bart De Vylder, Edgar A. Duéñez-Guzmán, Romuald Elie, Richard Everett, Daniel Hennes, Edward Hughes, Mina Khan, Marc Lanctot, Kate Larson
Developing, Evaluating and Scaling Learning Agents in Multi-Agent Environments. CoRR abs/2209.10958 (2022) - 2021
- [j21]Amirali Salehi-Abari
Group recommendation with noisy subjective preferences. Comput. Intell. 37(1): 210-225 (2021) - [c72]Thomas Ma, Vijay Menon, Kate Larson:
Improving Welfare in One-Sided Matchings using Simple Threshold Queries. IJCAI 2021: 321-327 - [i26]Atrisha Sarkar, Kate Larson, Krzysztof Czarnecki:
Generalized dynamic cognitive hierarchy models for strategic driving behavior. CoRR abs/2109.09861 (2021) - [i25]Atrisha Sarkar, Kate Larson, Krzysztof Czarnecki:
A taxonomy of strategic human interactions in traffic conflicts. CoRR abs/2109.13367 (2021) - [i24]Sriram Ganapathi Subramanian, Matthew E. Taylor, Kate Larson, Mark Crowley:
Multi-Agent Advisor Q-Learning. CoRR abs/2111.00345 (2021) - 2020
- [c71]Greg d'Eon, Kate Larson:
Testing Axioms Against Human Reward Divisions in Cooperative Games. AAMAS 2020: 312-320 - [c70]John A. Doucette, Alan Tsang, Hadi Hosseini, Kate Larson, Robin Cohen:
Inferring True Voting Outcomes in Homophilic Social Networks. AAMAS 2020: 2137-2139 - [c69]Mike Schaekermann, Graeme Beaton, Elaheh Sanoubari, Andrew Lim, Kate Larson
Ambiguity-aware AI Assistants for Medical Data Analysis. CHI 2020: 1-14 - [c68]David Radke, Omid Abari, Tim Brecht, Kate Larson
Can Future Wireless Networks Detect Fires? BuildSys@SenSys 2020: 286-289 - [i23]Vijay Menon, Kate Larson:
Algorithmic Stability in Fair Allocation of Indivisible Goods Among Two Agents. CoRR abs/2007.15203 (2020) - [i22]Thomas Ma, Vijay Menon, Kate Larson:
Improving Welfare in One-sided Matching using Simple Threshold Queries. CoRR abs/2011.13977 (2020) - [i21]Allan Dafoe, Edward Hughes, Yoram Bachrach, Tantum Collins, Kevin R. McKee, Joel Z. Leibo, Kate Larson, Thore Graepel:
Open Problems in Cooperative AI. CoRR abs/2012.08630 (2020)
2010 – 2019
- 2019
- [j20]John A. Doucette
Inferring true voting outcomes in homophilic social networks. Auton. Agents Multi Agent Syst. 33(3): 298-329 (2019) - [j19]Amirali Salehi-Abari, Craig Boutilier, Kate Larson
Empathetic decision making in social networks. Artif. Intell. 275: 174-203 (2019) - [j18]Mike Schaekermann
Understanding Expert Disagreement in Medical Data Analysis through Structured Adjudication. Proc. ACM Hum. Comput. Interact. 3(CSCW): 76:1-76:23 (2019) - [j17]Greg d'Eon, Joslin Goh, Kate Larson
Paying Crowd Workers for Collaborative Work. Proc. ACM Hum. Comput. Interact. 3(CSCW): 125:1-125:24 (2019) - [c67]Hadi Hosseini, Kate Larson:
Multiple Assignment Problems under Lexicographic Preferences. AAMAS 2019: 837-845 - [c66]Vijay Menon, Kate Larson
Mechanism Design for Locating a Facility Under Partial Information. SAGT 2019: 49-62 - [c65]Mike Schaekermann
Capturing Expert Arguments from Medical Adjudication Discussions in a Machine-readable Format. WWW (Companion Volume) 2019: 1131-1137 - [i20]Vijay Menon, Kate Larson:
Mechanism Design for Locating a Facility under Partial Information. CoRR abs/1905.09230 (2019) - 2018
- [j16]Hadi Hosseini
Investigating the characteristics of one-sided matching mechanisms under various preferences and risk attitudes. Auton. Agents Multi Agent Syst. 32(4): 534-567 (2018) - [j15]Mike Schaekermann
Resolvable vs. Irresolvable Disagreement: A Study on Worker Deliberation in Crowd Work. Proc. ACM Hum. Comput. Interact. 2(CSCW): 154:1-154:19 (2018) - [c64]Alan Tsang, Amirali Salehi-Abari, Kate Larson:
Boundedly Rational Voters in Large(r) Networks. AAMAS 2018: 301-308 - [c63]Mike Schaekermann, Edith Law, Kate Larson, Andrew Lim:
Expert Disagreement in Sequential Labeling: A Case Study on Adjudication in Medical Time Series Analysis. SAD/CrowdBias@HCOMP 2018: 55-66 - [c62]Vijay Menon, Kate Larson
Robust and Approximately Stable Marriages Under Partial Information. WINE 2018: 341-355 - [i19]Vijay Menon, Kate Larson:
Robust and Approximately Stable Marriages under Partial Information. CoRR abs/1804.09156 (2018) - 2017
- [j14]Vijay Menon, Kate Larson
Computational aspects of strategic behaviour in elections with top-truncated ballots. Auton. Agents Multi Agent Syst. 31(6): 1506-1547 (2017) - [c61]Vijay Menon, Kate Larson
Deterministic, Strategyproof, and Fair Cake Cutting. IJCAI 2017: 352-358 - [e2]Kate Larson, Michael Winikoff, Sanmay Das, Edmund H. Durfee:
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, São Paulo, Brazil, May 8-12, 2017. ACM 2017 [contents] - [i18]Hadi Hosseini, Kate Larson, Robin Cohen:
Investigating the Characteristics of One-Sided Matching Mechanisms Under Various Preferences and Risk Attitudes. CoRR abs/1703.00320 (2017) - [i17]Vijay Menon, Kate Larson:
Deterministic, Strategyproof, and Fair Cake Cutting. CoRR abs/1705.06306 (2017) - 2016
- [j13]Arthur Carvalho, Stanko Dimitrov
How many crowdsourced workers should a requester hire? Ann. Math. Artif. Intell. 78(1): 45-72 (2016) - [c60]Vijay Menon, Kate Larson:
Reinstating Combinatorial Protections for Manipulation and Bribery in Single-Peaked and Nearly Single-Peaked Electorates. AAAI 2016: 565-571 - [c59]Ankit Pat, Kate Larson, Srinivasen Keshav:
Big-Data Mechanisms and Energy-Policy Design. AAAI 2016: 3887-3893 - [c58]Alan Tsang, Kate Larson:
The Echo Chamber: Strategic Voting and Homophily in Social Networks. AAMAS 2016: 368-375 - [c57]Hadi Hosseini, Kate Larson, Robin Cohen:
Investigating the Characteristics of One-Sided Matching Mechanisms: (Extended Abstract). AAMAS 2016: 1443-1444 - [c56]Shengying Pan, Kate Larson, Josh Bradshaw, Edith Law:
Dynamic Task Allocation Algorithm for Hiring Workers that Learn. IJCAI 2016: 3825-3831 - 2015
- [j12]Jochen Könemann, Kate Larson
Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances. Theory Comput. Syst. 57(3): 655-672 (2015) - [c55]John A. Doucette, Kate Larson, Robin Cohen:
Conventional Machine Learning for Social Choice. AAAI 2015: 858-864 - [c54]Hadi Hosseini, Kate Larson, Robin Cohen:
Matching with Dynamic Ordinal Preferences. AAAI 2015: 936-943 - [c53]Hadi Hosseini, Kate Larson, Robin Cohen:
On Manipulablity of Random Serial Dictatorship in Sequential Matching with Dynamic Preferences. AAAI 2015: 4168-4169 - [i16]Hadi Hosseini, Kate Larson, Robin Cohen:
Random Serial Dictatorship versus Probabilistic Serial Rule: A Tale of Two Random Mechanisms. CoRR abs/1503.01488 (2015) - [i15]Vijay Menon, Kate Larson:
Complexity of Manipulation in Elections with Partial Votes. CoRR abs/1505.05900 (2015) - [i14]Hadi Hosseini, Kate Larson:
Strategyproof Quota Mechanisms for Multiple Assignment Problems. CoRR abs/1507.07064 (2015) - [i13]Vijay Menon, Kate Larson:
Reinstating Combinatorial Protections for Manipulation and Bribery in Single-Peaked and Nearly Single-Peaked Electorates. CoRR abs/1511.08141 (2015) - 2014
- [j11]Arthur Carvalho, Stanko Dimitrov, Kate Larson:
The output-agreement method induces honest behavior in the presence of social projection. SIGecom Exch. 13(1): 77-81 (2014) - [c52]Alan Tsang, Kate Larson:
Opinion dynamics of skeptical agents. AAMAS 2014: 277-284 - [c51]Haifeng Xu, Kate Larson:
Improving the efficiency of crowdsourcing contests. AAMAS 2014: 461-468 - [c50]Arthur Carvalho, Stanko Dimitrov
A Study on the Influence of the Number of MTurkers on the Quality of the Aggregate Output. EUMAS 2014: 285-300 - 2013
- [j10]Martin Macko, Kate Larson
Braess's Paradox for Flows over Time. Theory Comput. Syst. 53(1): 86-106 (2013) - [c49]Alan Tsang, Kate Larson, Rob McAlpine:
Resource Sharing for Control of Wildland Fires. AAAI 2013: 1355-1361 - [c48]Simina Brânzei, Tomasz P. Michalak, Talal Rahwan, Kate Larson, Nicholas R. Jennings:
Matchings with externalities and attitudes. AAMAS 2013: 295-302 - [c47]Tri Kurniawan Wijaya, Kate Larson
Matching demand with supply in the smart grid using agent-based multiunit auction. COMSNETS 2013: 1-6 - [c46]Michael Peter Weingert, Kate Larson:
TrailView: Combining Gamification and Social Network Voting Mechanisms for Useful Data Collection. HCOMP (Works in Progress / Demos) 2013 - [c45]Arthur Carvalho, Kate Larson:
A Consensual Linear Opinion Pool. IJCAI 2013: 2518-2524 - [i12]Arthur Carvalho, Kate Larson:
A Truth Serum for Sharing Rewards. CoRR abs/1305.5170 (2013) - [i11]Arthur Carvalho, Kate Larson:
Sharing a Reward Based on Peer Evaluations. CoRR abs/1306.0428 (2013) - [i10]Tri Kurniawan Wijaya, Kate Larson, Karl Aberer:
Matching Demand with Supply in the Smart Grid using Agent-Based Multiunit Auction. CoRR abs/1308.4761 (2013) - [i9]Arthur Carvalho, Stanko Dimitrov, Kate Larson:
Proper Scoring Rules for Unobservable Outcomes: An Application to the Peer-Review Process. CoRR abs/1309.3197 (2013) - 2012
- [j9]Jie Zhang, Robin Cohen, Kate Larson
Combining Trust Modeling and Mechanism Design for promoting Honesty in E-Marketplaces. Comput. Intell. 28(4): 549-578 (2012) - [j8]Arthur Carvalho, Kate Larson
Sharing Rewards Among Strangers Based on Peer Evaluations. Decis. Anal. 9(3): 253-273 (2012) - [c44]Jochen Könemann, Kate Larson
Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances. SAGT 2012: 216-226 - [e1]Esther David, Kate Larson, Alex Rogers, Onn Shehory, Sebastian Stein:
Agent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets - AMEC 2010, Toronto, ON, Canada, May 10, 2010, and TADA 2010, Cambridge, MA, USA, June 7, 2010 Revised Selected Papers. Lecture Notes in Business Information Processing 118, Springer 2012, ISBN 978-3-642-34199-1 [contents] - [i8]Arthur Carvalho, Kate Larson:
A Consensual Linear Opinion Pool. CoRR abs/1204.5399 (2012) - [i7]Greg Hines, Kate Larson:
Learning When to Take Advice: A Statistical Test for Achieving A Correlated Equilibrium. CoRR abs/1206.3261 (2012) - [i6]Simina Brânzei, Tomasz P. Michalak, Talal Rahwan, Kate Larson, Nicholas R. Jennings:
Matching Games with Additive Externalities. CoRR abs/1207.3682 (2012) - [i5]Jochen Könemann, Kate Larson, David Steiner:
Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances. CoRR abs/1207.6683 (2012) - [i4]Simina Brânzei, Clara Forero, Kate Larson, Peter Bro Miltersen:
Equilibria of Chinese Auctions. CoRR abs/1208.0296 (2012) - 2011
- [j7]Sebastian Stein
Algorithms and mechanisms for procuring services with uncertain durations using redundancy. Artif. Intell. 175(14-15): 2021-2060 (2011) - [j6]Iyad Rahwan
Logical mechanism design. Knowl. Eng. Rev. 26(1): 61-69 (2011) - [j5]Rebecca Bercich, Jon Bernhard, Kate Larson, Jason Lindsey:
Hand-Held Plasma Isolation Device for Point-of-Care Testing. IEEE Trans. Biomed. Eng. 58(3): 759-762 (2011) - [c43]Greg Hines, Kate Larson:
Efficiently Eliciting Preferences from a Group of Users. Interactive Decision Theory and Game Theory 2011 - [c42]Greg Hines, Kate Larson
Efficiently Eliciting Preferences from a Group of Users. ADT 2011: 96-107 - [c41]Arthur Carvalho, Kate Larson:
A truth serum for sharing rewards. AAMAS 2011: 635-642 - [c40]Simina Brânzei, Kate Larson:
Social distance games. AAMAS 2011: 1281-1282 - [c39]Simina Brânzei, Kate Larson
Social Distance Games. IJCAI 2011: 91-96 - 2010
- [c38]Enrico H. Gerding, Sebastian Stein, Kate Larson, Alex Rogers, Nicholas R. Jennings:
Scalable mechanism design for the procurement of services with uncertain durations. AAMAS 2010: 649-656 - [c37]Greg Hines, Kate Larson:
Preference elicitation for risky prospects. AAMAS 2010: 889-896 - [c36]Zinovi Rabinovich, Lachlan Dufton, Kate Larson, Nicholas R. Jennings:
Cultivating desired behaviour: policy teaching via environment-dynamics tweaks. AAMAS 2010: 1097-1104 - [c35]Arthur Carvalho, Kate Larson:
Sharing a reward based on peer evaluations. AAMAS 2010: 1455-1456 - [c34]David Loker, Kate Larson:
An investigation of representations of combinatorial auctions. AAMAS 2010: 1481-1482 - [c33]David Loker, Kate Larson:
Parameterizing the winner determination problem for combinatorial auctions. AAMAS 2010: 1483-1484 - [c32]Shengying Pan, Kate Larson
Argumentation Mechanism Design for Preferred Semantics. COMMA 2010: 403-414 - [c31]Jie Zhang, Robin Cohen, Kate Larson
Leveraging a Social Network of Trust for Promoting Honesty in E-Marketplaces. IFIPTM 2010: 216-231 - [c30]Martin Macko, Kate Larson
Braess's Paradox for Flows over Time. SAGT 2010: 262-275 - [i3]Martin Macko, Kate Larson, L'ubos Steskal:
Braess's Paradox for Flows Over Time. CoRR abs/1007.4864 (2010)
2000 – 2009
- 2009
- [c29]Greg Hines, Kate Larson
Insuring Risk-Averse Agents. ADT 2009: 294-305 - [c28]Enrico H. Gerding
Eliciting Expert Advice in Service-Oriented Computing. AMEC/TADA 2009: 29-43 - [c27]Enrico H. Gerding, Alex Rogers, Kate Larson, Nick R. Jennings:
Mechanism design for task procurement with flexible quality of service. AAMAS (2) 2009: 1259-1260 - [c26]Simina Brânzei, Kate Larson:
Coalitional affinity games. AAMAS (2) 2009: 1319-1320 - [c25]Simina Brânzei, Kate Larson:
Coalitional Affinity Games and the Stability Gap. IJCAI 2009: 79-84 - [c24]Georgia Kastidou, Kate Larson, Robin Cohen:
Exchanging Reputation Information between Communities: A Payment-Function Approach. IJCAI 2009: 195-200 - [c23]Iyad Rahwan, Kate Larson, Fernando A. Tohmé:
A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics. IJCAI 2009: 251-256 - [c22]Sebastian Stein, Enrico H. Gerding, Alex Rogers, Kate Larson, Nicholas R. Jennings:
Flexible Procurement of Services with Uncertain Durations using Redundancy. IJCAI 2009: 292-298 - [c21]Enrico H. Gerding
Mechanism Design for Task Procurement with Flexible Quality of Service. SOCASE 2009: 12-23 - [c20]Jeremy Clark, Urs Hengartner, Kate Larson
Not-So Hidden Information: Optimal Contracts for Undue Influence in E2E Voting Systems. VoteID 2009: 1-17 - [p1]Iyad Rahwan
Argumentation and Game Theory. Argumentation in Artificial Intelligence 2009: 321-339 - 2008
- [c19]Iyad Rahwan, Kate Larson:
Pareto Optimality in Abstract Argumentation. AAAI 2008: 150-155 - [c18]Jie Zhang, Robin Cohen, Kate Larson
A Trust-Based Incentive Mechanism for E-Marketplaces. AAMAS-TRUST 2008: 135-161 - [c17]Iyad Rahwan, Kate Larson:
Mechanism design for abstract argumentation. AAMAS (2) 2008: 1031-1038 - [c16]Greg Hines, Kate Larson:
Using adaptive consultation of experts to improve convergence rates in multiagent learning. AAMAS (3) 2008: 1337-1340 - [c15]Greg Hines, Kate Larson:
Learning When to Take Advice: A Statistical Test for Achieving A Correlated Equilibrium. UAI 2008: 274-281 - 2007
- [c14]Yunqi Zhang, Kate Larson
Reducing Interaction Costs for Self-interested Agents. AMEC/TADA 2007: 166-181 - [i2]Kate Larson:
Reducing Costly Information Acquisition in Auctions. Computational Social Systems and the Internet 2007 - 2006
- [j4]Elodie Fourquet, Kate Larson, William B. Cowan:
A reputation mechanism for layered communities. SIGecom Exch. 6(1): 11-22 (2006) - [c13]Kate Larson
Reducing costly information acquisition in auctions. AAMAS 2006: 1167-1174 - 2005
- [c12]Kate Larson, Tuomas Sandholm:
Mechanism design and deliberative agents. AAMAS 2005: 650-656 - [c11]Shahram Esmaeilsabzali, Kate Larson
Service Allocation for Composite Web Services Based on Quality Attributes. CEC Workshops 2005: 71-82 - 2004
- [c10]Kate Larson, Tuomas Sandholm:
Using Performance Profile Trees to Improve Deliberation Control. AAAI 2004: 73-79 - [c9]Kate Larson, Tuomas Sandholm:
Designing Auctions for Deliberative Agents. AMEC 2004: 87-100 - [c8]Kate Larson, Tuomas Sandholm:
Experiments on Deliberation Equilibria in Auctions. AAMAS 2004: 394-401 - [c7]Kate Larson, Tuomas Sandholm:
Strategic deliberation and truthful revelation: an impossibility result. EC 2004: 264-265 - 2003
- [c6]Kate Larson, Tuomas Sandholm:
Miscomputing ratio: social cost of selfish computing. AAMAS 2003: 273-280 - 2002
- [c5]Kate Larson, Tuomas Sandholm:
An alternating offers bargaining model for computationally limited agents. AAMAS 2002: 135-142 - [c4]Kate Larson, Tuomas Sandholm:
Bidders with hard valuation problems. AAMAS 2002: 160-161 - 2001
- [j3]Kate Larson
Bargaining with limited computation: Deliberation equilibrium. Artif. Intell. 132(2): 183-217 (2001) - 2000
- [j2]Kate Larson
Anytime coalition structure generation: an average case study. J. Exp. Theor. Artif. Intell. 12(1): 23-42 (2000) - [c3]Kate Larson, Tuomas Sandholm:
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems. AAAI/IAAI 2000: 48-55
1990 – 1999
- 1999
- [j1]Tuomas Sandholm, Kate Larson
Coalition Structure Generation with Worst Case Guarantees. Artif. Intell. 111(1-2): 209-238 (1999) - [c2]Kate Larson, Tuomas Sandholm:
Anytime Coalition Structure Generation: An Average Case Study. Agents 1999: 40-47 - 1998
- [c1]Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohmé:
Anytime Coalition Structure Generation with Worst Case Guarantees. AAAI/IAAI 1998: 46-53 - [i1]Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohmé:
Anytime Coalition Structure Generation with Worst Case Guarantees. CoRR cs.MA/9810005 (1998)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 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: